MCC'2022- Execution of r132-tall-165271820600213

About the Execution of ITS-Tools for JoinFreeModules-PT-1000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
9277.920	1446888.00	1495395.00	3108.80	1002 1000 1002 1002 1003 1001 1003 1002 1002 1000 1002 1002 1000 1003 1003 1003	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 7.7K Apr 30 02:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 02:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 02:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.1M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-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 1652756447454

Running Version 202205111006
[2022-05-17 03:00:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 03:00:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 03:00:49] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2022-05-17 03:00:49] [INFO ] Transformed 5001 places.
[2022-05-17 03:00:49] [INFO ] Transformed 8001 transitions.
[2022-05-17 03:00:49] [INFO ] Parsed PT model containing 5001 places and 8001 transitions in 442 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:49] [INFO ] Computed 1000 place invariants in 70 ms
Incomplete random walk after 10016 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 16) seen :3509
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 16) seen :3009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=18 ) properties (out of 16) seen :3009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 16) seen :3009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 16) seen :3009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 16) seen :3009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 16) seen :3009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 16) seen :3009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 16) seen :3011
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 16) seen :3011
// Phase 1: matrix 8001 rows 5000 cols
[2022-05-17 03:00:57] [INFO ] Computed 1000 place invariants in 39 ms
[2022-05-17 03:00:58] [INFO ] [Real]Absence check using 1000 positive place invariants in 306 ms returned sat
[2022-05-17 03:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:02] [INFO ] [Real]Absence check using state equation in 3597 ms returned sat
[2022-05-17 03:01:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:01:03] [INFO ] [Nat]Absence check using 1000 positive place invariants in 275 ms returned sat
[2022-05-17 03:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:07] [INFO ] [Nat]Absence check using state equation in 4237 ms returned unknown
[2022-05-17 03:01:08] [INFO ] [Real]Absence check using 1000 positive place invariants in 271 ms returned sat
[2022-05-17 03:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:12] [INFO ] [Real]Absence check using state equation in 3510 ms returned sat
[2022-05-17 03:01:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:01:13] [INFO ] [Nat]Absence check using 1000 positive place invariants in 272 ms returned sat
[2022-05-17 03:01:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:17] [INFO ] [Nat]Absence check using state equation in 4270 ms returned unknown
[2022-05-17 03:01:18] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2022-05-17 03:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:21] [INFO ] [Real]Absence check using state equation in 3490 ms returned sat
[2022-05-17 03:01:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:01:22] [INFO ] [Nat]Absence check using 1000 positive place invariants in 265 ms returned sat
[2022-05-17 03:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:26] [INFO ] [Nat]Absence check using state equation in 4333 ms returned unknown
[2022-05-17 03:01:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 252 ms returned sat
[2022-05-17 03:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:31] [INFO ] [Real]Absence check using state equation in 3634 ms returned sat
[2022-05-17 03:01:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:01:32] [INFO ] [Nat]Absence check using 1000 positive place invariants in 268 ms returned sat
[2022-05-17 03:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:36] [INFO ] [Nat]Absence check using state equation in 4332 ms returned unknown
[2022-05-17 03:01:37] [INFO ] [Real]Absence check using 1000 positive place invariants in 257 ms returned sat
[2022-05-17 03:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:40] [INFO ] [Real]Absence check using state equation in 3515 ms returned sat
[2022-05-17 03:01:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:01:41] [INFO ] [Nat]Absence check using 1000 positive place invariants in 264 ms returned sat
[2022-05-17 03:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:45] [INFO ] [Nat]Absence check using state equation in 4338 ms returned unknown
[2022-05-17 03:01:46] [INFO ] [Real]Absence check using 1000 positive place invariants in 239 ms returned sat
[2022-05-17 03:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:50] [INFO ] [Real]Absence check using state equation in 3418 ms returned sat
[2022-05-17 03:01:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:01:50] [INFO ] [Nat]Absence check using 1000 positive place invariants in 264 ms returned sat
[2022-05-17 03:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:55] [INFO ] [Nat]Absence check using state equation in 4390 ms returned unknown
[2022-05-17 03:01:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 257 ms returned sat
[2022-05-17 03:01:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:01:59] [INFO ] [Real]Absence check using state equation in 3424 ms returned sat
[2022-05-17 03:01:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:02:00] [INFO ] [Nat]Absence check using 1000 positive place invariants in 276 ms returned sat
[2022-05-17 03:02:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:04] [INFO ] [Nat]Absence check using state equation in 4331 ms returned unknown
[2022-05-17 03:02:05] [INFO ] [Real]Absence check using 1000 positive place invariants in 255 ms returned sat
[2022-05-17 03:02:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:08] [INFO ] [Real]Absence check using state equation in 3333 ms returned sat
[2022-05-17 03:02:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:02:09] [INFO ] [Nat]Absence check using 1000 positive place invariants in 260 ms returned sat
[2022-05-17 03:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:13] [INFO ] [Nat]Absence check using state equation in 4364 ms returned unknown
[2022-05-17 03:02:14] [INFO ] [Real]Absence check using 1000 positive place invariants in 264 ms returned sat
[2022-05-17 03:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:18] [INFO ] [Real]Absence check using state equation in 3480 ms returned sat
[2022-05-17 03:02:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:02:19] [INFO ] [Nat]Absence check using 1000 positive place invariants in 254 ms returned sat
[2022-05-17 03:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:23] [INFO ] [Nat]Absence check using state equation in 4351 ms returned unknown
[2022-05-17 03:02:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 271 ms returned sat
[2022-05-17 03:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:27] [INFO ] [Real]Absence check using state equation in 3484 ms returned sat
[2022-05-17 03:02:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:02:28] [INFO ] [Nat]Absence check using 1000 positive place invariants in 271 ms returned sat
[2022-05-17 03:02:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:32] [INFO ] [Nat]Absence check using state equation in 4338 ms returned unknown
[2022-05-17 03:02:33] [INFO ] [Real]Absence check using 1000 positive place invariants in 252 ms returned sat
[2022-05-17 03:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:36] [INFO ] [Real]Absence check using state equation in 3465 ms returned sat
[2022-05-17 03:02:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:02:37] [INFO ] [Nat]Absence check using 1000 positive place invariants in 257 ms returned sat
[2022-05-17 03:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:42] [INFO ] [Nat]Absence check using state equation in 4367 ms returned unknown
[2022-05-17 03:02:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 254 ms returned sat
[2022-05-17 03:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:46] [INFO ] [Real]Absence check using state equation in 3472 ms returned sat
[2022-05-17 03:02:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:02:47] [INFO ] [Nat]Absence check using 1000 positive place invariants in 252 ms returned sat
[2022-05-17 03:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:51] [INFO ] [Nat]Absence check using state equation in 4370 ms returned unknown
[2022-05-17 03:02:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2022-05-17 03:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:02:55] [INFO ] [Real]Absence check using state equation in 3474 ms returned sat
[2022-05-17 03:02:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:02:56] [INFO ] [Nat]Absence check using 1000 positive place invariants in 253 ms returned sat
[2022-05-17 03:02:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:00] [INFO ] [Nat]Absence check using state equation in 4349 ms returned unknown
[2022-05-17 03:03:01] [INFO ] [Real]Absence check using 1000 positive place invariants in 253 ms returned sat
[2022-05-17 03:03:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:05] [INFO ] [Real]Absence check using state equation in 3526 ms returned sat
[2022-05-17 03:03:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:06] [INFO ] [Nat]Absence check using 1000 positive place invariants in 253 ms returned sat
[2022-05-17 03:03:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:10] [INFO ] [Nat]Absence check using state equation in 4374 ms returned unknown
[2022-05-17 03:03:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 251 ms returned sat
[2022-05-17 03:03:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:14] [INFO ] [Real]Absence check using state equation in 3523 ms returned sat
[2022-05-17 03:03:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:15] [INFO ] [Nat]Absence check using 1000 positive place invariants in 266 ms returned sat
[2022-05-17 03:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:19] [INFO ] [Nat]Absence check using state equation in 4353 ms returned unknown
[2022-05-17 03:03:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 273 ms returned sat
[2022-05-17 03:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:24] [INFO ] [Real]Absence check using state equation in 3609 ms returned sat
[2022-05-17 03:03:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:25] [INFO ] [Nat]Absence check using 1000 positive place invariants in 257 ms returned sat
[2022-05-17 03:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:29] [INFO ] [Nat]Absence check using state equation in 4356 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, 1000, 2, 2, 2, 3, 2, 2, 500, 1000, 2, 2, 1000, 2, 2, 2]
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.20 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 65 ms. Remains 80 /5000 variables (removed 4920) and now considering 128/8001 (removed 7873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 03:03:29] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-17 03:03:29] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/5000 places, 128/8001 transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 03:03:29] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 1000059 steps, including 2 resets, run finished after 1125 ms. (steps per millisecond=888 ) properties (out of 16) seen :15711
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1321 ms. (steps per millisecond=757 ) properties (out of 16) seen :3944
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1285 ms. (steps per millisecond=778 ) properties (out of 16) seen :3290
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1294 ms. (steps per millisecond=772 ) properties (out of 16) seen :3371
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1303 ms. (steps per millisecond=767 ) properties (out of 16) seen :3367
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1263 ms. (steps per millisecond=791 ) properties (out of 16) seen :4288
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties (out of 16) seen :4214
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1269 ms. (steps per millisecond=788 ) properties (out of 16) seen :4265
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 16) seen :3365
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1278 ms. (steps per millisecond=782 ) properties (out of 16) seen :3930
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1283 ms. (steps per millisecond=779 ) properties (out of 16) seen :3281
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1280 ms. (steps per millisecond=781 ) properties (out of 16) seen :3953
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1318 ms. (steps per millisecond=758 ) properties (out of 16) seen :3386
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1308 ms. (steps per millisecond=764 ) properties (out of 16) seen :3302
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1286 ms. (steps per millisecond=777 ) properties (out of 16) seen :4268
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 16) seen :4244
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1275 ms. (steps per millisecond=784 ) properties (out of 16) seen :4277
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 03:03:51] [INFO ] Computed 16 place invariants in 4 ms
[2022-05-17 03:03:51] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:03:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:51] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-17 03:03:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-17 03:03:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 10 ms returned sat
[2022-05-17 03:03:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2022-05-17 03:03:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-17 03:03:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:03:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
[2022-05-17 03:03:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-17 03:03:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:03:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 102 ms
[2022-05-17 03:03:51] [INFO ] Added : 54 causal constraints over 12 iterations in 239 ms. Result :sat
Minimization took 80 ms.
[2022-05-17 03:03:51] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:03:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:52] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 03:03:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2022-05-17 03:03:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-17 03:03:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-17 03:03:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-17 03:03:52] [INFO ] Added : 37 causal constraints over 8 iterations in 152 ms. Result :sat
Minimization took 35 ms.
[2022-05-17 03:03:52] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:52] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-17 03:03:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:52] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-05-17 03:03:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:03:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:03:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:03:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:03:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-05-17 03:03:52] [INFO ] Added : 55 causal constraints over 12 iterations in 301 ms. Result :sat
Minimization took 33 ms.
[2022-05-17 03:03:52] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 03:03:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:03:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:03:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-17 03:03:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:03:53] [INFO ] Added : 46 causal constraints over 10 iterations in 97 ms. Result :sat
Minimization took 52 ms.
[2022-05-17 03:03:53] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:03:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:53] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:03:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-17 03:03:53] [INFO ] Added : 32 causal constraints over 7 iterations in 79 ms. Result :sat
Minimization took 43 ms.
[2022-05-17 03:03:53] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-17 03:03:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:53] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:03:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:03:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:03:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-17 03:03:53] [INFO ] Added : 49 causal constraints over 10 iterations in 165 ms. Result :sat
Minimization took 46 ms.
[2022-05-17 03:03:53] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:53] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:03:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:54] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-17 03:03:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 25 ms returned sat
[2022-05-17 03:03:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:03:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:03:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-05-17 03:03:54] [INFO ] Added : 44 causal constraints over 10 iterations in 153 ms. Result :sat
Minimization took 33 ms.
[2022-05-17 03:03:54] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:54] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-17 03:03:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:54] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 03:03:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:03:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:03:54] [INFO ] Added : 54 causal constraints over 11 iterations in 137 ms. Result :sat
Minimization took 92 ms.
[2022-05-17 03:03:54] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 03:03:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:54] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-17 03:03:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:03:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:03:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-05-17 03:03:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:03:55] [INFO ] Added : 48 causal constraints over 11 iterations in 140 ms. Result :sat
Minimization took 111 ms.
[2022-05-17 03:03:55] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:55] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-17 03:03:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:55] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-17 03:03:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:03:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 03:03:55] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2022-05-17 03:03:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-17 03:03:55] [INFO ] Added : 44 causal constraints over 9 iterations in 173 ms. Result :sat
Minimization took 53 ms.
[2022-05-17 03:03:55] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-17 03:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:55] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 03:03:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:55] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-17 03:03:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:03:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:03:55] [INFO ] Added : 50 causal constraints over 12 iterations in 196 ms. Result :sat
Minimization took 106 ms.
[2022-05-17 03:03:56] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:03:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:56] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:03:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:03:56] [INFO ] Added : 35 causal constraints over 7 iterations in 99 ms. Result :sat
Minimization took 99 ms.
[2022-05-17 03:03:56] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:03:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:56] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:03:56] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:03:56] [INFO ] Added : 50 causal constraints over 11 iterations in 131 ms. Result :sat
Minimization took 49 ms.
[2022-05-17 03:03:56] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:03:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:57] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 03:03:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:03:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:03:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:03:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-17 03:03:57] [INFO ] Added : 43 causal constraints over 10 iterations in 156 ms. Result :sat
Minimization took 69 ms.
[2022-05-17 03:03:57] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:57] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:03:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:57] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-17 03:03:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:03:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:03:57] [INFO ] Added : 29 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 43 ms.
[2022-05-17 03:03:57] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:57] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:03:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:03:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:03:57] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-17 03:03:57] [INFO ] [Nat]Added 16 Read/Feed constraints in 28 ms returned sat
[2022-05-17 03:03:57] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:03:57] [INFO ] Added : 33 causal constraints over 9 iterations in 99 ms. Result :sat
Minimization took 44 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 :[960, 1000, 949, 978, 1001, 1001, 1001, 966, 947, 1000, 967, 938, 1000, 1000, 1002, 1002]
FORMULA JoinFreeModules-PT-1000-UpperBounds-15 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-06 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-04 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 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 65 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 3 ms. Remains 65 /80 variables (removed 15) and now considering 104/128 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/80 places, 104/128 transitions.
// Phase 1: matrix 104 rows 65 cols
[2022-05-17 03:04:02] [INFO ] Computed 13 place invariants in 2 ms
Incomplete random walk after 1000047 steps, including 2 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties (out of 13) seen :12597
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 13) seen :4015
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 13) seen :3277
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 13) seen :3374
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 13) seen :3387
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 13) seen :4177
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1100 ms. (steps per millisecond=909 ) properties (out of 13) seen :3381
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 13) seen :4058
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 13) seen :3257
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 13) seen :3944
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 13) seen :3387
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 13) seen :3240
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 13) seen :4237
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 13) seen :4262
// Phase 1: matrix 104 rows 65 cols
[2022-05-17 03:04:17] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-17 03:04:17] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:04:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-17 03:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:17] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-17 03:04:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-17 03:04:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 12 ms returned sat
[2022-05-17 03:04:17] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-17 03:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-17 03:04:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:04:17] [INFO ] Added : 35 causal constraints over 7 iterations in 98 ms. Result :sat
Minimization took 44 ms.
[2022-05-17 03:04:17] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:04:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-17 03:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:17] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-17 03:04:17] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:17] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:04:17] [INFO ] Added : 39 causal constraints over 9 iterations in 91 ms. Result :sat
Minimization took 49 ms.
[2022-05-17 03:04:17] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:17] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:04:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 03:04:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:04:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 03:04:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-17 03:04:18] [INFO ] Added : 33 causal constraints over 8 iterations in 137 ms. Result :sat
Minimization took 26 ms.
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:04:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-17 03:04:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 03:04:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:18] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-17 03:04:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-17 03:04:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-17 03:04:18] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:04:19] [INFO ] Added : 18 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 30 ms.
[2022-05-17 03:04:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:04:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:19] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:04:19] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:04:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-17 03:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-17 03:04:19] [INFO ] Added : 25 causal constraints over 5 iterations in 356 ms. Result :sat
Minimization took 29 ms.
[2022-05-17 03:04:19] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 03:04:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:19] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2022-05-17 03:04:19] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:04:19] [INFO ] Added : 31 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 39 ms.
[2022-05-17 03:04:19] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:04:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:19] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 03:04:19] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:20] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 03:04:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:20] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-17 03:04:20] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:04:20] [INFO ] Added : 36 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 26 ms.
[2022-05-17 03:04:20] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:20] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:04:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:20] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 23 ms returned sat
[2022-05-17 03:04:20] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:04:20] [INFO ] Added : 40 causal constraints over 8 iterations in 123 ms. Result :sat
Minimization took 29 ms.
[2022-05-17 03:04:20] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:04:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:20] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-17 03:04:20] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2022-05-17 03:04:20] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:04:20] [INFO ] Added : 29 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1002, 1002, 1003, 1002, 1003, 1003, 1003, 1002, 1003, 1003, 1003] Max seen :[1000, 1000, 1002, 1002, 1001, 1002, 998, 1000, 999, 1002, 1000, 1002, 1002]
FORMULA JoinFreeModules-PT-1000-UpperBounds-11 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-07 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-03 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-1000-UpperBounds-02 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 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 45 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 2 ms. Remains 45 /65 variables (removed 20) and now considering 72/104 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 45/65 places, 72/104 transitions.
// Phase 1: matrix 72 rows 45 cols
[2022-05-17 03:04:22] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 1000170 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties (out of 9) seen :8869
FORMULA JoinFreeModules-PT-1000-UpperBounds-13 1003 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 8) seen :4201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 8) seen :3267
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 712 ms. (steps per millisecond=1404 ) properties (out of 8) seen :4094
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 8) seen :4196
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 8) seen :3254
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 8) seen :4207
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 8) seen :3233
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 8) seen :4209
// Phase 1: matrix 72 rows 45 cols
[2022-05-17 03:04:29] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 03:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-17 03:04:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-17 03:04:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:04:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:04:29] [INFO ] Added : 18 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 03:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:04:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-17 03:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-17 03:04:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 03:04:29] [INFO ] Added : 16 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 24 ms.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 03:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:04:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 03:04:29] [INFO ] Added : 17 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 03:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 03:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:04:29] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:04:29] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 18 ms.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 03:04:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:29] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-17 03:04:29] [INFO ] [Nat]Added 9 Read/Feed constraints in 8 ms returned sat
[2022-05-17 03:04:30] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:04:30] [INFO ] Added : 23 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 03:04:30] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-17 03:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 03:04:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:30] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-17 03:04:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:04:30] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:04:30] [INFO ] Added : 20 causal constraints over 6 iterations in 41 ms. Result :sat
Minimization took 18 ms.
[2022-05-17 03:04:30] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-17 03:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 03:04:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:30] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-17 03:04:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:04:30] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:04:30] [INFO ] Added : 17 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1002, 1003, 1003, 1003, 1003] Max seen :[1001, 1000, 1001, 1002, 1000, 1001, 1000, 1002]
FORMULA JoinFreeModules-PT-1000-UpperBounds-08 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 45 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 35 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 1 ms. Remains 35 /45 variables (removed 10) and now considering 56/72 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/45 places, 56/72 transitions.
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:04:31] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000081 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=1992 ) properties (out of 7) seen :6989
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 7) seen :4327
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 7) seen :3353
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 7) seen :4072
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 7) seen :3386
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 7) seen :4279
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=1683 ) properties (out of 7) seen :3358
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=1683 ) properties (out of 7) seen :4327
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:04:36] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 03:04:36] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:36] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 03:04:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:04:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:04:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:04:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-17 03:04:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:04:36] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2022-05-17 03:04:36] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 4 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 4 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:37] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:04:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:04:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:40] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:04:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 3 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:04:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2022-05-17 03:04:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:04:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:54] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:04:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:57] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:04:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:04:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:05:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:05:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
[2022-05-17 03:05:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:05:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 03:05:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:05:21] [INFO ] Added : 17 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 33 ms.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 03:05:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:05:21] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:21] [INFO ] Added : 19 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 03:05:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:05:21] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:21] [INFO ] Added : 27 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 03:05:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 03:05:21] [INFO ] Added : 26 causal constraints over 7 iterations in 89 ms. Result :sat
Minimization took 20 ms.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 03:05:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:22] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 03:05:22] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2022-05-17 03:05:22] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:05:22] [INFO ] Added : 21 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 03:05:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:22] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 03:05:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:22] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-17 03:05:22] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:05:22] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:22] [INFO ] Added : 22 causal constraints over 6 iterations in 79 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[1002, 1000, 1001, 1000, 1001, 1000, 1002]
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:22] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:22] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:23] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-17 03:05:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:23] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 56/56 transitions.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-00
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:23] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10130 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2026 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :186
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:23] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-17 03:05:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:23] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-17 03:05:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:23] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:05:23] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:23] [INFO ] Added : 16 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[186]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:25] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000403 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8932 ) properties (out of 1) seen :990
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :999
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:05:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 03:05:26] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 7 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
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:26] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-17 03:05:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:26] [INFO ] Dead Transitions using invariants and state equation in 17 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-00 in 3230 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-01
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:26] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10736 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1073 ) properties (out of 1) seen :1000
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 :1000
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:26] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 03:05:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:05:26] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:26] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:05:26] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:26] [INFO ] Added : 17 causal constraints over 5 iterations in 75 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000039 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=9259 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:05:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 03:05:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 03:05:26] [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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:26] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:26] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2022-05-17 03:05:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:26] [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-01 in 634 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-05
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:26] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10113 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1444 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :210
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:26] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 03:05:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:27] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-17 03:05:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:27] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:05:27] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:27] [INFO ] Added : 19 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000299 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=9262 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=4237 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-17 03:05:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 03:05:27] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 03:05:27] [INFO ] Added : 6 causal constraints over 3 iterations in 7 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
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:27] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:27] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-17 03:05:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:27] [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-05 in 764 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-09
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:27] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10060 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1257 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1000
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:27] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:27] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 03:05:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:27] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:05:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:27] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:05:27] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:27] [INFO ] Added : 27 causal constraints over 6 iterations in 56 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-17 03:05:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:27] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000014 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=9009 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=4608 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 03:05:28] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 03:05:28] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 19 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
[2022-05-17 03:05:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:28] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:28] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2022-05-17 03:05:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:28] [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-09 in 692 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:28] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10104 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1684 ) properties (out of 1) seen :501
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 :186
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:28] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:28] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 03:05:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:28] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-17 03:05:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:28] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:05:28] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:28] [INFO ] Added : 23 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[501]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:29] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000074 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=8772 ) properties (out of 1) seen :994
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:05:29] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:05:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-17 03:05:29] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 03:05:29] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 7 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
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:29] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:29] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-17 03:05:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:29] [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 1065 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-12
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:29] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10643 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1182 ) properties (out of 1) seen :1000
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 :1000
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 03:05:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-17 03:05:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:29] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-05-17 03:05:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:29] [INFO ] [Nat]Added 7 Read/Feed constraints in 8 ms returned sat
[2022-05-17 03:05:29] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:29] [INFO ] Added : 21 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:29] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000145 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9175 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:05:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:30] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:05:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:30] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:05:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-05-17 03:05:30] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 03:05:30] [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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:30] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-17 03:05:30] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:05:30] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-17 03:05:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-12 in 657 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-14
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:30] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10111 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1123 ) 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 :322
// Phase 1: matrix 56 rows 35 cols
[2022-05-17 03:05:30] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 03:05:30] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-17 03:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 03:05:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:05:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-17 03:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:05:30] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-17 03:05:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-17 03:05:30] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:05:30] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:05:30] [INFO ] Added : 20 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[322]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:05:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:05:30] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000030 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9174 ) properties (out of 1) seen :1003
FORMULA JoinFreeModules-PT-1000-UpperBounds-14 1003 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-14 in 635 ms.
[2022-05-17 03:05:30] [INFO ] Flatten gal took : 26 ms
[2022-05-17 03:05:30] [INFO ] Applying decomposition
[2022-05-17 03:05:30] [INFO ] Flatten gal took : 6 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/graph5471278238330759111.txt' '-o' '/tmp/graph5471278238330759111.bin' '-w' '/tmp/graph5471278238330759111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5471278238330759111.bin' '-l' '-1' '-v' '-w' '/tmp/graph5471278238330759111.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:05:31] [INFO ] Decomposing Gal with order
[2022-05-17 03:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:05:31] [INFO ] Flatten gal took : 5 ms
[2022-05-17 03:05:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 03:05:31] [INFO ] Time to serialize gal into /tmp/UpperBounds8067187318267209324.gal : 1 ms
[2022-05-17 03:05:31] [INFO ] Time to serialize properties into /tmp/UpperBounds1613899103040820641.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/UpperBounds8067187318267209324.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1613899103040820641.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds1613899103040820641.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,2.5422e+74,1135.08,7444516,9,7019,25,7.89631e+06,34,0,57,9.39558e+06,0
Total reachable state count : 2.542202266489343124202129536958613944466e+74

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-00 :0 <= u5.p4729 <= 1002
FORMULA JoinFreeModules-PT-1000-UpperBounds-00 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-00,0,1135.62,7444516,1,0,42,7.89631e+06,76,8,1072,9.39558e+06,65
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-01 :0 <= u0.p423 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-01 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-01,0,1144.29,7444516,1,0,51,7.89631e+06,96,8,2080,9.39558e+06,80
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-05 :0 <= u3.p3472 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-05 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-05,0,1162.76,7444516,1,0,57,7.89631e+06,109,8,3092,9.39558e+06,90
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-09 :0 <= u2.p2478 <= 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,1162.76,7444516,1,0,63,7.89631e+06,120,8,3092,9.39558e+06,101
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-10 :0 <= u4.p3999 <= 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,1162.76,7444516,1,0,67,7.89631e+06,133,8,3092,9.39558e+06,108
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-12 :0 <= u1.p1858 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-12 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-12,0,1162.76,7444516,1,0,74,7.89631e+06,143,8,3092,9.39558e+06,121
Total runtime 1445701 ms.

BK_STOP 1652757894342

--------------------
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-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 r132-tall-165271820600213"
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 ;