About the Execution of ITS-Tools for JoinFreeModules-PT-0500
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-165271820600205.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-0500, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820600205
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 9.0K Apr 30 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K 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.4K 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 1.6M 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-0500-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0500-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652753430748
Running Version 202205111006
[2022-05-17 02:10:31] [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 02:10:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 02:10:32] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2022-05-17 02:10:32] [INFO ] Transformed 2501 places.
[2022-05-17 02:10:32] [INFO ] Transformed 4001 transitions.
[2022-05-17 02:10:32] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 356 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:32] [INFO ] Computed 500 place invariants in 65 ms
Incomplete random walk after 10278 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=32 ) properties (out of 16) seen :2757
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 16) seen :1507
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 16) seen :1507
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 16) seen :1507
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 16) seen :1511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 16) seen :1507
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 16) seen :1511
// Phase 1: matrix 4001 rows 2500 cols
[2022-05-17 02:10:37] [INFO ] Computed 500 place invariants in 24 ms
[2022-05-17 02:10:37] [INFO ] [Real]Absence check using 500 positive place invariants in 126 ms returned sat
[2022-05-17 02:10:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:10:38] [INFO ] [Real]Absence check using state equation in 1346 ms returned sat
[2022-05-17 02:10:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:10:39] [INFO ] [Nat]Absence check using 500 positive place invariants in 111 ms returned sat
[2022-05-17 02:10:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:10:44] [INFO ] [Nat]Absence check using state equation in 4643 ms returned unknown
[2022-05-17 02:10:44] [INFO ] [Real]Absence check using 500 positive place invariants in 108 ms returned sat
[2022-05-17 02:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:10:45] [INFO ] [Real]Absence check using state equation in 1328 ms returned sat
[2022-05-17 02:10:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:10:46] [INFO ] [Nat]Absence check using 500 positive place invariants in 114 ms returned sat
[2022-05-17 02:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:10:51] [INFO ] [Nat]Absence check using state equation in 4712 ms returned unknown
[2022-05-17 02:10:51] [INFO ] [Real]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:10:52] [INFO ] [Real]Absence check using state equation in 1310 ms returned sat
[2022-05-17 02:10:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:10:53] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:10:57] [INFO ] [Nat]Absence check using state equation in 4708 ms returned unknown
[2022-05-17 02:10:58] [INFO ] [Real]Absence check using 500 positive place invariants in 122 ms returned sat
[2022-05-17 02:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:10:59] [INFO ] [Real]Absence check using state equation in 1296 ms returned sat
[2022-05-17 02:10:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:00] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:11:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:04] [INFO ] [Nat]Absence check using state equation in 4669 ms returned unknown
[2022-05-17 02:11:05] [INFO ] [Real]Absence check using 500 positive place invariants in 109 ms returned sat
[2022-05-17 02:11:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:06] [INFO ] [Real]Absence check using state equation in 1211 ms returned sat
[2022-05-17 02:11:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:06] [INFO ] [Nat]Absence check using 500 positive place invariants in 110 ms returned sat
[2022-05-17 02:11:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:11] [INFO ] [Nat]Absence check using state equation in 4667 ms returned unknown
[2022-05-17 02:11:11] [INFO ] [Real]Absence check using 500 positive place invariants in 103 ms returned sat
[2022-05-17 02:11:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:13] [INFO ] [Real]Absence check using state equation in 1278 ms returned sat
[2022-05-17 02:11:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:13] [INFO ] [Nat]Absence check using 500 positive place invariants in 107 ms returned sat
[2022-05-17 02:11:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:18] [INFO ] [Nat]Absence check using state equation in 4667 ms returned unknown
[2022-05-17 02:11:18] [INFO ] [Real]Absence check using 500 positive place invariants in 105 ms returned sat
[2022-05-17 02:11:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:19] [INFO ] [Real]Absence check using state equation in 1292 ms returned sat
[2022-05-17 02:11:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:20] [INFO ] [Nat]Absence check using 500 positive place invariants in 109 ms returned sat
[2022-05-17 02:11:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:25] [INFO ] [Nat]Absence check using state equation in 4664 ms returned unknown
[2022-05-17 02:11:25] [INFO ] [Real]Absence check using 500 positive place invariants in 108 ms returned sat
[2022-05-17 02:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:26] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2022-05-17 02:11:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:27] [INFO ] [Nat]Absence check using 500 positive place invariants in 107 ms returned sat
[2022-05-17 02:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:31] [INFO ] [Nat]Absence check using state equation in 4671 ms returned unknown
[2022-05-17 02:11:32] [INFO ] [Real]Absence check using 500 positive place invariants in 111 ms returned sat
[2022-05-17 02:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:33] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2022-05-17 02:11:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:33] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:38] [INFO ] [Nat]Absence check using state equation in 4669 ms returned unknown
[2022-05-17 02:11:38] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2022-05-17 02:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:40] [INFO ] [Real]Absence check using state equation in 1205 ms returned sat
[2022-05-17 02:11:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:40] [INFO ] [Nat]Absence check using 500 positive place invariants in 109 ms returned sat
[2022-05-17 02:11:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:45] [INFO ] [Nat]Absence check using state equation in 4666 ms returned unknown
[2022-05-17 02:11:45] [INFO ] [Real]Absence check using 500 positive place invariants in 105 ms returned sat
[2022-05-17 02:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:46] [INFO ] [Real]Absence check using state equation in 1242 ms returned sat
[2022-05-17 02:11:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:47] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:11:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:52] [INFO ] [Nat]Absence check using state equation in 4669 ms returned unknown
[2022-05-17 02:11:52] [INFO ] [Real]Absence check using 500 positive place invariants in 102 ms returned sat
[2022-05-17 02:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:53] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2022-05-17 02:11:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:11:54] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:11:58] [INFO ] [Nat]Absence check using state equation in 4674 ms returned unknown
[2022-05-17 02:11:59] [INFO ] [Real]Absence check using 500 positive place invariants in 103 ms returned sat
[2022-05-17 02:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:00] [INFO ] [Real]Absence check using state equation in 1287 ms returned sat
[2022-05-17 02:12:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:00] [INFO ] [Nat]Absence check using 500 positive place invariants in 121 ms returned sat
[2022-05-17 02:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:05] [INFO ] [Nat]Absence check using state equation in 4683 ms returned unknown
[2022-05-17 02:12:05] [INFO ] [Real]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:07] [INFO ] [Real]Absence check using state equation in 1272 ms returned sat
[2022-05-17 02:12:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:07] [INFO ] [Nat]Absence check using 500 positive place invariants in 105 ms returned sat
[2022-05-17 02:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:12] [INFO ] [Nat]Absence check using state equation in 4673 ms returned unknown
[2022-05-17 02:12:12] [INFO ] [Real]Absence check using 500 positive place invariants in 114 ms returned sat
[2022-05-17 02:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:13] [INFO ] [Real]Absence check using state equation in 1274 ms returned sat
[2022-05-17 02:12:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:14] [INFO ] [Nat]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:19] [INFO ] [Nat]Absence check using state equation in 4661 ms returned unknown
[2022-05-17 02:12:19] [INFO ] [Real]Absence check using 500 positive place invariants in 106 ms returned sat
[2022-05-17 02:12:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:20] [INFO ] [Real]Absence check using state equation in 1272 ms returned sat
[2022-05-17 02:12:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:21] [INFO ] [Nat]Absence check using 500 positive place invariants in 108 ms returned sat
[2022-05-17 02:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:25] [INFO ] [Nat]Absence check using state equation in 4677 ms returned unknown
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503] Max seen :[5, 4, 500, 5, 4, 501, 4, 4, 4, 2, 250, 500, 4, 5, 500, 501]
Support contains 16 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 80 are kept as prefixes of interest. Removing 2420 places using SCC suffix rule.12 ms
Discarding 2420 places :
Also discarding 3872 output transitions
Drop transitions removed 3872 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 44 ms. Remains 80 /2500 variables (removed 2420) and now considering 128/4001 (removed 3873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 02:12:25] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-17 02:12:25] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/2500 places, 128/4001 transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 02:12:25] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 1000027 steps, including 2 resets, run finished after 1232 ms. (steps per millisecond=811 ) properties (out of 16) seen :7940
FORMULA JoinFreeModules-PT-0500-UpperBounds-10 503 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0500-UpperBounds-06 503 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1362 ms. (steps per millisecond=734 ) properties (out of 14) seen :2344
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1401 ms. (steps per millisecond=713 ) properties (out of 14) seen :2238
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1390 ms. (steps per millisecond=719 ) properties (out of 14) seen :1917
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 14) seen :2306
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1384 ms. (steps per millisecond=722 ) properties (out of 14) seen :2327
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1343 ms. (steps per millisecond=744 ) properties (out of 14) seen :2290
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1391 ms. (steps per millisecond=718 ) properties (out of 14) seen :2302
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1376 ms. (steps per millisecond=726 ) properties (out of 14) seen :2313
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1389 ms. (steps per millisecond=719 ) properties (out of 14) seen :1972
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1379 ms. (steps per millisecond=725 ) properties (out of 14) seen :1897
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1331 ms. (steps per millisecond=751 ) properties (out of 14) seen :2377
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1333 ms. (steps per millisecond=750 ) properties (out of 14) seen :2338
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1352 ms. (steps per millisecond=739 ) properties (out of 14) seen :1877
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1304 ms. (steps per millisecond=766 ) properties (out of 14) seen :2348
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 02:12:46] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-17 02:12:46] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 02:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 02:12:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:46] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2022-05-17 02:12:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-17 02:12:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2022-05-17 02:12:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 02:12:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2022-05-17 02:12:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-17 02:12:46] [INFO ] Added : 30 causal constraints over 7 iterations in 203 ms. Result :sat
Minimization took 30 ms.
[2022-05-17 02:12:46] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:46] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 02:12:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2022-05-17 02:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:46] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-17 02:12:46] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:12:46] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:12:46] [INFO ] Added : 14 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 52 ms.
[2022-05-17 02:12:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 02:12:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:47] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2022-05-17 02:12:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:12:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-17 02:12:47] [INFO ] Added : 24 causal constraints over 5 iterations in 95 ms. Result :sat
Minimization took 47 ms.
[2022-05-17 02:12:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-17 02:12:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:47] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2022-05-17 02:12:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:12:47] [INFO ] Added : 23 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 38 ms.
[2022-05-17 02:12:47] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 02:12:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:47] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-17 02:12:47] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2022-05-17 02:12:47] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 02:12:47] [INFO ] Added : 38 causal constraints over 9 iterations in 90 ms. Result :sat
Minimization took 52 ms.
[2022-05-17 02:12:48] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 02:12:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:48] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:12:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:12:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 02:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-17 02:12:48] [INFO ] Added : 29 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 47 ms.
[2022-05-17 02:12:48] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-17 02:12:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:48] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:12:48] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:12:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 02:12:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 02:12:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2022-05-17 02:12:48] [INFO ] Added : 42 causal constraints over 9 iterations in 163 ms. Result :sat
Minimization took 146 ms.
[2022-05-17 02:12:48] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:48] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 02:12:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:48] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-17 02:12:48] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:12:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:12:49] [INFO ] Added : 40 causal constraints over 9 iterations in 101 ms. Result :sat
Minimization took 34 ms.
[2022-05-17 02:12:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:49] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 02:12:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:49] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2022-05-17 02:12:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 02:12:49] [INFO ] Added : 31 causal constraints over 7 iterations in 137 ms. Result :sat
Minimization took 56 ms.
[2022-05-17 02:12:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 02:12:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:49] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2022-05-17 02:12:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:12:49] [INFO ] Added : 38 causal constraints over 9 iterations in 127 ms. Result :sat
Minimization took 40 ms.
[2022-05-17 02:12:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 02:12:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:50] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-17 02:12:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2022-05-17 02:12:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:12:50] [INFO ] Added : 32 causal constraints over 7 iterations in 118 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 02:12:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:50] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 02:12:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 02:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:50] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2022-05-17 02:12:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2022-05-17 02:12:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:12:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 02:12:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 02:12:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 02:12:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2022-05-17 02:12:50] [INFO ] Added : 33 causal constraints over 8 iterations in 262 ms. Result :sat
Minimization took 16 ms.
[2022-05-17 02:12:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 02:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 02:12:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 02:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:50] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-05-17 02:12:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2022-05-17 02:12:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:12:51] [INFO ] Added : 30 causal constraints over 7 iterations in 81 ms. Result :sat
Minimization took 58 ms.
[2022-05-17 02:12:51] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 02:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:51] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 02:12:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:12:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 02:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:12:51] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-17 02:12:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2022-05-17 02:12:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:12:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 02:12:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 02:12:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2022-05-17 02:12:51] [INFO ] Added : 29 causal constraints over 7 iterations in 154 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503] Max seen :[501, 494, 500, 501, 479, 501, 471, 487, 496, 500, 502, 501, 500, 501]
Support contains 14 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 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 8 ms. Remains 70 /80 variables (removed 10) and now considering 112/128 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/80 places, 112/128 transitions.
// Phase 1: matrix 112 rows 70 cols
[2022-05-17 02:12:53] [INFO ] Computed 14 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 14) seen :6925
FORMULA JoinFreeModules-PT-0500-UpperBounds-12 503 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1208 ms. (steps per millisecond=827 ) properties (out of 13) seen :2445
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1237 ms. (steps per millisecond=808 ) properties (out of 13) seen :2405
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1227 ms. (steps per millisecond=814 ) properties (out of 13) seen :1939
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1203 ms. (steps per millisecond=831 ) properties (out of 13) seen :2370
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1241 ms. (steps per millisecond=805 ) properties (out of 13) seen :2409
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1204 ms. (steps per millisecond=830 ) properties (out of 13) seen :2402
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1233 ms. (steps per millisecond=811 ) properties (out of 13) seen :2405
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1232 ms. (steps per millisecond=811 ) properties (out of 13) seen :2409
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1233 ms. (steps per millisecond=811 ) properties (out of 13) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1220 ms. (steps per millisecond=819 ) properties (out of 13) seen :1943
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1197 ms. (steps per millisecond=835 ) properties (out of 13) seen :2363
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1230 ms. (steps per millisecond=813 ) properties (out of 13) seen :1915
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1192 ms. (steps per millisecond=838 ) properties (out of 13) seen :2396
// Phase 1: matrix 112 rows 70 cols
[2022-05-17 02:13:10] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-17 02:13:10] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 02:13:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:10] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-17 02:13:10] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-17 02:13:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:13:10] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:10] [INFO ] Added : 30 causal constraints over 8 iterations in 100 ms. Result :sat
Minimization took 38 ms.
[2022-05-17 02:13:10] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:10] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 02:13:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:10] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-17 02:13:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2022-05-17 02:13:10] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:10] [INFO ] Added : 30 causal constraints over 6 iterations in 68 ms. Result :sat
Minimization took 33 ms.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 02:13:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:11] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:11] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:11] [INFO ] Added : 27 causal constraints over 6 iterations in 70 ms. Result :sat
Minimization took 37 ms.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 02:13:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:11] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Nat]Added 14 Read/Feed constraints in 9 ms returned sat
[2022-05-17 02:13:11] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:11] [INFO ] Added : 35 causal constraints over 8 iterations in 87 ms. Result :sat
Minimization took 38 ms.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 02:13:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:11] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 02:13:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-17 02:13:11] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-17 02:13:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-17 02:13:11] [INFO ] Added : 27 causal constraints over 6 iterations in 157 ms. Result :sat
Minimization took 26 ms.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 02:13:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Added 14 Read/Feed constraints in 22 ms returned sat
[2022-05-17 02:13:12] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:12] [INFO ] Added : 30 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 37 ms.
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 02:13:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:12] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:13:12] [INFO ] Added : 23 causal constraints over 5 iterations in 78 ms. Result :sat
Minimization took 35 ms.
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 02:13:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2022-05-17 02:13:12] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:13:12] [INFO ] Added : 22 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 02:13:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Added 14 Read/Feed constraints in 23 ms returned sat
[2022-05-17 02:13:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 02:13:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 02:13:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:13] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2022-05-17 02:13:13] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:13:13] [INFO ] Added : 17 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 46 ms.
[2022-05-17 02:13:13] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 02:13:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:13] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Nat]Added 14 Read/Feed constraints in 21 ms returned sat
[2022-05-17 02:13:13] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 02:13:13] [INFO ] Added : 37 causal constraints over 9 iterations in 141 ms. Result :sat
Minimization took 32 ms.
[2022-05-17 02:13:13] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 02:13:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:13] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Nat]Added 14 Read/Feed constraints in 24 ms returned sat
[2022-05-17 02:13:13] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:13] [INFO ] Added : 23 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 28 ms.
[2022-05-17 02:13:13] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 02:13:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:13] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-17 02:13:13] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2022-05-17 02:13:13] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 02:13:14] [INFO ] Added : 18 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503, 502, 503, 503, 503, 503] Max seen :[501, 501, 500, 501, 501, 501, 500, 501, 502, 500, 501, 500, 501]
FORMULA JoinFreeModules-PT-0500-UpperBounds-09 502 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 12 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 60 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 4 ms. Remains 60 /70 variables (removed 10) and now considering 96/112 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 96/112 transitions.
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:13:15] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000177 steps, including 2 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 12) seen :5957
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 12) seen :2456
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 12) seen :2534
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 12) seen :2055
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 12) seen :2465
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 12) seen :2496
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 12) seen :2447
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 12) seen :2494
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1110 ms. (steps per millisecond=900 ) properties (out of 12) seen :2478
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 12) seen :2069
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties (out of 12) seen :2463
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1100 ms. (steps per millisecond=909 ) properties (out of 12) seen :2018
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 12) seen :2461
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:13:28] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:13:28] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:28] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:13:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:28] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 02:13:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:13:28] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:28] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:13:29] [INFO ] Added : 23 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 70 ms.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:13:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Added 12 Read/Feed constraints in 25 ms returned sat
[2022-05-17 02:13:29] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:13:29] [INFO ] Added : 10 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 16 ms.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 02:13:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Added 12 Read/Feed constraints in 25 ms returned sat
[2022-05-17 02:13:29] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:13:29] [INFO ] Added : 10 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 35 ms.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:13:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:13:29] [INFO ] Added : 15 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 28 ms.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:13:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:29] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-17 02:13:29] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:29] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-17 02:13:30] [INFO ] Added : 27 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 34 ms.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:13:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:13:30] [INFO ] Added : 5 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:13:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2022-05-17 02:13:30] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:30] [INFO ] Added : 12 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 02:13:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:13:30] [INFO ] Added : 10 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 02:13:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Added 12 Read/Feed constraints in 24 ms returned sat
[2022-05-17 02:13:30] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:13:30] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 15 ms.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:13:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:31] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-17 02:13:31] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:31] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:13:31] [INFO ] Added : 17 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 29 ms.
[2022-05-17 02:13:31] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2022-05-17 02:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 02:13:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:31] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-17 02:13:31] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:13:31] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:13:31] [INFO ] Added : 32 causal constraints over 7 iterations in 108 ms. Result :sat
Minimization took 31 ms.
[2022-05-17 02:13:31] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:13:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:31] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-17 02:13:31] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:31] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 02:13:31] [INFO ] Added : 9 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503] Max seen :[501, 501, 500, 501, 501, 501, 501, 501, 500, 501, 500, 501]
Support contains 12 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 96/96 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:13:32] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:13:32] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:13:32] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-17 02:13:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:13:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-17 02:13:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:13:32] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-17 02:13:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 96/96 transitions.
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:13:32] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 827 ms. (steps per millisecond=1209 ) properties (out of 12) seen :5958
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 12) seen :2479
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 12) seen :2469
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 12) seen :2104
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1029 ms. (steps per millisecond=971 ) properties (out of 12) seen :2458
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 12) seen :2486
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 12) seen :2427
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1115 ms. (steps per millisecond=896 ) properties (out of 12) seen :2485
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1115 ms. (steps per millisecond=896 ) properties (out of 12) seen :2459
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 12) seen :2033
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 12) seen :2462
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 12) seen :2073
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 12) seen :2460
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:13:46] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:13:46] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:13:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:46] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-17 02:13:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:13:46] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:13:46] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:46] [INFO ] Added : 23 causal constraints over 6 iterations in 82 ms. Result :sat
Minimization took 70 ms.
[2022-05-17 02:13:46] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 02:13:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:13:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:46] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-17 02:13:46] [INFO ] [Nat]Added 12 Read/Feed constraints in 24 ms returned sat
[2022-05-17 02:13:46] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:13:46] [INFO ] Added : 10 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 16 ms.
[2022-05-17 02:13:46] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 02:13:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Added 12 Read/Feed constraints in 26 ms returned sat
[2022-05-17 02:13:47] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:13:47] [INFO ] Added : 10 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 37 ms.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 02:13:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:13:47] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:13:47] [INFO ] Added : 15 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 31 ms.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 02:13:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:13:47] [INFO ] Added : 27 causal constraints over 7 iterations in 81 ms. Result :sat
Minimization took 35 ms.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 02:13:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:13:47] [INFO ] Added : 5 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 14 ms.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:13:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:13:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:13:48] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-17 02:13:48] [INFO ] [Nat]Added 12 Read/Feed constraints in 26 ms returned sat
[2022-05-17 02:13:48] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 4 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 02:13:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:13:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:13:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:13:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 02:14:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 02:14:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 02:14:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:13] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 5 ms to minimize.
[2022-05-17 02:14:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 02:14:23] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 02:14:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 02:14:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 02:14:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 02:14:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 02:14:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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 02:14:33] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:14:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:14:33] [INFO ] Added : 10 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:14:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 25 ms returned sat
[2022-05-17 02:14:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 02:14:33] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 16 ms.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 02:14:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:14:33] [INFO ] Added : 17 causal constraints over 5 iterations in 69 ms. Result :sat
Minimization took 28 ms.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:14:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:33] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-17 02:14:33] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:33] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:14:33] [INFO ] Added : 32 causal constraints over 7 iterations in 118 ms. Result :sat
Minimization took 30 ms.
[2022-05-17 02:14:34] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:14:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:34] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-17 02:14:34] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:14:34] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:14:34] [INFO ] Added : 9 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503, 503] Max seen :[501, 501, 500, 501, 501, 501, 502, 501, 500, 501, 500, 501]
Support contains 12 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 96/96 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:35] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:35] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:35] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:35] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-17 02:14:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:35] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:35] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 96/96 transitions.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-00
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:35] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 1) seen :501
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 :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:35] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-17 02:14:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:14:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:35] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 02:14:35] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:35] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:14:35] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:14:35] [INFO ] Added : 23 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:35] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=8000 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=3861 ) properties (out of 1) seen :501
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:36] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 02:14:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:36] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-17 02:14:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-00 in 988 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-01
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:36] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10056 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1005 ) properties (out of 1) seen :300
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 :120
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:36] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:36] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 02:14:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:36] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-17 02:14:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:36] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:36] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:14:36] [INFO ] Added : 5 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[300]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:36] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:36] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:36] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000079 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8265 ) properties (out of 1) seen :498
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7246 ) properties (out of 1) seen :501
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:36] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 02:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 02:14:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 02:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-17 02:14:36] [INFO ] Added : 5 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:37] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 02:14:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-17 02:14:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:37] [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.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=8064 ) properties (out of 1) seen :499
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :499
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:37] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:37] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 02:14:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 02:14:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-17 02:14:37] [INFO ] Added : 5 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:37] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-17 02:14:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:37] [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-0500-UpperBounds-01 in 1407 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:37] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10102 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=841 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :500
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:37] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:14:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-17 02:14:37] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:37] [INFO ] [Nat]Added 12 Read/Feed constraints in 32 ms returned sat
[2022-05-17 02:14:37] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 02:14:37] [INFO ] Added : 10 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 6 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:37] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:37] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000072 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8403 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=5952 ) properties (out of 1) seen :500
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:38] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 02:14:38] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 02:14:38] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
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 2 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 02:14:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:38] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:38] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-17 02:14:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:38] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-02 in 752 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-03
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:38] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10141 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1126 ) properties (out of 1) seen :501
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 :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:38] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-17 02:14:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:38] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:14:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:38] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 02:14:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:38] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:38] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 02:14:38] [INFO ] Added : 15 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:38] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000063 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=6134 ) properties (out of 1) seen :501
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 02:14:39] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:39] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:39] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:39] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-17 02:14:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:39] [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-0500-UpperBounds-03 in 771 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-04
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:39] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10025 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=835 ) 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 :120
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:39] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:39] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 02:14:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-17 02:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:39] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-17 02:14:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:39] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:14:39] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:14:39] [INFO ] Added : 37 causal constraints over 9 iterations in 100 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[120]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 6 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:39] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:39] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000136 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=8065 ) properties (out of 1) seen :498
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :500
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 02:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:40] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:40] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-17 02:14:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-17 02:14:40] [INFO ] Added : 5 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
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 02:14:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:40] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-17 02:14:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:40] [INFO ] Dead Transitions using invariants and state equation in 15 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 02:14:40] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000039 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8403 ) properties (out of 1) seen :499
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :498
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:40] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:40] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 02:14:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-17 02:14:40] [INFO ] Added : 5 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
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 02:14:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:40] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:40] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-17 02:14:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:40] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-04 in 1617 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-05
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:40] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10027 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1002 ) properties (out of 1) seen :501
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 :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:40] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:40] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 02:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:40] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-17 02:14:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:40] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:40] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:14:40] [INFO ] Added : 5 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:41] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000071 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=8475 ) properties (out of 1) seen :501
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 :501
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 02:14:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 02:14:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:41] [INFO ] Added : 6 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:41] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:41] [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 02:14:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:41] [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-0500-UpperBounds-05 in 746 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-07
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:41] [INFO ] Computed 12 place invariants in 2 ms
Incomplete random walk after 10179 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1017 ) properties (out of 1) seen :250
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 :120
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:41] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:41] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:41] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:14:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:41] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-17 02:14:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:41] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:41] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:14:41] [INFO ] Added : 20 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[250]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:41] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:41] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 1) seen :499
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :500
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 02:14:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 02:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:14:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 02:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-17 02:14:42] [INFO ] Added : 5 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
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 02:14:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:42] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 02:14:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:42] [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 02:14:42] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000038 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=8197 ) properties (out of 1) seen :496
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :499
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 02:14:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 02:14:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-17 02:14:42] [INFO ] Added : 5 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
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 02:14:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:42] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 02:14:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:42] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-07 in 1493 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-08
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:42] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10084 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=916 ) properties (out of 1) seen :250
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 :120
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:43] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 02:14:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:43] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-17 02:14:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:43] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2022-05-17 02:14:43] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:14:43] [INFO ] Added : 19 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[250]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:43] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000250 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=8198 ) properties (out of 1) seen :499
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6944 ) properties (out of 1) seen :501
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:43] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 02:14:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:14:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 02:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-17 02:14:43] [INFO ] Added : 5 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:43] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-17 02:14:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:43] [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.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:43] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000069 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=8475 ) properties (out of 1) seen :499
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :498
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 02:14:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 02:14:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 02:14:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-17 02:14:44] [INFO ] Added : 5 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:44] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:44] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-17 02:14:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:44] [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-0500-UpperBounds-08 in 1438 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-11
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:44] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10055 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=914 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :500
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:44] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-17 02:14:44] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:14:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:44] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-17 02:14:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:44] [INFO ] [Nat]Added 12 Read/Feed constraints in 25 ms returned sat
[2022-05-17 02:14:44] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 02:14:44] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:44] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000036 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8264 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=6060 ) properties (out of 1) seen :500
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 02:14:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:45] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
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 02:14:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-17 02:14:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:45] [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-0500-UpperBounds-11 in 703 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-13
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:45] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10153 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=923 ) properties (out of 1) seen :501
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 :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:45] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-17 02:14:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:45] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 02:14:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:45] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-17 02:14:45] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:45] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2022-05-17 02:14:45] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:14:45] [INFO ] Added : 17 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:45] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000015 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=8333 ) properties (out of 1) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=6097 ) properties (out of 1) seen :501
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:45] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 02:14:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 02:14:45] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:45] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:45] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-17 02:14:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:45] [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-0500-UpperBounds-13 in 811 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:45] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10055 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=914 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :500
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:45] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-17 02:14:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:45] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 02:14:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-17 02:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:46] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-17 02:14:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:46] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:14:46] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 02:14:46] [INFO ] Added : 32 causal constraints over 7 iterations in 111 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:46] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000085 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=8197 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=6172 ) properties (out of 1) seen :500
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:46] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 02:14:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:46] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[500]
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 6 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 02:14:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:46] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-17 02:14:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0500-UpperBounds-14 in 808 ms.
Starting property specific reduction for JoinFreeModules-PT-0500-UpperBounds-15
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:46] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10409 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1487 ) properties (out of 1) seen :501
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 :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-17 02:14:46] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-17 02:14:46] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 02:14:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-17 02:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:46] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 02:14:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-17 02:14:46] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2022-05-17 02:14:46] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 02:14:46] [INFO ] Added : 9 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:47] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:47] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000111 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=8000 ) properties (out of 1) seen :501
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 :501
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 02:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:47] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 02:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 02:14:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 02:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 02:14:47] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 02:14:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 02:14:47] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 02:14:47] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [503] Max seen :[501]
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 02:14:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 02:14:47] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 02:14:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-17 02:14:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 02:14:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 02:14:47] [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-0500-UpperBounds-15 in 765 ms.
[2022-05-17 02:14:47] [INFO ] Flatten gal took : 39 ms
[2022-05-17 02:14:47] [INFO ] Applying decomposition
[2022-05-17 02:14:47] [INFO ] Flatten gal took : 10 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/graph94016179167962254.txt' '-o' '/tmp/graph94016179167962254.bin' '-w' '/tmp/graph94016179167962254.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph94016179167962254.bin' '-l' '-1' '-v' '-w' '/tmp/graph94016179167962254.weights' '-q' '0' '-e' '0.001'
[2022-05-17 02:14:47] [INFO ] Decomposing Gal with order
[2022-05-17 02:14:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 02:14:47] [INFO ] Flatten gal took : 14 ms
[2022-05-17 02:14:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 02:14:47] [INFO ] Time to serialize gal into /tmp/UpperBounds17971910588944110089.gal : 3 ms
[2022-05-17 02:14:47] [INFO ] Time to serialize properties into /tmp/UpperBounds8232630082341617595.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/UpperBounds17971910588944110089.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8232630082341617595.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds8232630082341617595.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.64439e+113,122.611,1138204,14,3519,40,2.01088e+06,53,0,66,2.38547e+06,0
Total reachable state count : 1.644393559345083542484498317339277290342e+113
Verifying 12 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-00 :0 <= u6.p1177 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-00 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-00,0,124.728,1138204,1,0,71,2.01088e+06,125,13,585,2.38547e+06,140
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-01 :0 <= u9.p1794 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-01 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-01,0,124.859,1138204,1,0,77,2.01088e+06,153,13,1093,2.38547e+06,155
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-02 :0 <= u10.p1898 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-02 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-02,0,125.84,1138204,1,0,81,2.01088e+06,179,13,1601,2.38547e+06,163
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-03 :0 <= u7.p1612 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-03 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-03,0,125.84,1138204,1,0,87,2.01088e+06,200,13,1601,2.38547e+06,174
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-04 :0 <= u1.p144 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-04 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-04,0,125.841,1138204,1,0,99,2.01088e+06,225,13,1601,2.38547e+06,197
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-05 :0 <= u11.p2092 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-05 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-05,0,125.841,1138204,1,0,101,2.01088e+06,249,13,1601,2.38547e+06,202
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-07 :0 <= u4.p794 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-07 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-07,0,125.841,1138204,1,0,110,2.01088e+06,267,13,1601,2.38547e+06,219
Min sum of variable value : 0
Maximum sum along a path : 502
Bounds property JoinFreeModules-PT-0500-UpperBounds-08 :0 <= u2.p539 <= 502
FORMULA JoinFreeModules-PT-0500-UpperBounds-08 502 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-08,0,125.841,1138204,1,0,121,2.01088e+06,283,13,1601,2.38547e+06,240
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-11 :0 <= u3.p663 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-11 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-11,0,125.841,1138204,1,0,131,2.01088e+06,300,13,1601,2.38547e+06,259
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-13 :0 <= u5.p1062 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-13 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-13,0,125.842,1138204,1,0,139,2.01088e+06,319,13,1601,2.38547e+06,274
Min sum of variable value : 0
Maximum sum along a path : 500
Bounds property JoinFreeModules-PT-0500-UpperBounds-14 :0 <= u0.p3 <= 500
FORMULA JoinFreeModules-PT-0500-UpperBounds-14 500 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-14,0,125.842,1138204,1,0,151,2.01088e+06,334,13,1601,2.38547e+06,297
Min sum of variable value : 0
Maximum sum along a path : 501
Bounds property JoinFreeModules-PT-0500-UpperBounds-15 :0 <= u8.p1677 <= 501
FORMULA JoinFreeModules-PT-0500-UpperBounds-15 501 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0500-UpperBounds-15,0,125.842,1138204,1,0,156,2.01088e+06,356,13,1601,2.38547e+06,306
Total runtime 382020 ms.
BK_STOP 1652753814012
--------------------
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-0500"
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-0500, 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-165271820600205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;