Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 535K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1652803841745

Running Version 202205111006
[2022-05-17 16:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-17 16:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:10:43] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2022-05-17 16:10:43] [INFO ] Transformed 834 places.
[2022-05-17 16:10:43] [INFO ] Transformed 1242 transitions.
[2022-05-17 16:10:43] [INFO ] Found NUPN structural information;
[2022-05-17 16:10:43] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 16:10:43] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 232 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 905 ms. (steps per millisecond=11 ) properties (out of 834) seen :285
Running SMT prover for 549 properties.
[2022-05-17 16:10:44] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 16:10:44] [INFO ] Computed 23 place invariants in 30 ms
[2022-05-17 16:10:55] [INFO ] After 10693ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:549
[2022-05-17 16:11:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2022-05-17 16:11:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 16:11:20] [INFO ] After 11233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :549
[2022-05-17 16:11:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:11:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:11:20] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:549
Fused 549 Parikh solutions to 316 different solutions.
Parikh walk visited 3 properties in 3049 ms.
Support contains 546 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 834 transition count 1178
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 770 transition count 1178
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 128 place count 770 transition count 1108
Deduced a syphon composed of 70 places in 4 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 268 place count 700 transition count 1108
Applied a total of 268 rules in 104 ms. Remains 700 /834 variables (removed 134) and now considering 1108/1242 (removed 134) transitions.
Finished structural reductions, in 1 iterations. Remains : 700/834 places, 1108/1242 transitions.
Interrupted random walk after 507501 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 527) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 527) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 523) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 516) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 507) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 507) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 507) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 507) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 507) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 503) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 495) seen :0
Running SMT prover for 495 properties.
[2022-05-17 16:11:54] [INFO ] Flow matrix only has 988 transitions (discarded 120 similar events)
// Phase 1: matrix 988 rows 700 cols
[2022-05-17 16:11:54] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 16:12:02] [INFO ] After 7672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:495
[2022-05-17 16:12:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2022-05-17 16:12:07] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 16:12:26] [INFO ] After 14813ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :495
[2022-05-17 16:12:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:12:45] [INFO ] After 18839ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :495
[2022-05-17 16:12:45] [INFO ] Deduced a trap composed of 110 places in 258 ms of which 6 ms to minimize.
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 2 ms to minimize.
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 2 ms to minimize.
[2022-05-17 16:12:46] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 2 ms to minimize.
[2022-05-17 16:12:47] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 0 ms to minimize.
[2022-05-17 16:12:47] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 1 ms to minimize.
[2022-05-17 16:12:47] [INFO ] Deduced a trap composed of 22 places in 224 ms of which 1 ms to minimize.
[2022-05-17 16:12:47] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 1 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 0 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:12:48] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 92 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 208 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:12:49] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:12:50] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:12:51] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:12:51] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:12:51] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:12:51] [INFO ] Deduced a trap composed of 157 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:12:51] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:12:52] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:12:52] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:12:52] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:12:52] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:12:53] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:12:53] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:12:53] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 7784 ms
[2022-05-17 16:12:53] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2022-05-17 16:12:54] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2022-05-17 16:12:54] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:12:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2022-05-17 16:12:54] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:12:54] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:12:54] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:12:55] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:12:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2417 ms
[2022-05-17 16:12:56] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 3 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 797 ms
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:12:57] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:12:58] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:12:58] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:12:58] [INFO ] Deduced a trap composed of 60 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:12:58] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:12:59] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:12:59] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:12:59] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:12:59] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:12:59] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2022-05-17 16:13:00] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:13:00] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:13:00] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2022-05-17 16:13:00] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:13:00] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:13:00] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:13:01] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:13:01] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:13:01] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:13:01] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:13:01] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:13:01] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4411 ms
[2022-05-17 16:13:02] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:13:02] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:13:02] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:13:02] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:13:03] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:13:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1098 ms
[2022-05-17 16:13:03] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:13:03] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:13:03] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:13:03] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:13:03] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:13:04] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:13:04] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:13:04] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:13:04] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:13:05] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:13:05] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:13:05] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:13:05] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:13:05] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:13:05] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:13:06] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:13:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2906 ms
[2022-05-17 16:13:06] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 0 ms to minimize.
[2022-05-17 16:13:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:13:06] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:13:06] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:13:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2022-05-17 16:13:07] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:13:07] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:13:07] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:13:07] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:13:07] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:13:08] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:13:08] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 1 ms to minimize.
[2022-05-17 16:13:08] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 0 ms to minimize.
[2022-05-17 16:13:08] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:13:08] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1954 ms
[2022-05-17 16:13:09] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:13:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2022-05-17 16:13:09] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:13:09] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:13:09] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:13:10] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:13:10] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:13:10] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:13:10] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:13:10] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:13:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1713 ms
[2022-05-17 16:13:11] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:13:11] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:13:11] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:13:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 581 ms
[2022-05-17 16:13:11] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:13:12] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:13:12] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:13:12] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:13:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 951 ms
[2022-05-17 16:13:13] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2022-05-17 16:13:13] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:13:13] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:13:13] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:13:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 714 ms
[2022-05-17 16:13:14] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:13:14] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:13:14] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:13:14] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:13:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 748 ms
[2022-05-17 16:13:15] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:13:15] [INFO ] Deduced a trap composed of 63 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:13:15] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:13:15] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:13:15] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:13:16] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:13:16] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:13:16] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:13:16] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:13:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1839 ms
[2022-05-17 16:13:17] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:13:17] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:13:17] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:13:17] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:13:17] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:13:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 885 ms
[2022-05-17 16:13:17] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:13:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:13:19] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2022-05-17 16:13:19] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:13:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2022-05-17 16:13:19] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:13:20] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:13:20] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:13:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 729 ms
[2022-05-17 16:13:20] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:13:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-05-17 16:13:20] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:13:21] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:13:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2022-05-17 16:13:21] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:13:21] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:13:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 435 ms
[2022-05-17 16:13:21] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:13:22] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:13:22] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:13:22] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:13:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 694 ms
[2022-05-17 16:13:22] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:13:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2022-05-17 16:13:23] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:13:23] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:13:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 449 ms
[2022-05-17 16:13:23] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2022-05-17 16:13:24] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:13:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2022-05-17 16:13:25] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:13:25] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:13:25] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:13:25] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:13:25] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:13:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 961 ms
[2022-05-17 16:13:26] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:13:26] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:13:26] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:13:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 621 ms
[2022-05-17 16:13:27] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:13:27] [INFO ] Deduced a trap composed of 120 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:13:27] [INFO ] Deduced a trap composed of 120 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:13:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 692 ms
[2022-05-17 16:13:27] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2022-05-17 16:13:28] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:13:29] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-17 16:13:30] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 0 ms to minimize.
[2022-05-17 16:13:30] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:13:30] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:13:31] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:13:31] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:13:31] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:13:31] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:13:32] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:13:32] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:13:32] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:13:32] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:13:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2485 ms
[2022-05-17 16:13:33] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2022-05-17 16:13:33] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2022-05-17 16:13:34] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:13:34] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:13:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2022-05-17 16:13:35] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:13:36] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:13:36] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:13:36] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:13:36] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:13:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1498 ms
[2022-05-17 16:13:37] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2022-05-17 16:13:38] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:13:38] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:13:38] [INFO ] Deduced a trap composed of 69 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:13:39] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:13:39] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:13:39] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:13:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1341 ms
[2022-05-17 16:13:39] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:13:40] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:13:40] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:13:40] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:13:40] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:13:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 948 ms
[2022-05-17 16:13:41] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:13:41] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:13:42] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:13:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 516 ms
[2022-05-17 16:13:42] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:13:43] [INFO ] Deduced a trap composed of 160 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:13:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2022-05-17 16:13:43] [INFO ] Deduced a trap composed of 203 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:13:43] [INFO ] Deduced a trap composed of 113 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:13:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2022-05-17 16:13:43] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2022-05-17 16:13:45] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:13:45] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:13:45] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:13:45] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:13:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 620 ms
[2022-05-17 16:13:45] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:13:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2022-05-17 16:13:46] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:13:46] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:13:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2022-05-17 16:13:48] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 2 ms to minimize.
[2022-05-17 16:13:48] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:13:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 440 ms
[2022-05-17 16:13:49] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:13:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2022-05-17 16:13:50] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2022-05-17 16:13:50] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2022-05-17 16:13:51] [INFO ] Deduced a trap composed of 158 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2022-05-17 16:13:51] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2022-05-17 16:13:52] [INFO ] Deduced a trap composed of 120 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2022-05-17 16:14:01] [INFO ] Deduced a trap composed of 61 places in 235 ms of which 1 ms to minimize.
[2022-05-17 16:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2022-05-17 16:14:01] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:14:03] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:14:03] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:14:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-05-17 16:14:04] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 0 ms to minimize.
[2022-05-17 16:14:04] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:14:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2022-05-17 16:14:05] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2022-05-17 16:14:07] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:14:07] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-17 16:14:08] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:14:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:14:09] [INFO ] Deduced a trap composed of 135 places in 104 ms of which 5 ms to minimize.
[2022-05-17 16:14:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:14:15] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:14:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2022-05-17 16:14:18] [INFO ] Deduced a trap composed of 101 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-17 16:14:22] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:14:23] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:14:23] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:14:23] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:14:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 659 ms
[2022-05-17 16:14:26] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 2 ms to minimize.
[2022-05-17 16:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-05-17 16:14:26] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:14:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2022-05-17 16:14:27] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:14:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2022-05-17 16:14:27] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:14:28] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:14:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2022-05-17 16:14:28] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:14:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2022-05-17 16:14:36] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:14:36] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:14:37] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:14:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 610 ms
[2022-05-17 16:14:37] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:14:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2022-05-17 16:14:40] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:14:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2022-05-17 16:14:44] [INFO ] After 137596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :495
Attempting to minimize the solution found.
Minimization took 54845 ms.
[2022-05-17 16:15:39] [INFO ] After 217180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :495
Parikh walk visited 51 properties in 12428 ms.
Support contains 444 out of 700 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 700/700 places, 1108/1108 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 700 transition count 1055
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 647 transition count 1055
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 106 place count 647 transition count 1030
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 156 place count 622 transition count 1030
Applied a total of 156 rules in 65 ms. Remains 622 /700 variables (removed 78) and now considering 1030/1108 (removed 78) transitions.
Finished structural reductions, in 1 iterations. Remains : 622/700 places, 1030/1108 transitions.
Interrupted random walk after 538417 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 429) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 429) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 429) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 417) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 413) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 413) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 413) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 413) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 413) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 409) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 409) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 409) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 409) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 398) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 398) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 398) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 397) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 394) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 394) seen :0
Running SMT prover for 394 properties.
[2022-05-17 16:16:26] [INFO ] Flow matrix only has 910 transitions (discarded 120 similar events)
// Phase 1: matrix 910 rows 622 cols
[2022-05-17 16:16:26] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 16:16:32] [INFO ] After 5176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:394
[2022-05-17 16:16:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 16:16:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 16:16:50] [INFO ] After 11018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :394
[2022-05-17 16:16:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:17:03] [INFO ] After 13139ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :394
[2022-05-17 16:17:03] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:17:03] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2022-05-17 16:17:03] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:17:04] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:17:04] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:17:04] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:17:04] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:17:05] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:17:05] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:17:05] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:17:05] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:17:05] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:17:06] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:17:06] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:17:06] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:17:06] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:17:06] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:17:07] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:17:07] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:17:07] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:17:07] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:17:07] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:17:08] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:17:08] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:17:08] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:17:08] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:17:08] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:17:09] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:17:09] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:17:09] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:17:09] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:17:09] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:17:09] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:17:10] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:17:10] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:17:10] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:17:10] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:17:10] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:17:10] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:17:11] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:17:11] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:17:11] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:17:11] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:17:11] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:17:12] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:17:12] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:17:12] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:17:12] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 8984 ms
[2022-05-17 16:17:12] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:17:13] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:17:13] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:17:13] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:17:13] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:17:13] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:17:14] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:17:14] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:17:14] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:17:14] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:17:14] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:17:14] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:17:15] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:17:15] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:17:15] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:17:15] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:17:15] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:17:16] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:17:16] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:17:16] [INFO ] Deduced a trap composed of 146 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:17:16] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:17:16] [INFO ] Deduced a trap composed of 70 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:17:16] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4149 ms
[2022-05-17 16:17:17] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:17:17] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:17:17] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:17:17] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:17:17] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:17:18] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:17:18] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:17:18] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:17:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1148 ms
[2022-05-17 16:17:18] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:17:18] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:17:19] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:17:19] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:17:19] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:17:19] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:17:19] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:17:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1197 ms
[2022-05-17 16:17:19] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:17:20] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:17:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2022-05-17 16:17:20] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:17:20] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:17:20] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:17:20] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:17:21] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:17:21] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:17:21] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:17:21] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:17:21] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:17:21] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:17:22] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:17:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1877 ms
[2022-05-17 16:17:22] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:17:22] [INFO ] Deduced a trap composed of 112 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:17:22] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:17:22] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:17:22] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:17:22] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:17:23] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:17:23] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:17:23] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:17:23] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:17:23] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:17:24] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:17:24] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:17:24] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:17:24] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:17:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2466 ms
[2022-05-17 16:17:24] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:17:25] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:17:25] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:17:25] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:17:25] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:17:25] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:17:26] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:17:26] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:17:26] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:17:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1767 ms
[2022-05-17 16:17:26] [INFO ] Deduced a trap composed of 63 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:17:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2022-05-17 16:17:27] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:17:27] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:17:27] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:17:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-05-17 16:17:27] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:17:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 16:17:28] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:17:28] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:17:28] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:17:28] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:17:28] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:17:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 675 ms
[2022-05-17 16:17:29] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:17:29] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:17:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2022-05-17 16:17:29] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2022-05-17 16:17:30] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:17:30] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:17:31] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:17:31] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:17:31] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:17:31] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:17:31] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:17:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1374 ms
[2022-05-17 16:17:32] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2022-05-17 16:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2022-05-17 16:17:32] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:17:32] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:17:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2022-05-17 16:17:32] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:17:33] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:17:33] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:17:33] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:17:33] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:17:33] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:17:33] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:17:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1083 ms
[2022-05-17 16:17:34] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:17:34] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:17:34] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:17:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 636 ms
[2022-05-17 16:17:35] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:17:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-05-17 16:17:35] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:17:36] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:17:36] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:17:36] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:17:36] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:17:36] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:17:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1249 ms
[2022-05-17 16:17:37] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:17:37] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:17:37] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:17:38] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:17:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 849 ms
[2022-05-17 16:17:38] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:17:38] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:17:38] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:17:38] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:17:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 774 ms
[2022-05-17 16:17:39] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:17:39] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:17:39] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:17:39] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:17:39] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:17:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 713 ms
[2022-05-17 16:17:39] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:17:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2022-05-17 16:17:41] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:17:41] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:17:41] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:17:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 702 ms
[2022-05-17 16:17:42] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:17:42] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:17:42] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:17:42] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:17:42] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:17:42] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:17:43] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:17:43] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:17:43] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:17:43] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:17:43] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:17:44] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:17:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2255 ms
[2022-05-17 16:17:44] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:17:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:17:44] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 3 ms to minimize.
[2022-05-17 16:17:45] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:17:45] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:17:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 604 ms
[2022-05-17 16:17:46] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:17:46] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:17:46] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:17:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 465 ms
[2022-05-17 16:17:46] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:17:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:17:48] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:17:48] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:17:48] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:17:48] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:17:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 629 ms
[2022-05-17 16:17:49] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:17:49] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:17:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2022-05-17 16:17:49] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:17:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2022-05-17 16:17:50] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:17:50] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:17:50] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:17:50] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:17:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 928 ms
[2022-05-17 16:17:51] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:17:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2022-05-17 16:17:51] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:17:51] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:17:52] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:17:52] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:17:52] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:17:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 863 ms
[2022-05-17 16:17:52] [INFO ] Deduced a trap composed of 124 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:17:52] [INFO ] Deduced a trap composed of 135 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:17:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2022-05-17 16:17:53] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:17:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:17:55] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:17:55] [INFO ] Deduced a trap composed of 123 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:17:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2022-05-17 16:17:55] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:17:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:17:57] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:17:57] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:17:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 607 ms
[2022-05-17 16:17:57] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:17:58] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:17:58] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:17:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 543 ms
[2022-05-17 16:17:58] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:17:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2022-05-17 16:17:59] [INFO ] Deduced a trap composed of 134 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:17:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:18:01] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:18:02] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:18:02] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:18:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 609 ms
[2022-05-17 16:18:04] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:18:04] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:18:05] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:18:05] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:18:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2022-05-17 16:18:05] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2022-05-17 16:18:07] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:18:07] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:18:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2022-05-17 16:18:09] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:18:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:18:10] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:18:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:18:12] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:18:12] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:18:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2022-05-17 16:18:12] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:18:12] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:18:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2022-05-17 16:18:13] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:18:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2022-05-17 16:18:13] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 3 ms to minimize.
[2022-05-17 16:18:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:18:15] [INFO ] Deduced a trap composed of 120 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:18:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:18:17] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:18:18] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2022-05-17 16:18:18] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:18:19] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:18:21] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:18:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:18:21] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:18:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:18:25] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:18:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:18:26] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:18:26] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:18:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2022-05-17 16:18:26] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-17 16:18:27] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 16:18:27] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-17 16:18:28] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:18:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:18:31] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2022-05-17 16:18:32] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:18:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2022-05-17 16:18:32] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:18:32] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:18:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 462 ms
[2022-05-17 16:18:32] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:18:34] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:18:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:18:37] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:18:37] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:18:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2022-05-17 16:18:38] [INFO ] After 108313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :394
Attempting to minimize the solution found.
Minimization took 34272 ms.
[2022-05-17 16:19:12] [INFO ] After 160572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :394
Parikh walk visited 3 properties in 6573 ms.
Support contains 391 out of 622 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 622/622 places, 1030/1030 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 622 transition count 1000
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 592 transition count 1000
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 592 transition count 988
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 580 transition count 988
Applied a total of 84 rules in 36 ms. Remains 580 /622 variables (removed 42) and now considering 988/1030 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/622 places, 988/1030 transitions.
Interrupted random walk after 562770 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 391) seen :0
Interrupted probabilistic random walk after 9052092 steps, run timeout after 99001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 9052092 steps, saw 1294150 distinct states, run finished after 99005 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 391 properties.
[2022-05-17 16:21:32] [INFO ] Flow matrix only has 868 transitions (discarded 120 similar events)
// Phase 1: matrix 868 rows 580 cols
[2022-05-17 16:21:32] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 16:21:37] [INFO ] After 4817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:391
[2022-05-17 16:21:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 16:21:40] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 16:21:54] [INFO ] After 10464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :391
[2022-05-17 16:21:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:22:06] [INFO ] After 12561ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :391
[2022-05-17 16:22:06] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2022-05-17 16:22:07] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:22:07] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:22:07] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:22:07] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:22:07] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:22:08] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:22:08] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:22:08] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:22:08] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:22:08] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:22:09] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:22:09] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:22:09] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:22:09] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:22:09] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:22:10] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:22:10] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:22:10] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:22:10] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:22:10] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:22:11] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:22:11] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:22:11] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:22:11] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:22:11] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:22:11] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:22:12] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:22:12] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:22:12] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:22:12] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:22:12] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:22:13] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:22:13] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:22:13] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:22:13] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:22:13] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:22:13] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:22:14] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:22:14] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:22:14] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:22:14] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7800 ms
[2022-05-17 16:22:14] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:22:14] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:22:15] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:22:15] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:22:15] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:22:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 858 ms
[2022-05-17 16:22:15] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:22:15] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:22:16] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:22:16] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:22:16] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:22:16] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:22:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1068 ms
[2022-05-17 16:22:16] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:22:17] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:22:17] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:22:17] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:22:17] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:22:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 800 ms
[2022-05-17 16:22:17] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 16:22:18] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:22:18] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:22:18] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:22:18] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:22:18] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:22:19] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:22:19] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:22:19] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:22:19] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:22:19] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:22:19] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:22:19] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2043 ms
[2022-05-17 16:22:20] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:22:20] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:22:20] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:22:20] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:22:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 564 ms
[2022-05-17 16:22:20] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:22:20] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:22:20] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:22:21] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:22:21] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:22:21] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:22:21] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:22:21] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:22:22] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:22:22] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:22:22] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:22:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1837 ms
[2022-05-17 16:22:22] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:22:22] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:22:22] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:22:23] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:22:23] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:22:23] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:22:23] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:22:23] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1857 ms
[2022-05-17 16:22:24] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:22:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 617 ms
[2022-05-17 16:22:25] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:22:25] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:22:25] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:22:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 352 ms
[2022-05-17 16:22:25] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:22:25] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:22:25] [INFO ] Deduced a trap composed of 34 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:22:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 608 ms
[2022-05-17 16:22:26] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:22:26] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:22:26] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-17 16:22:27] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:22:27] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:22:27] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:22:27] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:22:28] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:22:28] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:22:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1197 ms
[2022-05-17 16:22:28] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:22:28] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:22:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2022-05-17 16:22:29] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:22:29] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:22:29] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:22:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 787 ms
[2022-05-17 16:22:30] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:22:30] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:22:30] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:22:30] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:22:30] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:22:31] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:22:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1134 ms
[2022-05-17 16:22:31] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:22:31] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:22:31] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:22:31] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:22:32] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:22:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 962 ms
[2022-05-17 16:22:32] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:22:32] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:22:33] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:22:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 636 ms
[2022-05-17 16:22:33] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:22:33] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:22:33] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:22:33] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:22:33] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:22:34] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:22:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 961 ms
[2022-05-17 16:22:34] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:22:34] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:22:34] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:22:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 581 ms
[2022-05-17 16:22:35] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:22:35] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:22:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2022-05-17 16:22:35] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-05-17 16:22:35] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2022-05-17 16:22:36] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:22:36] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:22:36] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:22:36] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:22:37] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:22:37] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:22:37] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:22:37] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:22:37] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:22:37] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:22:38] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:22:38] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:22:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1906 ms
[2022-05-17 16:22:38] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:22:38] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:22:38] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:22:38] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:22:38] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:22:39] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:22:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 777 ms
[2022-05-17 16:22:40] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:22:40] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:22:40] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:22:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 561 ms
[2022-05-17 16:22:40] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:22:41] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:22:41] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:22:41] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:22:42] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:22:42] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:22:42] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:22:42] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:22:42] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:22:42] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:22:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1981 ms
[2022-05-17 16:22:43] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:22:43] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:22:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2022-05-17 16:22:43] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:22:43] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:22:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2022-05-17 16:22:44] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:22:44] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2022-05-17 16:22:45] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:22:45] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:22:45] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:22:46] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:22:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 572 ms
[2022-05-17 16:22:46] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:22:46] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:22:46] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:22:46] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:22:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 718 ms
[2022-05-17 16:22:47] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2022-05-17 16:22:47] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:22:47] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:22:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:22:47] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:22:48] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:22:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2022-05-17 16:22:48] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:22:48] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:22:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2022-05-17 16:22:48] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:22:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:22:49] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:22:49] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:22:49] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:22:49] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:22:49] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:22:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 749 ms
[2022-05-17 16:22:50] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:22:50] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:22:50] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:22:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 627 ms
[2022-05-17 16:22:50] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:22:50] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2022-05-17 16:22:52] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:22:52] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:22:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2022-05-17 16:22:53] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:22:53] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:22:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2022-05-17 16:22:54] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:22:54] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:22:54] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:22:55] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:22:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2022-05-17 16:22:55] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:22:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:22:55] [INFO ] Deduced a trap composed of 128 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:22:55] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:22:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2022-05-17 16:22:57] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:22:57] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:22:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2022-05-17 16:23:00] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:23:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:23:02] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:23:02] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:23:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2022-05-17 16:23:02] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:23:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:23:04] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 16:23:05] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:23:05] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:23:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:23:06] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2022-05-17 16:23:06] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:23:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-17 16:23:09] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:23:09] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:23:09] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:23:09] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:23:09] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:23:10] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:23:10] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:23:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1087 ms
[2022-05-17 16:23:10] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2022-05-17 16:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 16:23:13] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:23:14] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:23:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2022-05-17 16:23:16] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:23:17] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:23:22] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-17 16:23:22] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2022-05-17 16:23:23] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:23:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-17 16:23:24] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:23:24] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:23:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2022-05-17 16:23:26] [INFO ] After 92504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :391
Attempting to minimize the solution found.
Minimization took 29886 ms.
[2022-05-17 16:23:56] [INFO ] After 139299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :391
Parikh walk visited 4 properties in 7361 ms.
Support contains 387 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 988/988 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 580 transition count 987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 579 transition count 987
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 579 transition count 985
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 577 transition count 985
Applied a total of 6 rules in 28 ms. Remains 577 /580 variables (removed 3) and now considering 985/988 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 577/580 places, 985/988 transitions.
Interrupted random walk after 582235 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Interrupted probabilistic random walk after 9076046 steps, run timeout after 99001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 9076046 steps, saw 1297570 distinct states, run finished after 99001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 387 properties.
[2022-05-17 16:26:16] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 577 cols
[2022-05-17 16:26:16] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 16:26:21] [INFO ] After 4782ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:387
[2022-05-17 16:26:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 16:26:24] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 16:26:38] [INFO ] After 10130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2022-05-17 16:26:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:26:50] [INFO ] After 11766ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :387
[2022-05-17 16:26:50] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:26:50] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:26:50] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:26:50] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:26:51] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:26:51] [INFO ] Deduced a trap composed of 47 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:26:51] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:26:51] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:26:51] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:26:52] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:26:52] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:26:52] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:26:52] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:26:52] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:26:53] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:26:53] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:26:53] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:26:53] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:26:53] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:26:54] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:26:54] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:26:54] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:26:54] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:26:54] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:26:54] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:26:55] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:26:55] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:26:55] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:26:55] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:26:55] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:26:56] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:26:56] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:26:56] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:26:56] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:26:56] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:26:56] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:26:57] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:26:57] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:26:57] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:26:57] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:26:57] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:26:57] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:26:58] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:26:58] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:26:58] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:26:58] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:26:58] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:26:59] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:26:59] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:26:59] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:26:59] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:26:59] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:26:59] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:27:00] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:27:00] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:27:00] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:27:00] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 10342 ms
[2022-05-17 16:27:00] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:27:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:27:01] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:27:01] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:27:01] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:27:01] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:27:01] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:27:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 671 ms
[2022-05-17 16:27:01] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 477 ms
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:27:02] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 919 ms
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:27:03] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:27:04] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:27:05] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3051 ms
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:27:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:27:07] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1468 ms
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 4 ms to minimize.
[2022-05-17 16:27:08] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 979 ms
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:27:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2022-05-17 16:27:09] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2022-05-17 16:27:10] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:27:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:27:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 803 ms
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:27:12] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 713 ms
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:27:13] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:27:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 867 ms
[2022-05-17 16:27:14] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:27:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1051 ms
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 770 ms
[2022-05-17 16:27:16] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 870 ms
[2022-05-17 16:27:17] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:27:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:27:19] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:27:20] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 70 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1561 ms
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:27:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:27:22] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:27:23] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:27:23] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:27:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1030 ms
[2022-05-17 16:27:23] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:27:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 324 ms
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2022-05-17 16:27:25] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:27:25] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:27:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2022-05-17 16:27:25] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-05-17 16:27:26] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:27:26] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:27:26] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 746 ms
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:27:27] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:27:28] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:27:28] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:27:28] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:27:28] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:27:28] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:27:29] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:27:30] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:27:30] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:27:30] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2763 ms
[2022-05-17 16:27:30] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:27:30] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:27:30] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:27:31] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:27:31] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:27:31] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:27:31] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:27:31] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:27:31] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:27:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1610 ms
[2022-05-17 16:27:32] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:27:33] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:27:33] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:27:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2022-05-17 16:27:34] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:27:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:27:34] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:27:35] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:27:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2022-05-17 16:27:36] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:27:36] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:27:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2022-05-17 16:27:36] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2022-05-17 16:27:36] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:27:37] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:27:37] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:27:38] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2022-05-17 16:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:27:39] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 16:27:39] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:27:40] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-17 16:27:42] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:27:43] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:27:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
[2022-05-17 16:27:43] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:27:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:27:46] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-05-17 16:27:46] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2022-05-17 16:27:46] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:27:47] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:27:47] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:27:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 629 ms
[2022-05-17 16:27:47] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 668 ms
[2022-05-17 16:27:49] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:27:51] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:27:53] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:27:53] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2022-05-17 16:27:55] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-17 16:27:55] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:27:55] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-05-17 16:27:56] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-17 16:27:56] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:27:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 16:27:57] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:27:57] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:27:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2022-05-17 16:27:57] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2022-05-17 16:27:58] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:27:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 16:27:58] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2022-05-17 16:27:59] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:27:59] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:27:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2022-05-17 16:28:01] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:28:03] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:28:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:28:05] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:28:07] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:28:08] [INFO ] After 90148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 30208 ms.
[2022-05-17 16:28:38] [INFO ] After 136981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Parikh walk visited 0 properties in 879 ms.
Support contains 387 out of 577 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 577/577 places, 985/985 transitions.
Applied a total of 0 rules in 25 ms. Remains 577 /577 variables (removed 0) and now considering 985/985 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 577/577 places, 985/985 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 577/577 places, 985/985 transitions.
Applied a total of 0 rules in 14 ms. Remains 577 /577 variables (removed 0) and now considering 985/985 (removed 0) transitions.
[2022-05-17 16:28:39] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 577 cols
[2022-05-17 16:28:39] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 16:28:39] [INFO ] Implicit Places using invariants in 197 ms returned [541, 553, 554, 555, 556, 557]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 200 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 571/577 places, 985/985 transitions.
Applied a total of 0 rules in 16 ms. Remains 571 /571 variables (removed 0) and now considering 985/985 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 571/577 places, 985/985 transitions.
Interrupted random walk after 563885 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Interrupted probabilistic random walk after 9024568 steps, run timeout after 99001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 9024568 steps, saw 1290250 distinct states, run finished after 99001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 387 properties.
[2022-05-17 16:30:52] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 571 cols
[2022-05-17 16:30:52] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:30:57] [INFO ] After 4724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:387
[2022-05-17 16:31:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 16:31:14] [INFO ] After 10283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2022-05-17 16:31:14] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:31:26] [INFO ] After 12602ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :387
[2022-05-17 16:31:26] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:31:27] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:31:27] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:31:27] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:31:27] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:31:28] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2022-05-17 16:31:28] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:31:28] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:31:28] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2022-05-17 16:31:28] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:31:29] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:31:29] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:31:29] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:31:29] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:31:30] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:31:30] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:31:30] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:31:30] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:31:30] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:31:30] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:31:31] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:31:31] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:31:31] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:31:31] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:31:31] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:31:32] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:31:32] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:31:32] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:31:32] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:31:32] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:31:32] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:31:33] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:31:33] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:31:33] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:31:33] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:31:33] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:31:34] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:31:34] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:31:34] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:31:34] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7614 ms
[2022-05-17 16:31:34] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:31:34] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:31:35] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:31:35] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:31:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 704 ms
[2022-05-17 16:31:35] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:31:35] [INFO ] Deduced a trap composed of 147 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:31:36] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:31:36] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:31:36] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:31:36] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:31:36] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:31:36] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:31:37] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:31:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1639 ms
[2022-05-17 16:31:37] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:31:37] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:31:37] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:31:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2022-05-17 16:31:37] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:31:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:31:38] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:31:38] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:31:38] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:31:38] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:31:38] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:31:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 650 ms
[2022-05-17 16:31:38] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:31:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:31:38] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:31:39] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:31:39] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:31:39] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:31:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 542 ms
[2022-05-17 16:31:39] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:31:39] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:31:40] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:31:40] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:31:40] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:31:40] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:31:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1102 ms
[2022-05-17 16:31:40] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:31:40] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:31:40] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:31:41] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:31:41] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:31:41] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:31:41] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:31:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1071 ms
[2022-05-17 16:31:41] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:31:41] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:31:42] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:31:42] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:31:42] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:31:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 686 ms
[2022-05-17 16:31:42] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:31:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2022-05-17 16:31:42] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:31:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:31:43] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:31:43] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:31:43] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:31:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-17 16:31:43] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:31:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-17 16:31:44] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:31:44] [INFO ] Deduced a trap composed of 72 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:31:44] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:31:44] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:31:44] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:31:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 781 ms
[2022-05-17 16:31:44] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:31:45] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:31:45] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:31:45] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:31:45] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:31:45] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:31:45] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:31:46] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:31:46] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:31:46] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:31:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1500 ms
[2022-05-17 16:31:46] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:31:46] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:31:47] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:31:47] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:31:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2022-05-17 16:31:47] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:31:47] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:31:47] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:31:48] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:31:48] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:31:48] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:31:48] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:31:48] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:31:49] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:31:49] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:31:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1739 ms
[2022-05-17 16:31:49] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:31:50] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:31:50] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:31:50] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:31:50] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:31:50] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:31:50] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:31:50] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:31:51] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:31:51] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:31:51] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:31:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1605 ms
[2022-05-17 16:31:51] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:31:51] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:31:51] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:31:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2022-05-17 16:31:52] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:31:52] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:31:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 392 ms
[2022-05-17 16:31:52] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:31:52] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:31:52] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:31:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 534 ms
[2022-05-17 16:31:53] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:31:53] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:31:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 374 ms
[2022-05-17 16:31:53] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:31:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-17 16:31:54] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:31:54] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:31:54] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:31:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 488 ms
[2022-05-17 16:31:54] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:31:54] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:31:55] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:31:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2022-05-17 16:31:56] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:31:56] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:31:56] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:31:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 687 ms
[2022-05-17 16:31:56] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:31:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2022-05-17 16:31:57] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2022-05-17 16:31:57] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2022-05-17 16:31:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2022-05-17 16:31:57] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:31:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:31:58] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:31:58] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:31:58] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:31:58] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:31:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 793 ms
[2022-05-17 16:31:59] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:31:59] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:31:59] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:31:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 575 ms
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1249 ms
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2029 ms
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 128 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:32:18] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2022-05-17 16:32:19] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:32:19] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:32:21] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:32:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-05-17 16:32:22] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2022-05-17 16:32:23] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:32:26] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 16:32:26] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:32:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:32:27] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:32:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2022-05-17 16:32:37] [INFO ] After 83210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 26003 ms.
[2022-05-17 16:33:03] [INFO ] After 125879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Parikh walk visited 0 properties in 405 ms.
Support contains 387 out of 571 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 985/985 transitions.
Applied a total of 0 rules in 13 ms. Remains 571 /571 variables (removed 0) and now considering 985/985 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 571/571 places, 985/985 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 985/985 transitions.
Applied a total of 0 rules in 12 ms. Remains 571 /571 variables (removed 0) and now considering 985/985 (removed 0) transitions.
[2022-05-17 16:33:03] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 571 cols
[2022-05-17 16:33:03] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 16:33:03] [INFO ] Implicit Places using invariants in 187 ms returned []
[2022-05-17 16:33:03] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 571 cols
[2022-05-17 16:33:03] [INFO ] Computed 17 place invariants in 9 ms
[2022-05-17 16:33:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:33:04] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2022-05-17 16:33:05] [INFO ] Redundant transitions in 59 ms returned []
[2022-05-17 16:33:05] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 571 cols
[2022-05-17 16:33:05] [INFO ] Computed 17 place invariants in 8 ms
[2022-05-17 16:33:05] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 571/571 places, 985/985 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 5436 ms. (steps per millisecond=18 ) properties (out of 387) seen :0
Running SMT prover for 387 properties.
[2022-05-17 16:33:10] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 571 cols
[2022-05-17 16:33:10] [INFO ] Computed 17 place invariants in 11 ms
[2022-05-17 16:33:15] [INFO ] After 4728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:387
[2022-05-17 16:33:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 16:33:32] [INFO ] After 10262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2022-05-17 16:33:32] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:33:44] [INFO ] After 12065ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :387
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 1 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7257 ms
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 682 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 147 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1565 ms
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 649 ms
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 559 ms
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1026 ms
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1062 ms
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 691 ms
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 763 ms
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1508 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:34:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1703 ms
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1503 ms
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 443 ms
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-05-17 16:34:09] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 498 ms
[2022-05-17 16:34:12] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 630 ms
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2022-05-17 16:34:14] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:34:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:34:14] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 738 ms
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 555 ms
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1181 ms
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1905 ms
[2022-05-17 16:34:21] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:34:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2022-05-17 16:34:22] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 16:34:22] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:34:22] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:34:23] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:34:23] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:34:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2022-05-17 16:34:23] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:34:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:34:24] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:34:24] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:34:24] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 128 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:34:29] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:34:29] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:34:30] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2022-05-17 16:34:30] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:34:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:34:32] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-17 16:34:32] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-17 16:34:32] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:34:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2022-05-17 16:34:33] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:34:33] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:34:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-05-17 16:34:33] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:34:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:34:34] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:34:34] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:34:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:34:35] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:34:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:34:37] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:34:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2022-05-17 16:34:38] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2022-05-17 16:34:39] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:34:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-17 16:34:41] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-17 16:34:42] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:34:43] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:34:47] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:34:48] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:34:49] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2022-05-17 16:34:53] [INFO ] After 80831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 2716 ms.
[2022-05-17 16:34:55] [INFO ] After 100012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Interrupted random walk after 563066 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 387) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 387) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 386) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 386) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 382) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 382) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 381) seen :0
Probabilistic random walk after 10000001 steps, saw 1429528 distinct states, run finished after 109435 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 381 properties.
[2022-05-17 16:37:24] [INFO ] Flow matrix only has 865 transitions (discarded 120 similar events)
// Phase 1: matrix 865 rows 571 cols
[2022-05-17 16:37:24] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 16:37:29] [INFO ] After 4612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:381
[2022-05-17 16:37:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2022-05-17 16:37:45] [INFO ] After 10006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :381
[2022-05-17 16:37:45] [INFO ] State equation strengthened by 205 read => feed constraints.
[2022-05-17 16:37:58] [INFO ] After 12388ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :381
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:38:02] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:38:03] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:38:03] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:38:03] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:38:03] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5581 ms
[2022-05-17 16:38:03] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:38:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1695 ms
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 943 ms
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:38:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 535 ms
[2022-05-17 16:38:07] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2086 ms
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:38:11] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:38:11] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:38:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1289 ms
[2022-05-17 16:38:11] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:38:11] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:38:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2022-05-17 16:38:11] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:38:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2022-05-17 16:38:12] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2022-05-17 16:38:12] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:38:12] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:38:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2022-05-17 16:38:13] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:38:13] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:38:13] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:38:13] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:38:13] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:38:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1804 ms
[2022-05-17 16:38:14] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:38:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 489 ms
[2022-05-17 16:38:15] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:38:16] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:38:16] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:38:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 539 ms
[2022-05-17 16:38:16] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:38:16] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:38:16] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:38:17] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:38:17] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:38:17] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:38:17] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:38:17] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:38:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1609 ms
[2022-05-17 16:38:18] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 16:38:18] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:38:18] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:38:18] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1510 ms
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:38:19] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:38:20] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:38:20] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:38:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 517 ms
[2022-05-17 16:38:20] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:38:20] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:38:20] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:38:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 601 ms
[2022-05-17 16:38:21] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:38:21] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:38:21] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:38:21] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:38:21] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:38:21] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:38:22] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:38:22] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:38:22] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:38:22] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:38:22] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:38:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1660 ms
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-17 16:38:23] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:38:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 567 ms
[2022-05-17 16:38:25] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:38:25] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:38:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2022-05-17 16:38:25] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:38:25] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:38:25] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:38:25] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:38:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 643 ms
[2022-05-17 16:38:26] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:38:26] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-05-17 16:38:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2022-05-17 16:38:27] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:38:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:38:27] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:38:27] [INFO ] Deduced a trap composed of 61 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:38:28] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:38:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 827 ms
[2022-05-17 16:38:28] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2022-05-17 16:38:28] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:38:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:38:28] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:38:29] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:38:29] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:38:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 510 ms
[2022-05-17 16:38:29] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2022-05-17 16:38:29] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:38:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:38:30] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:30] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:38:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-17 16:38:31] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:38:31] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:38:31] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:38:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2022-05-17 16:38:31] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:38:31] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:38:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-17 16:38:32] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:38:32] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:38:32] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:38:32] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:38:32] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:38:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 955 ms
[2022-05-17 16:38:33] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:38:33] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:38:33] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2022-05-17 16:38:33] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:38:34] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:38:34] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:38:34] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:38:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 698 ms
[2022-05-17 16:38:34] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:38:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2022-05-17 16:38:35] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:38:35] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:38:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2022-05-17 16:38:35] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:38:35] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:38:35] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:38:36] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:37] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:38:37] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:38:37] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:37] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:37] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:38:37] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:38:38] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:38] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:38] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:38:38] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:38] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:38:38] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3247 ms
[2022-05-17 16:38:38] [INFO ] Deduced a trap composed of 145 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:38:39] [INFO ] Deduced a trap composed of 145 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:38:39] [INFO ] Deduced a trap composed of 161 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:38:39] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:38:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 594 ms
[2022-05-17 16:38:39] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:38:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:38:40] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:38:40] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:38:40] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:38:40] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:38:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 602 ms
[2022-05-17 16:38:40] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:38:40] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:38:40] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:38:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 405 ms
[2022-05-17 16:38:41] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2022-05-17 16:38:42] [INFO ] Deduced a trap composed of 55 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2022-05-17 16:38:42] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:38:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2022-05-17 16:38:43] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:38:44] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:38:44] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:38:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 486 ms
[2022-05-17 16:38:44] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:38:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:38:47] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2022-05-17 16:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 16:38:48] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:38:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 16:38:51] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:38:51] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-17 16:38:51] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:38:52] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:38:52] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:38:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:38:53] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:38:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-17 16:38:53] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:38:53] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:38:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2022-05-17 16:38:55] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:38:58] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:38:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 16:39:00] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 0 ms to minimize.
[2022-05-17 16:39:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:39:01] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:39:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:39:02] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:39:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 556 ms
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2022-05-17 16:39:06] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:39:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2022-05-17 16:39:07] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:39:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:39:09] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:39:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:39:10] [INFO ] After 85350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :381
Attempting to minimize the solution found.
Minimization took 27481 ms.
[2022-05-17 16:39:38] [INFO ] After 128990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :381
Parikh walk visited 0 properties in 2485 ms.
Support contains 381 out of 571 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 571/571 places, 985/985 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 983
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 569 transition count 983
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 569 transition count 980
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 566 transition count 980
Applied a total of 10 rules in 24 ms. Remains 566 /571 variables (removed 5) and now considering 980/985 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/571 places, 980/985 transitions.
Interrupted random walk after 647323 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 381) seen :0

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-5, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-tall-165277023900048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;