fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r255-tall-167856440300027
Last Updated
May 14, 2023

About the Execution of 2022-gold for JoinFreeModules-PT-1000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8650.703 1483614.00 1531400.00 2757.40 1003 1002 1002 1003 1000 1003 1001 1000 1002 1000 1002 1000 1002 1001 1003 1001 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 5 18:22 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-1000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678747867531

Running Version 202205111006
[2023-03-13 22:51:08] [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]
[2023-03-13 22:51:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:51:09] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2023-03-13 22:51:09] [INFO ] Transformed 5001 places.
[2023-03-13 22:51:09] [INFO ] Transformed 8001 transitions.
[2023-03-13 22:51:09] [INFO ] Parsed PT model containing 5001 places and 8001 transitions in 460 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 8001 rows 5000 cols
[2023-03-13 22:51:09] [INFO ] Computed 1000 place invariants in 88 ms
Incomplete random walk after 10516 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=24 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 16) seen :4007
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 16) seen :4007
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-13 22:51:15] [INFO ] Computed 1000 place invariants in 41 ms
[2023-03-13 22:51:16] [INFO ] [Real]Absence check using 1000 positive place invariants in 265 ms returned sat
[2023-03-13 22:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:20] [INFO ] [Real]Absence check using state equation in 3477 ms returned sat
[2023-03-13 22:51:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:21] [INFO ] [Nat]Absence check using 1000 positive place invariants in 256 ms returned sat
[2023-03-13 22:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:25] [INFO ] [Nat]Absence check using state equation in 4314 ms returned unknown
[2023-03-13 22:51:26] [INFO ] [Real]Absence check using 1000 positive place invariants in 263 ms returned sat
[2023-03-13 22:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:29] [INFO ] [Real]Absence check using state equation in 3511 ms returned sat
[2023-03-13 22:51:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:30] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2023-03-13 22:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:34] [INFO ] [Nat]Absence check using state equation in 4372 ms returned unknown
[2023-03-13 22:51:35] [INFO ] [Real]Absence check using 1000 positive place invariants in 272 ms returned sat
[2023-03-13 22:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:39] [INFO ] [Real]Absence check using state equation in 3367 ms returned sat
[2023-03-13 22:51:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:40] [INFO ] [Nat]Absence check using 1000 positive place invariants in 263 ms returned sat
[2023-03-13 22:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:44] [INFO ] [Nat]Absence check using state equation in 4302 ms returned unknown
[2023-03-13 22:51:45] [INFO ] [Real]Absence check using 1000 positive place invariants in 259 ms returned sat
[2023-03-13 22:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:48] [INFO ] [Real]Absence check using state equation in 3471 ms returned sat
[2023-03-13 22:51:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:49] [INFO ] [Nat]Absence check using 1000 positive place invariants in 269 ms returned sat
[2023-03-13 22:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:53] [INFO ] [Nat]Absence check using state equation in 4296 ms returned unknown
[2023-03-13 22:51:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 274 ms returned sat
[2023-03-13 22:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:58] [INFO ] [Real]Absence check using state equation in 3567 ms returned sat
[2023-03-13 22:51:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:59] [INFO ] [Nat]Absence check using 1000 positive place invariants in 274 ms returned sat
[2023-03-13 22:51:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:03] [INFO ] [Nat]Absence check using state equation in 4281 ms returned unknown
[2023-03-13 22:52:04] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2023-03-13 22:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:07] [INFO ] [Real]Absence check using state equation in 3598 ms returned sat
[2023-03-13 22:52:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:52:08] [INFO ] [Nat]Absence check using 1000 positive place invariants in 274 ms returned sat
[2023-03-13 22:52:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:13] [INFO ] [Nat]Absence check using state equation in 4380 ms returned unknown
[2023-03-13 22:52:13] [INFO ] [Real]Absence check using 1000 positive place invariants in 265 ms returned sat
[2023-03-13 22:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:17] [INFO ] [Real]Absence check using state equation in 3810 ms returned sat
[2023-03-13 22:52:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:52:18] [INFO ] [Nat]Absence check using 1000 positive place invariants in 269 ms returned sat
[2023-03-13 22:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:22] [INFO ] [Nat]Absence check using state equation in 4293 ms returned unknown
[2023-03-13 22:52:23] [INFO ] [Real]Absence check using 1000 positive place invariants in 247 ms returned sat
[2023-03-13 22:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:27] [INFO ] [Real]Absence check using state equation in 3380 ms returned sat
[2023-03-13 22:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:52:27] [INFO ] [Nat]Absence check using 1000 positive place invariants in 262 ms returned sat
[2023-03-13 22:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:32] [INFO ] [Nat]Absence check using state equation in 4373 ms returned unknown
[2023-03-13 22:52:32] [INFO ] [Real]Absence check using 1000 positive place invariants in 255 ms returned sat
[2023-03-13 22:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:36] [INFO ] [Real]Absence check using state equation in 3513 ms returned sat
[2023-03-13 22:52:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:52:37] [INFO ] [Nat]Absence check using 1000 positive place invariants in 246 ms returned sat
[2023-03-13 22:52:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:41] [INFO ] [Nat]Absence check using state equation in 4363 ms returned unknown
[2023-03-13 22:52:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 251 ms returned sat
[2023-03-13 22:52:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:45] [INFO ] [Real]Absence check using state equation in 3510 ms returned sat
[2023-03-13 22:52:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:52:46] [INFO ] [Nat]Absence check using 1000 positive place invariants in 258 ms returned sat
[2023-03-13 22:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:51] [INFO ] [Nat]Absence check using state equation in 4359 ms returned unknown
[2023-03-13 22:52:51] [INFO ] [Real]Absence check using 1000 positive place invariants in 260 ms returned sat
[2023-03-13 22:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:52:55] [INFO ] [Real]Absence check using state equation in 3648 ms returned sat
[2023-03-13 22:52:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:52:56] [INFO ] [Nat]Absence check using 1000 positive place invariants in 257 ms returned sat
[2023-03-13 22:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:00] [INFO ] [Nat]Absence check using state equation in 4336 ms returned unknown
[2023-03-13 22:53:01] [INFO ] [Real]Absence check using 1000 positive place invariants in 251 ms returned sat
[2023-03-13 22:53:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:05] [INFO ] [Real]Absence check using state equation in 3543 ms returned sat
[2023-03-13 22:53:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:53:05] [INFO ] [Nat]Absence check using 1000 positive place invariants in 253 ms returned sat
[2023-03-13 22:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:10] [INFO ] [Nat]Absence check using state equation in 4364 ms returned unknown
[2023-03-13 22:53:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 256 ms returned sat
[2023-03-13 22:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:14] [INFO ] [Real]Absence check using state equation in 3501 ms returned sat
[2023-03-13 22:53:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:53:15] [INFO ] [Nat]Absence check using 1000 positive place invariants in 252 ms returned sat
[2023-03-13 22:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:19] [INFO ] [Nat]Absence check using state equation in 4368 ms returned unknown
[2023-03-13 22:53:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 255 ms returned sat
[2023-03-13 22:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:23] [INFO ] [Real]Absence check using state equation in 3466 ms returned sat
[2023-03-13 22:53:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:53:24] [INFO ] [Nat]Absence check using 1000 positive place invariants in 264 ms returned sat
[2023-03-13 22:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:29] [INFO ] [Nat]Absence check using state equation in 4344 ms returned unknown
[2023-03-13 22:53:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 248 ms returned sat
[2023-03-13 22:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:33] [INFO ] [Real]Absence check using state equation in 3518 ms returned sat
[2023-03-13 22:53:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:53:34] [INFO ] [Nat]Absence check using 1000 positive place invariants in 257 ms returned sat
[2023-03-13 22:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:38] [INFO ] [Nat]Absence check using state equation in 4366 ms returned unknown
[2023-03-13 22:53:39] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2023-03-13 22:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:42] [INFO ] [Real]Absence check using state equation in 3432 ms returned sat
[2023-03-13 22:53:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:53:43] [INFO ] [Nat]Absence check using 1000 positive place invariants in 262 ms returned sat
[2023-03-13 22:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:53:47] [INFO ] [Nat]Absence check using state equation in 4349 ms returned unknown
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[2, 2, 2, 2, 1000, 2, 3, 1000, 2, 1000, 2, 1000, 2, 3, 2, 3]
Support contains 16 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 80 are kept as prefixes of interest. Removing 4920 places using SCC suffix rule.17 ms
Discarding 4920 places :
Also discarding 7872 output transitions
Drop transitions removed 7872 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 64 ms. Remains 80 /5000 variables (removed 4920) and now considering 128/8001 (removed 7873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:53:48] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:53:48] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/5000 places, 128/8001 transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:53:48] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 1000023 steps, including 2 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 16) seen :15781
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 16) seen :5306
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 16) seen :4985
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 16) seen :4984
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 946 ms. (steps per millisecond=1057 ) properties (out of 16) seen :5311
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 963 ms. (steps per millisecond=1038 ) properties (out of 16) seen :4348
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 952 ms. (steps per millisecond=1050 ) properties (out of 16) seen :5305
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 16) seen :5275
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 16) seen :4351
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 941 ms. (steps per millisecond=1062 ) properties (out of 16) seen :5026
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 16) seen :4325
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 16) seen :5061
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 16) seen :4363
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 16) seen :4398
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 16) seen :5283
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 16) seen :5336
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 16) seen :5272
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:04] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-13 22:54:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:04] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:54:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:04] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-13 22:54:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:54:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:04] [INFO ] Added : 36 causal constraints over 8 iterations in 107 ms. Result :sat
Minimization took 50 ms.
[2023-03-13 22:54:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:04] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-13 22:54:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:04] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-13 22:54:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 4 ms to minimize.
[2023-03-13 22:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-13 22:54:04] [INFO ] Added : 47 causal constraints over 10 iterations in 195 ms. Result :sat
Minimization took 113 ms.
[2023-03-13 22:54:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:54:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:05] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-13 22:54:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:54:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2023-03-13 22:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-13 22:54:05] [INFO ] Added : 61 causal constraints over 13 iterations in 258 ms. Result :sat
Minimization took 105 ms.
[2023-03-13 22:54:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:05] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-13 22:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:05] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-03-13 22:54:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:54:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:05] [INFO ] Added : 47 causal constraints over 11 iterations in 131 ms. Result :sat
Minimization took 53 ms.
[2023-03-13 22:54:06] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:06] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2023-03-13 22:54:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:54:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2023-03-13 22:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-13 22:54:06] [INFO ] Added : 37 causal constraints over 8 iterations in 141 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 22:54:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:06] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 22 ms returned sat
[2023-03-13 22:54:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:54:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-13 22:54:06] [INFO ] Added : 53 causal constraints over 12 iterations in 218 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:54:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:54:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:06] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:54:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:54:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:54:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2023-03-13 22:54:07] [INFO ] Added : 42 causal constraints over 9 iterations in 212 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:54:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:07] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:54:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:07] [INFO ] Added : 50 causal constraints over 11 iterations in 143 ms. Result :sat
Minimization took 50 ms.
[2023-03-13 22:54:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:07] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:54:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:07] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:54:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:54:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-13 22:54:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:54:07] [INFO ] Added : 41 causal constraints over 9 iterations in 120 ms. Result :sat
Minimization took 76 ms.
[2023-03-13 22:54:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:08] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:54:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-13 22:54:08] [INFO ] Added : 57 causal constraints over 14 iterations in 260 ms. Result :sat
Minimization took 61 ms.
[2023-03-13 22:54:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:08] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:08] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 22:54:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:54:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:54:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-03-13 22:54:08] [INFO ] Added : 45 causal constraints over 10 iterations in 216 ms. Result :sat
Minimization took 55 ms.
[2023-03-13 22:54:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:09] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:09] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-13 22:54:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 14 ms returned sat
[2023-03-13 22:54:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:54:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-13 22:54:09] [INFO ] Added : 43 causal constraints over 10 iterations in 172 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 22:54:09] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:09] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-13 22:54:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-13 22:54:09] [INFO ] Added : 58 causal constraints over 12 iterations in 320 ms. Result :sat
Minimization took 73 ms.
[2023-03-13 22:54:10] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:10] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2023-03-13 22:54:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-13 22:54:10] [INFO ] Added : 52 causal constraints over 12 iterations in 183 ms. Result :sat
Minimization took 38 ms.
[2023-03-13 22:54:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:10] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 22:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-13 22:54:10] [INFO ] Added : 43 causal constraints over 10 iterations in 171 ms. Result :sat
Minimization took 58 ms.
[2023-03-13 22:54:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:11] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 22:54:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:11] [INFO ] Added : 44 causal constraints over 12 iterations in 144 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[1000, 943, 895, 1000, 1000, 1000, 1001, 1000, 980, 1000, 984, 1000, 976, 1001, 1000, 1001]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:14] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-13 22:54:14] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:14] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:54:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:54:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-13 22:54:14] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:14] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:54:14] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:14] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 1000389 steps, including 2 resets, run finished after 758 ms. (steps per millisecond=1319 ) properties (out of 16) seen :15663
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 16) seen :5301
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 16) seen :5008
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 16) seen :4970
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 16) seen :5321
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 16) seen :4353
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties (out of 16) seen :5341
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 16) seen :5277
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 16) seen :4354
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 16) seen :4989
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 16) seen :4344
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 16) seen :4986
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties (out of 16) seen :4339
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 968 ms. (steps per millisecond=1033 ) properties (out of 16) seen :4470
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 16) seen :5297
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 16) seen :5315
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 932 ms. (steps per millisecond=1072 ) properties (out of 16) seen :5254
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:30] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:54:30] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:54:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:30] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-13 22:54:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:54:30] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:30] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:30] [INFO ] Added : 36 causal constraints over 8 iterations in 105 ms. Result :sat
Minimization took 51 ms.
[2023-03-13 22:54:30] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:30] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:54:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:31] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 22:54:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:54:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-13 22:54:31] [INFO ] Added : 51 causal constraints over 11 iterations in 175 ms. Result :sat
Minimization took 67 ms.
[2023-03-13 22:54:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:31] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-13 22:54:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-13 22:54:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:54:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:54:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-13 22:54:31] [INFO ] Added : 48 causal constraints over 11 iterations in 181 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 22:54:31] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:31] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 22:54:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:32] [INFO ] Added : 49 causal constraints over 13 iterations in 148 ms. Result :sat
Minimization took 57 ms.
[2023-03-13 22:54:32] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:32] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-13 22:54:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 20 ms returned sat
[2023-03-13 22:54:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:54:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-13 22:54:32] [INFO ] Added : 37 causal constraints over 8 iterations in 134 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:54:32] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:32] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:32] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-13 22:54:32] [INFO ] [Nat]Added 16 Read/Feed constraints in 26 ms returned sat
[2023-03-13 22:54:32] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:54:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-13 22:54:32] [INFO ] Added : 44 causal constraints over 10 iterations in 154 ms. Result :sat
Minimization took 32 ms.
[2023-03-13 22:54:32] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:33] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:54:33] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:54:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-13 22:54:33] [INFO ] Added : 42 causal constraints over 9 iterations in 203 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:54:33] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:33] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:33] [INFO ] Added : 50 causal constraints over 11 iterations in 142 ms. Result :sat
Minimization took 51 ms.
[2023-03-13 22:54:33] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:33] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-13 22:54:33] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:33] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:54:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-13 22:54:34] [INFO ] Added : 40 causal constraints over 9 iterations in 204 ms. Result :sat
Minimization took 44 ms.
[2023-03-13 22:54:34] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:34] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:34] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:54:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:54:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-13 22:54:34] [INFO ] Added : 57 causal constraints over 14 iterations in 247 ms. Result :sat
Minimization took 60 ms.
[2023-03-13 22:54:34] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:54:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:34] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:54:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2023-03-13 22:54:35] [INFO ] Added : 49 causal constraints over 11 iterations in 241 ms. Result :sat
Minimization took 52 ms.
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 11 ms returned sat
[2023-03-13 22:54:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-13 22:54:35] [INFO ] Added : 43 causal constraints over 10 iterations in 160 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:55] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-13 22:54:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 22:54:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:54:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:54:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:55:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 5 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:55:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:07] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:55:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:17] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:55:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-13 22:55:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-13 22:55:20] [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 12
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)
[2023-03-13 22:55:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:20] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 22:55:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 31 ms returned sat
[2023-03-13 22:55:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:55:20] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-13 22:55:20] [INFO ] Added : 52 causal constraints over 12 iterations in 175 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:55:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:55:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:55:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:55:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-13 22:55:21] [INFO ] Added : 43 causal constraints over 11 iterations in 168 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:55:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:55:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:55:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:55:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:55:21] [INFO ] Added : 44 causal constraints over 12 iterations in 144 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[1000, 998, 1001, 1001, 1000, 1001, 1001, 1000, 999, 1000, 998, 1000, 1002, 1001, 1001, 1001]
FORMULA JoinFreeModules-PT-1000-UpperBounds-05 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 11 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2023-03-13 22:55:25] [INFO ] Computed 15 place invariants in 0 ms
Incomplete random walk after 1000178 steps, including 2 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 15) seen :14817
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 15) seen :5323
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 15) seen :5011
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 15) seen :5028
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 15) seen :5297
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 912 ms. (steps per millisecond=1096 ) properties (out of 15) seen :4404
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 15) seen :5265
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 15) seen :4363
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties (out of 15) seen :5021
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 15) seen :4332
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 15) seen :5012
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 15) seen :4349
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 933 ms. (steps per millisecond=1071 ) properties (out of 15) seen :4467
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 15) seen :5303
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 889 ms. (steps per millisecond=1124 ) properties (out of 15) seen :5325
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 15) seen :5276
// Phase 1: matrix 120 rows 75 cols
[2023-03-13 22:55:39] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-13 22:55:39] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:39] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-13 22:55:39] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-13 22:55:39] [INFO ] [Nat]Added 15 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:55:39] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:55:39] [INFO ] Added : 35 causal constraints over 8 iterations in 96 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 22:55:39] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:39] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:55:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:39] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-13 22:55:39] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:39] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:55:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-13 22:55:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-13 22:55:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2023-03-13 22:55:40] [INFO ] Added : 30 causal constraints over 6 iterations in 129 ms. Result :sat
Minimization took 53 ms.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:55:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:40] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:55:40] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:55:40] [INFO ] Added : 21 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 29 ms.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:40] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Nat]Added 15 Read/Feed constraints in 20 ms returned sat
[2023-03-13 22:55:40] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:55:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-13 22:55:40] [INFO ] Added : 29 causal constraints over 6 iterations in 95 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:55:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:40] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:55:40] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:55:40] [INFO ] Added : 31 causal constraints over 8 iterations in 75 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:55:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:41] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:41] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:55:41] [INFO ] Added : 24 causal constraints over 6 iterations in 56 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:55:41] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:55:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:41] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Nat]Added 15 Read/Feed constraints in 20 ms returned sat
[2023-03-13 22:55:41] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:55:41] [INFO ] Added : 31 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 22:55:41] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:41] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:55:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:41] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:55:41] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:55:41] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-13 22:55:41] [INFO ] Added : 31 causal constraints over 8 iterations in 119 ms. Result :sat
Minimization took 26 ms.
[2023-03-13 22:55:41] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:41] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 22:55:41] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:41] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:55:41] [INFO ] Added : 35 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 46 ms.
[2023-03-13 22:55:42] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:55:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:42] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:42] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:55:42] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2023-03-13 22:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:55:42] [INFO ] Added : 27 causal constraints over 6 iterations in 97 ms. Result :sat
Minimization took 28 ms.
[2023-03-13 22:55:42] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:42] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:55:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:42] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:42] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:55:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 22:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-13 22:55:42] [INFO ] Added : 31 causal constraints over 8 iterations in 128 ms. Result :sat
Minimization took 44 ms.
[2023-03-13 22:55:42] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:42] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:55:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:42] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:42] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:42] [INFO ] Added : 41 causal constraints over 9 iterations in 121 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 22:55:42] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:43] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:55:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:43] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:55:43] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:55:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-13 22:55:43] [INFO ] Added : 44 causal constraints over 9 iterations in 156 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 22:55:43] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:43] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Nat]Added 15 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:55:43] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:43] [INFO ] Added : 30 causal constraints over 7 iterations in 87 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 22:55:43] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:43] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:55:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:43] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-13 22:55:43] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:43] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:43] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2023-03-13 22:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-13 22:55:43] [INFO ] Added : 26 causal constraints over 7 iterations in 117 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[1002, 999, 1001, 1001, 1000, 1001, 1000, 1001, 1000, 998, 1000, 1002, 1001, 1001, 1001]
FORMULA JoinFreeModules-PT-1000-UpperBounds-14 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-03 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 65 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 3 ms. Remains 65 /75 variables (removed 10) and now considering 104/120 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/75 places, 104/120 transitions.
// Phase 1: matrix 104 rows 65 cols
[2023-03-13 22:55:46] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 1000040 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 13) seen :12782
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 13) seen :5316
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 13) seen :5056
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 13) seen :5134
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 13) seen :4387
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 13) seen :5258
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 13) seen :4337
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 795 ms. (steps per millisecond=1257 ) properties (out of 13) seen :5084
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 13) seen :4369
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 13) seen :5096
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 13) seen :4337
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 13) seen :4495
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 13) seen :5294
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 13) seen :5298
// Phase 1: matrix 104 rows 65 cols
[2023-03-13 22:55:57] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-13 22:55:57] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:57] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-13 22:55:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 22:55:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:55:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:55:57] [INFO ] Added : 32 causal constraints over 8 iterations in 96 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:55:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:57] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 22:55:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:55:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:55:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:55:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2023-03-13 22:55:57] [INFO ] Added : 34 causal constraints over 8 iterations in 169 ms. Result :sat
Minimization took 38 ms.
[2023-03-13 22:55:57] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:55:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:58] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-13 22:55:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-13 22:55:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:55:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:55:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-13 22:55:58] [INFO ] Added : 33 causal constraints over 9 iterations in 111 ms. Result :sat
Minimization took 21 ms.
[2023-03-13 22:55:58] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:55:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:58] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:55:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:58] [INFO ] Added : 39 causal constraints over 9 iterations in 97 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:55:58] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:55:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:58] [INFO ] Added : 34 causal constraints over 7 iterations in 155 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 22:55:58] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:55:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-13 22:55:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:55:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-13 22:55:59] [INFO ] Added : 25 causal constraints over 5 iterations in 351 ms. Result :sat
Minimization took 30 ms.
[2023-03-13 22:55:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:55:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:59] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-13 22:55:59] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:59] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:59] [INFO ] Added : 28 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 32 ms.
[2023-03-13 22:55:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:55:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:59] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-13 22:55:59] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:59] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:55:59] [INFO ] Added : 30 causal constraints over 8 iterations in 219 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:56:00] [INFO ] Added : 30 causal constraints over 6 iterations in 76 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:56:00] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:56:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:56:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-13 22:56:00] [INFO ] Added : 37 causal constraints over 8 iterations in 139 ms. Result :sat
Minimization took 29 ms.
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:56:00] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 22:56:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:00] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-13 22:56:00] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:00] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:56:00] [INFO ] Added : 18 causal constraints over 5 iterations in 81 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 22:56:01] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:56:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:01] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 22:56:01] [INFO ] [Nat]Added 13 Read/Feed constraints in 11 ms returned sat
[2023-03-13 22:56:01] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:56:01] [INFO ] Added : 44 causal constraints over 10 iterations in 117 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1002, 1003, 1003] Max seen :[1002, 999, 1001, 1000, 1001, 1000, 1001, 1000, 999, 1000, 1002, 1001, 1001]
FORMULA JoinFreeModules-PT-1000-UpperBounds-12 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-00 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 11 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 55 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 3 ms. Remains 55 /65 variables (removed 10) and now considering 88/104 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/65 places, 88/104 transitions.
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:03] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000362 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=1950 ) properties (out of 11) seen :10754
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 11) seen :5265
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 11) seen :5280
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 11) seen :4460
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 11) seen :5315
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 11) seen :4416
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 11) seen :5209
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 11) seen :4456
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 11) seen :5246
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 11) seen :4459
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 680 ms. (steps per millisecond=1470 ) properties (out of 11) seen :5311
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 11) seen :5307
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:11] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-13 22:56:11] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:11] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-13 22:56:11] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:11] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:11] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:56:11] [INFO ] Added : 35 causal constraints over 8 iterations in 168 ms. Result :sat
Minimization took 42 ms.
[2023-03-13 22:56:11] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:11] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:12] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:56:12] [INFO ] Added : 32 causal constraints over 7 iterations in 146 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 22:56:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:12] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:12] [INFO ] Added : 36 causal constraints over 9 iterations in 60 ms. Result :sat
Minimization took 32 ms.
[2023-03-13 22:56:12] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:12] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:56:12] [INFO ] Added : 35 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 26 ms.
[2023-03-13 22:56:12] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:56:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-13 22:56:12] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:12] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:56:12] [INFO ] Added : 25 causal constraints over 7 iterations in 51 ms. Result :sat
Minimization took 19 ms.
[2023-03-13 22:56:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:13] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:13] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:13] [INFO ] Added : 37 causal constraints over 8 iterations in 255 ms. Result :sat
Minimization took 28 ms.
[2023-03-13 22:56:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:13] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:13] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:56:13] [INFO ] Added : 27 causal constraints over 6 iterations in 151 ms. Result :sat
Minimization took 38 ms.
[2023-03-13 22:56:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:13] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:56:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:13] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-13 22:56:13] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:13] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:13] [INFO ] Added : 31 causal constraints over 9 iterations in 72 ms. Result :sat
Minimization took 47 ms.
[2023-03-13 22:56:14] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:14] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:14] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:14] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:56:14] [INFO ] Added : 28 causal constraints over 7 iterations in 90 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 22:56:14] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:14] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:14] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:56:14] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-13 22:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-13 22:56:14] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:56:14] [INFO ] Added : 28 causal constraints over 6 iterations in 72 ms. Result :sat
Minimization took 21 ms.
[2023-03-13 22:56:14] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:14] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:14] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:14] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:56:14] [INFO ] Added : 39 causal constraints over 9 iterations in 75 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[1001, 1001, 1000, 1001, 1000, 1001, 1000, 999, 1000, 1001, 1001]
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 8 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 88/88 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:16] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 22:56:16] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:16] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-13 22:56:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-13 22:56:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:16] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-13 22:56:16] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 88/88 transitions.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-01
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:16] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10768 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2153 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :129
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:16] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-13 22:56:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:16] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-13 22:56:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:16] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:16] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:16] [INFO ] Added : 32 causal constraints over 7 iterations in 170 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[500]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:17] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:17] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:17] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000182 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=12050 ) properties (out of 1) seen :998
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7936 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:17] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:56:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-03-13 22:56:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:56:17] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:17] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:17] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:17] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-13 22:56:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:17] [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-1000-UpperBounds-01 in 1391 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-02
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:17] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10517 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2103 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :129
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:17] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 22:56:17] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:17] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:17] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-13 22:56:17] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:17] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:17] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:56:17] [INFO ] Added : 34 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[500]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:18] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000304 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=11114 ) properties (out of 1) seen :999
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=7874 ) properties (out of 1) seen :998
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-13 22:56:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:56:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:18] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:56:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-13 22:56:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2023-03-13 22:56:18] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:56:18] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
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
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:18] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:18] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 22:56:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:18] [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.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-02 in 1129 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:18] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10248 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1281 ) properties (out of 1) seen :1000
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 :1000
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:18] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 22:56:18] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:56:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:18] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-13 22:56:18] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:18] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:18] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:56:18] [INFO ] Added : 36 causal constraints over 9 iterations in 62 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:18] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:18] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000038 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10869 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=7299 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:56:19] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:56:19] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
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
[2023-03-13 22:56:19] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:19] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:19] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:19] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 22:56:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:19] [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-1000-UpperBounds-04 in 625 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-06
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:19] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10935 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1215 ) properties (out of 1) seen :1001
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 :140
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:19] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 22:56:19] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:19] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-13 22:56:19] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:19] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:19] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:56:19] [INFO ] Added : 35 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:19] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000176 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11496 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=4524 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:56:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:56:20] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:20] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:20] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-13 22:56:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:20] [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-1000-UpperBounds-06 in 1009 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-07
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:20] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10434 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1739 ) properties (out of 1) seen :1000
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 :1000
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:20] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-13 22:56:20] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:20] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:56:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:20] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-13 22:56:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:56:20] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:20] [INFO ] Added : 25 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11363 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=4784 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:20] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:56:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:56:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:56:20] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
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
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:20] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:20] [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.
[2023-03-13 22:56:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:20] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:21] [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.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-07 in 709 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:21] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10036 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2007 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :129
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:21] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 22:56:21] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:21] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:56:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:21] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-13 22:56:21] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:21] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:21] [INFO ] Added : 45 causal constraints over 10 iterations in 158 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[500]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:21] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:21] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000163 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10418 ) properties (out of 1) seen :995
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=7518 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:56:22] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:56:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
Current structural bounds on expressions (after SMT) : [1002] Max seen :[1002]
FORMULA JoinFreeModules-PT-1000-UpperBounds-08 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08 in 1132 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-09
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:22] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10144 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2028 ) properties (out of 1) seen :1000
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 :1000
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:22] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-13 22:56:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:22] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:22] [INFO ] Added : 27 causal constraints over 6 iterations in 157 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:22] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000047 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11494 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7352 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:56:22] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:56:22] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:22] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:56:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:22] [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.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-09 in 756 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:22] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10617 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1516 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :129
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:22] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:23] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-13 22:56:23] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:23] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:56:23] [INFO ] Added : 24 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[129]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:23] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:23] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000135 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=11112 ) properties (out of 1) seen :995
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=7633 ) properties (out of 1) seen :999
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:23] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-13 22:56:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:23] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:23] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-13 22:56:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2023-03-13 22:56:23] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:56:23] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
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
[2023-03-13 22:56:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:23] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 22:56:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:23] [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-1000-UpperBounds-10 in 1025 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-11
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:23] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10185 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1131 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1000
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:23] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-13 22:56:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:23] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:56:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:24] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-13 22:56:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:24] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:56:24] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:56:24] [INFO ] Added : 28 causal constraints over 7 iterations in 99 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:24] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000270 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11497 ) properties (out of 1) seen :1000
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 :1000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:24] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:56:24] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:56:24] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
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
[2023-03-13 22:56:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:24] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:56:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:24] [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-1000-UpperBounds-11 in 678 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-13
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:24] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10063 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1677 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :140
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:24] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-13 22:56:24] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:56:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:24] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-13 22:56:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:24] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2023-03-13 22:56:24] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:56:24] [INFO ] Added : 33 causal constraints over 8 iterations in 62 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[140]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:25] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000036 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11364 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:25] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:25] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:56:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:56:25] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:56:25] [INFO ] Added : 6 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
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
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:25] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-13 22:56:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:25] [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.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-13 in 832 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:25] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10603 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1514 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :140
// Phase 1: matrix 88 rows 55 cols
[2023-03-13 22:56:25] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-13 22:56:25] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:25] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:56:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-13 22:56:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:25] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-13 22:56:25] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-13 22:56:25] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:56:25] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:56:25] [INFO ] Added : 41 causal constraints over 9 iterations in 99 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[140]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:25] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/55 places, 8/88 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:25] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000045 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=11364 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:56:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:26] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:56:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:56:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:56:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:56:26] [INFO ] Added : 6 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
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
[2023-03-13 22:56:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:26] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:56:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:56:26] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-13 22:56:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:56:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:56:26] [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-1000-UpperBounds-15 in 922 ms.
[2023-03-13 22:56:26] [INFO ] Flatten gal took : 31 ms
[2023-03-13 22:56:26] [INFO ] Applying decomposition
[2023-03-13 22:56:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12937676794528440672.txt' '-o' '/tmp/graph12937676794528440672.bin' '-w' '/tmp/graph12937676794528440672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12937676794528440672.bin' '-l' '-1' '-v' '-w' '/tmp/graph12937676794528440672.weights' '-q' '0' '-e' '0.001'
[2023-03-13 22:56:26] [INFO ] Decomposing Gal with order
[2023-03-13 22:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 22:56:26] [INFO ] Flatten gal took : 7 ms
[2023-03-13 22:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-13 22:56:26] [INFO ] Time to serialize gal into /tmp/UpperBounds14421539418255915420.gal : 16 ms
[2023-03-13 22:56:26] [INFO ] Time to serialize properties into /tmp/UpperBounds2500069327517246094.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/UpperBounds14421539418255915420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2500069327517246094.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/UpperBounds2500069327517246094.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,8.36514e+116,1136.34,7444792,13,7019,37,7.89631e+06,45,0,61,9.39558e+06,0
Total reachable state count : 8.365136205518829606158853330496726047287e+116

Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-01 :0 <= u10.p4694 <= 1002
FORMULA JoinFreeModules-PT-1000-UpperBounds-01 1002 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-1000-UpperBounds-01,0,1136.88,7444792,1,0,61,7.89631e+06,111,12,1076,9.39558e+06,123
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-02 :0 <= u7.p3439 <= 1002
FORMULA JoinFreeModules-PT-1000-UpperBounds-02 1002 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-1000-UpperBounds-02,0,1136.89,7444792,1,0,67,7.89631e+06,136,12,1076,9.39558e+06,133
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-04 :0 <= u1.p553 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-04 1000 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-1000-UpperBounds-04,0,1145.68,7444792,1,0,79,7.89631e+06,163,12,2084,9.39558e+06,155
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-06 :0 <= u8.p3867 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-06 1001 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-1000-UpperBounds-06,0,1163.88,7444792,1,0,84,7.89631e+06,185,12,3096,9.39558e+06,163
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-07 :0 <= u3.p1738 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-07 1000 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-1000-UpperBounds-07,0,1163.88,7444792,1,0,93,7.89631e+06,201,12,3096,9.39558e+06,180
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-09 :0 <= u6.p2743 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-09 1000 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-1000-UpperBounds-09,0,1163.88,7444792,1,0,99,7.89631e+06,220,12,3096,9.39558e+06,191
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-10 :0 <= u5.p2574 <= 1002
FORMULA JoinFreeModules-PT-1000-UpperBounds-10 1002 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-1000-UpperBounds-10,0,1163.88,7444792,1,0,106,7.89631e+06,238,12,3096,9.39558e+06,204
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-11 :0 <= u4.p2278 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-11 1000 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-1000-UpperBounds-11,0,1163.88,7444792,1,0,114,7.89631e+06,255,12,3096,9.39558e+06,219
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-13 :0 <= u0.p7 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-13 1001 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-1000-UpperBounds-13,0,1163.88,7444792,1,0,125,7.89631e+06,269,12,3096,9.39558e+06,240
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-15 :0 <= u9.p4397 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-15 1001 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-1000-UpperBounds-15,0,1163.88,7444792,1,0,128,7.89631e+06,291,12,3096,9.39558e+06,245
Total runtime 1482294 ms.

BK_STOP 1678749351145

--------------------
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-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is JoinFreeModules-PT-1000, 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 r255-tall-167856440300027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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