Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 31K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679453952931

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:59:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 02:59:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:59:14] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-22 02:59:14] [INFO ] Transformed 51 places.
[2023-03-22 02:59:14] [INFO ] Transformed 81 transitions.
[2023-03-22 02:59:14] [INFO ] Parsed PT model containing 51 places and 81 transitions and 232 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 81 rows 50 cols
[2023-03-22 02:59:14] [INFO ] Computed 10 place invariants in 6 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :171
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :103
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :106
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :88
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :103
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :95
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :109
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :97
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :111
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :106
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :97
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :108
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :109
[2023-03-22 02:59:14] [INFO ] Invariant cache hit.
[2023-03-22 02:59:15] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-22 02:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:15] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-22 02:59:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:15] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 02:59:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 02:59:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2023-03-22 02:59:15] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 02:59:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 3 ms to minimize.
[2023-03-22 02:59:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-22 02:59:15] [INFO ] Added : 38 causal constraints over 8 iterations in 325 ms. Result :sat
Minimization took 54 ms.
[2023-03-22 02:59:15] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 02:59:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:15] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 02:59:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:15] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 02:59:15] [INFO ] Added : 23 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 32 ms.
[2023-03-22 02:59:15] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-22 02:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 02:59:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 02:59:16] [INFO ] Added : 28 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 02:59:16] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 02:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-22 02:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-22 02:59:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-22 02:59:16] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 02:59:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-22 02:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 02:59:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-22 02:59:16] [INFO ] Added : 26 causal constraints over 6 iterations in 112 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 02:59:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:16] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 02:59:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 02:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 02:59:17] [INFO ] Added : 23 causal constraints over 6 iterations in 141 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-22 02:59:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-22 02:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 02:59:17] [INFO ] Added : 20 causal constraints over 5 iterations in 129 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:17] [INFO ] Added : 21 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 02:59:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:17] [INFO ] Added : 17 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 02:59:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:17] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 02:59:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 02:59:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 02:59:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:18] [INFO ] Added : 27 causal constraints over 6 iterations in 88 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 02:59:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:18] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:18] [INFO ] Added : 14 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 27 ms.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:18] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 02:59:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 02:59:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 02:59:18] [INFO ] Added : 18 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:18] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:18] [INFO ] Added : 27 causal constraints over 6 iterations in 91 ms. Result :sat
Minimization took 28 ms.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:19] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 02:59:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 02:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-22 02:59:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 02:59:19] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 26 ms.
[2023-03-22 02:59:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:19] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-22 02:59:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 02:59:19] [INFO ] Added : 17 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 32 ms.
[2023-03-22 02:59:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:19] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 02:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:19] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 02:59:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 02:59:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-22 02:59:19] [INFO ] Added : 22 causal constraints over 5 iterations in 135 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13] Max seen :[11, 11, 10, 11, 11, 10, 10, 11, 11, 10, 11, 11, 10, 11, 10, 12]
Support contains 16 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 81/81 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 80
Applied a total of 1 rules in 14 ms. Remains 50 /50 variables (removed 0) and now considering 80/81 (removed 1) transitions.
// Phase 1: matrix 80 rows 50 cols
[2023-03-22 02:59:19] [INFO ] Computed 10 place invariants in 5 ms
[2023-03-22 02:59:19] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 50/50 places, 80/81 transitions.
[2023-03-22 02:59:19] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2034 ms. (steps per millisecond=491 ) properties (out of 16) seen :182
FORMULA JoinFreeModules-PT-0010-UpperBounds-12 13 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 15) seen :153
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 15) seen :155
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties (out of 15) seen :142
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 15) seen :147
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 736 ms. (steps per millisecond=1358 ) properties (out of 15) seen :136
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 15) seen :145
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 15) seen :155
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 15) seen :137
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 15) seen :147
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=1386 ) properties (out of 15) seen :146
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 15) seen :152
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 15) seen :154
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 15) seen :149
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 15) seen :137
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 15) seen :154
[2023-03-22 02:59:33] [INFO ] Invariant cache hit.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 02:59:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 02:59:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:33] [INFO ] Added : 20 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 02:59:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 02:59:33] [INFO ] Added : 30 causal constraints over 6 iterations in 165 ms. Result :sat
Minimization took 27 ms.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-22 02:59:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-22 02:59:33] [INFO ] Added : 15 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 20 ms.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:33] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 02:59:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-22 02:59:33] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:33] [INFO ] Added : 21 causal constraints over 5 iterations in 52 ms. Result :sat
Minimization took 26 ms.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 02:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2023-03-22 02:59:34] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:34] [INFO ] Added : 20 causal constraints over 5 iterations in 41 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 02:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 20 ms returned sat
[2023-03-22 02:59:34] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 02:59:34] [INFO ] Added : 18 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 02:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 02:59:34] [INFO ] Added : 10 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-22 02:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:34] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:34] [INFO ] Added : 28 causal constraints over 7 iterations in 120 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:34] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:35] [INFO ] Added : 25 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 25 ms.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:35] [INFO ] Added : 22 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:35] [INFO ] Added : 9 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 18 ms returned sat
[2023-03-22 02:59:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 02:59:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-22 02:59:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:35] [INFO ] Added : 27 causal constraints over 6 iterations in 50 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:35] [INFO ] Added : 23 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:36] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 02:59:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2023-03-22 02:59:36] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:36] [INFO ] Added : 24 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 31 ms.
[2023-03-22 02:59:36] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 02:59:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:36] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 02:59:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:36] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:36] [INFO ] Added : 20 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13] Max seen :[12, 11, 10, 12, 12, 10, 10, 11, 11, 12, 11, 11, 12, 12, 12]
Support contains 15 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 45 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 5 ms. Remains 45 /50 variables (removed 5) and now considering 72/80 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 45/50 places, 72/80 transitions.
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 02:59:36] [INFO ] Computed 9 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1772 ms. (steps per millisecond=564 ) properties (out of 15) seen :169
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 15) seen :151
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 15) seen :156
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 15) seen :145
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 15) seen :149
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 15) seen :137
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 15) seen :145
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 15) seen :156
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 15) seen :139
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 15) seen :149
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 15) seen :142
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 15) seen :155
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 15) seen :156
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 15) seen :149
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 15) seen :141
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 15) seen :154
[2023-03-22 02:59:48] [INFO ] Invariant cache hit.
[2023-03-22 02:59:48] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:48] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 02:59:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 02:59:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 02:59:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 69 ms returned sat
[2023-03-22 02:59:49] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:49] [INFO ] Added : 12 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 02:59:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:49] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 02:59:49] [INFO ] Added : 20 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 17 ms.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 02:59:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-22 02:59:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 02:59:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-22 02:59:49] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:49] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-22 02:59:49] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:49] [INFO ] Added : 28 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 02:59:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:49] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 02:59:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:49] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:49] [INFO ] Added : 18 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 02:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:50] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 02:59:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-22 02:59:50] [INFO ] Added : 17 causal constraints over 5 iterations in 87 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 02:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 15 ms returned sat
[2023-03-22 02:59:50] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:50] [INFO ] Added : 20 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 19 ms.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:50] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:50] [INFO ] Added : 29 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 22 ms.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:50] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 02:59:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 02:59:50] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:50] [INFO ] Added : 23 causal constraints over 5 iterations in 87 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 02:59:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:51] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 02:59:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-22 02:59:51] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:51] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 02:59:51] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:51] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 02:59:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 15 ms returned sat
[2023-03-22 02:59:51] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 02:59:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2023-03-22 02:59:51] [INFO ] Added : 19 causal constraints over 4 iterations in 627 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 02:59:51] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-22 02:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:52] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 02:59:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-22 02:59:52] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 02:59:52] [INFO ] Added : 8 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 15 ms.
[2023-03-22 02:59:52] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 02:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 02:59:52] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 02:59:52] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 02:59:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-22 02:59:52] [INFO ] Added : 22 causal constraints over 6 iterations in 129 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 02:59:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 02:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-22 02:59:52] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 02:59:52] [INFO ] Added : 20 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 24 ms.
[2023-03-22 02:59:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 02:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:59:52] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-22 02:59:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 18 ms returned sat
[2023-03-22 02:59:52] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-22 02:59:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 02:59:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 02:59:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 02:59:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 02:59:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 5 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 02:59:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 5 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 4 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 02:59:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 02:59:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 76 ms
[2023-03-22 02:59:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 02:59:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 02:59:59] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 02:59:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 03:00:00] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 14 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:01] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-22 03:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 74 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 74 ms
[2023-03-22 03:00:02] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-03-22 03:00:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:05] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-03-22 03:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 03:00:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 03:00:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 77 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 12 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 03:00:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 4 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:12] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-03-22 03:00:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:15] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 03:00:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 4 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 74 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 79 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 84 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 03:00:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-22 03:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-22 03:00:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-22 03:00:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-22 03:00:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13] Max seen :[12, 11, 10, 12, 12, 10, 10, 11, 11, 12, 11, 11, 12, 12, 12]
Support contains 15 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 45/45 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-22 03:00:37] [INFO ] Invariant cache hit.
[2023-03-22 03:00:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 03:00:37] [INFO ] Invariant cache hit.
[2023-03-22 03:00:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:38] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-22 03:00:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 03:00:38] [INFO ] Invariant cache hit.
[2023-03-22 03:00:38] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 45/45 places, 72/72 transitions.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-00
[2023-03-22 03:00:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :9
[2023-03-22 03:00:38] [INFO ] Invariant cache hit.
[2023-03-22 03:00:38] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:38] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 03:00:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:38] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-22 03:00:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:38] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-22 03:00:38] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 03:00:38] [INFO ] Added : 24 causal constraints over 6 iterations in 88 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:38] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=6622 ) properties (out of 1) seen :9
[2023-03-22 03:00:38] [INFO ] Invariant cache hit.
[2023-03-22 03:00:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:38] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:00:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Current structural bounds on expressions (after SMT) : [12] Max seen :[12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-00 in 924 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-01
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:39] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :11
[2023-03-22 03:00:39] [INFO ] Invariant cache hit.
[2023-03-22 03:00:39] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 03:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:39] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-22 03:00:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:39] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-22 03:00:39] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 03:00:39] [INFO ] Added : 20 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 03:00:39] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=4784 ) properties (out of 1) seen :11
[2023-03-22 03:00:39] [INFO ] Invariant cache hit.
[2023-03-22 03:00:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:39] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:39] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 03:00:39] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:39] [INFO ] Invariant cache hit.
[2023-03-22 03:00:39] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-22 03:00:39] [INFO ] Invariant cache hit.
[2023-03-22 03:00:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 03:00:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:40] [INFO ] Invariant cache hit.
[2023-03-22 03:00:40] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-01 in 1033 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-02
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:40] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :10
[2023-03-22 03:00:40] [INFO ] Invariant cache hit.
[2023-03-22 03:00:40] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 03:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:40] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 03:00:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:40] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-22 03:00:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-22 03:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-22 03:00:40] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 03:00:40] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:40] [INFO ] Invariant cache hit.
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 1) seen :10
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 :10
[2023-03-22 03:00:40] [INFO ] Invariant cache hit.
[2023-03-22 03:00:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:40] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:40] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:40] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 03:00:40] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:40] [INFO ] Invariant cache hit.
[2023-03-22 03:00:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 03:00:40] [INFO ] Invariant cache hit.
[2023-03-22 03:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:41] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-22 03:00:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:41] [INFO ] Invariant cache hit.
[2023-03-22 03:00:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-02 in 994 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-03
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:41] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :9
[2023-03-22 03:00:41] [INFO ] Invariant cache hit.
[2023-03-22 03:00:41] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 03:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:41] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 03:00:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:41] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-22 03:00:41] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 03:00:41] [INFO ] Added : 20 causal constraints over 5 iterations in 141 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:41] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :9
[2023-03-22 03:00:41] [INFO ] Invariant cache hit.
[2023-03-22 03:00:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:41] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-22 03:00:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
Current structural bounds on expressions (after SMT) : [12] Max seen :[12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-03 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-03 in 977 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-04
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:42] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :11
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 :6
[2023-03-22 03:00:42] [INFO ] Invariant cache hit.
[2023-03-22 03:00:42] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-22 03:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:42] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 03:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:42] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 03:00:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:42] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:42] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 03:00:42] [INFO ] Added : 26 causal constraints over 6 iterations in 183 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=6172 ) properties (out of 1) seen :12
[2023-03-22 03:00:42] [INFO ] Invariant cache hit.
[2023-03-22 03:00:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:43] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 03:00:43] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 03:00:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
Current structural bounds on expressions (after SMT) : [12] Max seen :[12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-04 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-04 in 1026 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-05
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:43] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :10
[2023-03-22 03:00:43] [INFO ] Invariant cache hit.
[2023-03-22 03:00:43] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 03:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:43] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 03:00:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:43] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:43] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 03:00:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-22 03:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-22 03:00:43] [INFO ] Added : 17 causal constraints over 5 iterations in 86 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 03:00:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=2570 ) properties (out of 1) seen :10
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 :10
[2023-03-22 03:00:43] [INFO ] Invariant cache hit.
[2023-03-22 03:00:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 03:00:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:43] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 03:00:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 03:00:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 03:00:43] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:43] [INFO ] Invariant cache hit.
[2023-03-22 03:00:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 03:00:43] [INFO ] Invariant cache hit.
[2023-03-22 03:00:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-22 03:00:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:43] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-05 in 966 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-06
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:44] [INFO ] Computed 9 place invariants in 0 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :10
[2023-03-22 03:00:44] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:44] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 03:00:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:44] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-22 03:00:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:44] [INFO ] [Nat]Added 9 Read/Feed constraints in 15 ms returned sat
[2023-03-22 03:00:44] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 03:00:44] [INFO ] Added : 20 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:44] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=2487 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=6369 ) properties (out of 1) seen :10
[2023-03-22 03:00:44] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 03:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 03:00:44] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:44] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 03:00:44] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-22 03:00:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:44] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-06 in 909 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-07
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:44] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :11
[2023-03-22 03:00:44] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 03:00:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:45] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-22 03:00:45] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:45] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-22 03:00:45] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 03:00:45] [INFO ] Added : 29 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:45] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 03:00:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=6097 ) properties (out of 1) seen :11
[2023-03-22 03:00:45] [INFO ] Invariant cache hit.
[2023-03-22 03:00:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 03:00:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 03:00:45] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:45] [INFO ] Invariant cache hit.
[2023-03-22 03:00:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 03:00:45] [INFO ] Invariant cache hit.
[2023-03-22 03:00:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:45] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 03:00:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:45] [INFO ] Invariant cache hit.
[2023-03-22 03:00:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-07 in 1031 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-08
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:45] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :11
[2023-03-22 03:00:45] [INFO ] Invariant cache hit.
[2023-03-22 03:00:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:46] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 03:00:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:46] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 03:00:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:46] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 03:00:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-22 03:00:46] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 03:00:46] [INFO ] Added : 23 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 03:00:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=6250 ) properties (out of 1) seen :11
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
[2023-03-22 03:00:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 03:00:46] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
[2023-03-22 03:00:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
[2023-03-22 03:00:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:46] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 03:00:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
[2023-03-22 03:00:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-08 in 1033 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-09
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:46] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :9
[2023-03-22 03:00:47] [INFO ] Invariant cache hit.
[2023-03-22 03:00:47] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:47] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 03:00:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:47] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 03:00:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:47] [INFO ] [Nat]Added 9 Read/Feed constraints in 13 ms returned sat
[2023-03-22 03:00:47] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-22 03:00:47] [INFO ] Added : 33 causal constraints over 7 iterations in 118 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:47] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:47] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=6060 ) properties (out of 1) seen :12
[2023-03-22 03:00:47] [INFO ] Invariant cache hit.
[2023-03-22 03:00:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 03:00:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:47] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:47] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-22 03:00:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
Current structural bounds on expressions (after SMT) : [12] Max seen :[12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-09 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-09 in 979 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-10
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:47] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :11
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 :11
[2023-03-22 03:00:47] [INFO ] Invariant cache hit.
[2023-03-22 03:00:48] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:48] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 03:00:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:48] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-22 03:00:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:48] [INFO ] [Nat]Added 9 Read/Feed constraints in 15 ms returned sat
[2023-03-22 03:00:48] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 03:00:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 03:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 568 ms
[2023-03-22 03:00:48] [INFO ] Added : 19 causal constraints over 4 iterations in 615 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=2421 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=6134 ) properties (out of 1) seen :11
[2023-03-22 03:00:49] [INFO ] Invariant cache hit.
[2023-03-22 03:00:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 03:00:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 03:00:49] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:49] [INFO ] Invariant cache hit.
[2023-03-22 03:00:49] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 03:00:49] [INFO ] Invariant cache hit.
[2023-03-22 03:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:49] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-22 03:00:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:49] [INFO ] Invariant cache hit.
[2023-03-22 03:00:49] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-10 in 1544 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-11
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:49] [INFO ] Computed 9 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :11
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 :11
[2023-03-22 03:00:49] [INFO ] Invariant cache hit.
[2023-03-22 03:00:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 03:00:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:49] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-22 03:00:49] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-22 03:00:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-22 03:00:49] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-22 03:00:49] [INFO ] Added : 8 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 03:00:49] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=6172 ) properties (out of 1) seen :11
[2023-03-22 03:00:50] [INFO ] Invariant cache hit.
[2023-03-22 03:00:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:50] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:50] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 03:00:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 03:00:50] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-22 03:00:50] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-22 03:00:50] [INFO ] Invariant cache hit.
[2023-03-22 03:00:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 03:00:50] [INFO ] Invariant cache hit.
[2023-03-22 03:00:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:50] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 03:00:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 03:00:50] [INFO ] Invariant cache hit.
[2023-03-22 03:00:50] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-11 in 964 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-13
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:50] [INFO ] Computed 9 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :11
[2023-03-22 03:00:50] [INFO ] Invariant cache hit.
[2023-03-22 03:00:50] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 03:00:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:50] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 03:00:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:50] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2023-03-22 03:00:50] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 03:00:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-22 03:00:50] [INFO ] Added : 22 causal constraints over 6 iterations in 119 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[12]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:50] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 03:00:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:50] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=6250 ) properties (out of 1) seen :12
[2023-03-22 03:00:51] [INFO ] Invariant cache hit.
[2023-03-22 03:00:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:51] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-22 03:00:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
Current structural bounds on expressions (after SMT) : [12] Max seen :[12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-13 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-13 in 932 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-14
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:51] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :9
[2023-03-22 03:00:51] [INFO ] Invariant cache hit.
[2023-03-22 03:00:51] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-22 03:00:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:51] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 03:00:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 5 ms returned sat
[2023-03-22 03:00:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-22 03:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-22 03:00:51] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 03:00:51] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-22 03:00:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-22 03:00:51] [INFO ] Added : 25 causal constraints over 7 iterations in 121 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:51] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-22 03:00:51] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :12
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 :9
[2023-03-22 03:00:52] [INFO ] Invariant cache hit.
[2023-03-22 03:00:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:52] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 03:00:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 03:00:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Current structural bounds on expressions (after SMT) : [12] Max seen :[12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-14 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-14 in 1016 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-15
// Phase 1: matrix 72 rows 45 cols
[2023-03-22 03:00:52] [INFO ] Computed 9 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :9
[2023-03-22 03:00:52] [INFO ] Invariant cache hit.
[2023-03-22 03:00:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 03:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:52] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 03:00:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:52] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-22 03:00:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 03:00:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2023-03-22 03:00:52] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 03:00:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-22 03:00:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-22 03:00:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2023-03-22 03:00:52] [INFO ] Added : 24 causal constraints over 6 iterations in 132 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 5 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 7 ms. Remains 5 /45 variables (removed 40) and now considering 8/72 (removed 64) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 03:00:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 03:00:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 5/45 places, 8/72 transitions.
[2023-03-22 03:00:52] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 1) seen :12
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 :9
[2023-03-22 03:00:53] [INFO ] Invariant cache hit.
[2023-03-22 03:00:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 03:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:53] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-22 03:00:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 03:00:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 03:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 03:00:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 03:00:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 03:00:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 03:00:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-22 03:00:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Current structural bounds on expressions (after SMT) : [12] Max seen :[12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-15 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-15 in 980 ms.
[2023-03-22 03:00:53] [INFO ] Flatten gal took : 25 ms
[2023-03-22 03:00:53] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-22 03:00:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 45 places, 72 transitions and 189 arcs took 1 ms.
Total runtime 99126 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/5739/ub_0_ --maxsum=/tmp/5739/ub_1_ --maxsum=/tmp/5739/ub_2_ --maxsum=/tmp/5739/ub_3_ --maxsum=/tmp/5739/ub_4_ --maxsum=/tmp/5739/ub_5_ --maxsum=/tmp/5739/ub_6_ --maxsum=/tmp/5739/ub_7_
FORMULA JoinFreeModules-PT-0010-UpperBounds-01 11 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA JoinFreeModules-PT-0010-UpperBounds-02 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA JoinFreeModules-PT-0010-UpperBounds-05 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA JoinFreeModules-PT-0010-UpperBounds-06 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA JoinFreeModules-PT-0010-UpperBounds-07 11 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA JoinFreeModules-PT-0010-UpperBounds-08 11 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA JoinFreeModules-PT-0010-UpperBounds-10 11 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA JoinFreeModules-PT-0010-UpperBounds-11 11 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679454055245

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name JoinFreeModules-PT-0010-UpperBounds-01
ub formula formula --maxsum=/tmp/5739/ub_0_
ub formula name JoinFreeModules-PT-0010-UpperBounds-02
ub formula formula --maxsum=/tmp/5739/ub_1_
ub formula name JoinFreeModules-PT-0010-UpperBounds-05
ub formula formula --maxsum=/tmp/5739/ub_2_
ub formula name JoinFreeModules-PT-0010-UpperBounds-06
ub formula formula --maxsum=/tmp/5739/ub_3_
ub formula name JoinFreeModules-PT-0010-UpperBounds-07
ub formula formula --maxsum=/tmp/5739/ub_4_
ub formula name JoinFreeModules-PT-0010-UpperBounds-08
ub formula formula --maxsum=/tmp/5739/ub_5_
ub formula name JoinFreeModules-PT-0010-UpperBounds-10
ub formula formula --maxsum=/tmp/5739/ub_6_
ub formula name JoinFreeModules-PT-0010-UpperBounds-11
ub formula formula --maxsum=/tmp/5739/ub_7_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 45 places, 72 transitions and 189 arcs
pnml2lts-sym: Petri net JoinFreeModules_PT_0010 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 72->27 groups
pnml2lts-sym: Regrouping took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 45; there are 27 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 7940 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.390 real 1.520 user 0.040 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 7.60880711892099e+29 states, 2898 nodes
pnml2lts-sym: Maximum sum of /tmp/5739/ub_0_ is: 11
pnml2lts-sym: Maximum sum of /tmp/5739/ub_1_ is: 10
pnml2lts-sym: Maximum sum of /tmp/5739/ub_2_ is: 10
pnml2lts-sym: Maximum sum of /tmp/5739/ub_3_ is: 10
pnml2lts-sym: Maximum sum of /tmp/5739/ub_4_ is: 11
pnml2lts-sym: Maximum sum of /tmp/5739/ub_5_ is: 11
pnml2lts-sym: Maximum sum of /tmp/5739/ub_6_ is: 11
pnml2lts-sym: Maximum sum of /tmp/5739/ub_7_ is: 11
pnml2lts-sym: group_next: 16488 nodes total
pnml2lts-sym: group_explored: 5490 nodes, 24336 short vectors total
pnml2lts-sym: max token count: 13

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-0010, 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 r233-tall-167856418500165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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