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-165277023900059.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-7, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-tall-165277023900059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 283K Apr 30 10:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 30 10:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 861K Apr 30 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 168K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 481K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 122K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 417K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 59K 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 1.3M 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 Liveness

=== Now, execution of the tool begins

BK_START 1652805653734

Running Version 202205111006
[2022-05-17 16:40:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -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:40:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:40:55] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-05-17 16:40:55] [INFO ] Transformed 1992 places.
[2022-05-17 16:40:55] [INFO ] Transformed 3096 transitions.
[2022-05-17 16:40:55] [INFO ] Found NUPN structural information;
[2022-05-17 16:40:55] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2022-05-17 16:40:55] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 320 ms.
Built sparse matrix representations for Structural reductions in 13 ms.19856KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 116 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 55 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-05-17 16:40:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 16:40:55] [INFO ] Computed 31 place invariants in 37 ms
[2022-05-17 16:40:56] [INFO ] Implicit Places using invariants in 543 ms returned []
[2022-05-17 16:40:56] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 16:40:56] [INFO ] Computed 31 place invariants in 30 ms
[2022-05-17 16:40:57] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 16:40:57] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2022-05-17 16:40:57] [INFO ] Redundant transitions in 186 ms returned []
[2022-05-17 16:40:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 16:40:57] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 16:40:59] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3135 ms (no deadlock found). (steps per millisecond=398 )
Random directed walk for 1250000 steps, including 0 resets, run took 4493 ms (no deadlock found). (steps per millisecond=278 )
[2022-05-17 16:41:07] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 16:41:07] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-17 16:41:08] [INFO ] [Real]Absence check using 23 positive place invariants in 106 ms returned sat
[2022-05-17 16:41:08] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 68 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 264 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2022-05-17 16:41:08] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2022-05-17 16:41:08] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-17 16:41:08] [INFO ] Implicit Places using invariants in 422 ms returned [576, 577, 578, 579, 580, 589, 590, 591]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 428 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 584/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 34 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 584/1992 places, 1696/3096 transitions.
Discarding 8 transitions out of 1696. Remains 1688
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1445 ms. (steps per millisecond=6 ) properties (out of 1688) seen :591
Running SMT prover for 1097 properties.
[2022-05-17 16:41:10] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2022-05-17 16:41:10] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 16:41:20] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 16:41:35] [INFO ] After 6124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :975 real:122
[2022-05-17 16:41:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 16:41:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:41:35] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1097 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 554 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 24 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1696/1696 transitions.
Interrupted random walk after 365512 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 161
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 936) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 929) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 924) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 918) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 916) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 909) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 906) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 903) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 899) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 899) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 897) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 896) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 894) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 893) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 892) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 891) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 887) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 886) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 885) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 884) 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 884) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 882) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 880) 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 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 880) 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 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 880) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 880) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 878) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 877) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 875) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 875) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 875) 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 875) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 873) 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 873) 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 873) 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 873) 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 873) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 871) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 871) 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 871) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 870) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 870) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 870) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 870) 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 870) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 870) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 870) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 867) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 866) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 866) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 866) 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 866) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 866) 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 866) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 865) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 863) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 861) 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 861) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 861) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 861) 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 861) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 861) 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 861) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 861) 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 861) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 860) 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 860) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 860) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 857) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 857) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 856) 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 856) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 856) 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 856) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 856) 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 856) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 856) 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 856) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 856) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 856) 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 856) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 853) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 853) 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 853) 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 853) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 853) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 853) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 853) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 853) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 851) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 849) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 849) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 849) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 849) 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 849) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 849) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 849) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 848) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 845) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 843) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 840) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 838) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 838) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 838) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 837) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) 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 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) 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 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 835) 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 835) 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 835) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 832) 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 832) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 832) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 832) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 832) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 832) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 832) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 831) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 831) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) 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 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 829) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 828) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 828) 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 828) 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 828) 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 828) 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 828) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) 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 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) 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 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) 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 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) 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 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) 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 827) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 827) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) 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 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) 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 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) 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 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 826) 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 826) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 825) 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 825) 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 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 825) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 825) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) 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 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) 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 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) 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 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 824) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) 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 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 823) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 822) 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 822) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 822) 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 822) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 822) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 822) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 820) 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 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 820) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 820) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 819) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 819) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 819) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 819) 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 819) 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 819) 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 819) 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 819) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 819) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 817) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 817) 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 817) 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 817) 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 817) 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 817) 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 817) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) 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 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) 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 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 815) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) 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 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 813) seen :0
Running SMT prover for 813 properties.
[2022-05-17 16:42:09] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2022-05-17 16:42:09] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 16:42:16] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 16:42:58] [INFO ] After 48896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:813
[2022-05-17 16:43:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 16:43:41] [INFO ] After 29413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :813
[2022-05-17 16:43:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 16:44:15] [INFO ] After 33367ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :813
[2022-05-17 16:44:15] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 6 ms to minimize.
[2022-05-17 16:44:15] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 1 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 1 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 2 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 0 ms to minimize.
[2022-05-17 16:44:16] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:44:17] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:44:17] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:44:17] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:44:17] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:44:18] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:44:19] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:44:19] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:44:19] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
[2022-05-17 16:44:19] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:44:19] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:44:20] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:44:21] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:44:22] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:44:23] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:44:24] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:44:25] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 10647 ms
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 2 ms to minimize.
[2022-05-17 16:44:26] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:44:27] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:44:28] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:44:28] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:44:28] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 2 ms to minimize.
[2022-05-17 16:44:28] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 5 ms to minimize.
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:44:29] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:44:30] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:44:30] [INFO ] Deduced a trap composed of 22 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:44:30] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:44:30] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:44:31] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:44:32] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:44:33] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:44:33] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:44:33] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:44:33] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:44:34] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:44:34] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:44:34] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:44:34] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:44:34] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:44:35] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:44:36] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:44:37] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:44:38] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:44:38] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:44:38] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 12256 ms
[2022-05-17 16:44:38] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:44:39] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:44:40] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2022-05-17 16:44:41] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:44:42] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:44:42] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:44:42] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:44:42] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:44:43] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:44:44] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 0 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:44:45] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:44:46] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 56 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:44:47] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:44:48] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 9733 ms
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:44:49] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:44:50] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:44:51] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:44:52] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:44:53] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4692 ms
[2022-05-17 16:44:53] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:44:54] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:44:55] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:44:56] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:44:57] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 0 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:44:58] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5070 ms
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:44:59] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:45:03] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 12993 ms
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:45:12] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:45:13] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:45:14] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:45:15] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:45:16] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:45:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5102 ms
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:45:18] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:45:19] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:45:20] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:45:21] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:45:22] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 2 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 53 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:45:23] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:45:24] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:45:25] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:45:26] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:45:27] [INFO ] Deduced a trap composed of 52 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 90 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 102 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:45:28] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 0 ms to minimize.
[2022-05-17 16:45:29] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 0 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:45:30] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 12437 ms
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:45:31] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:45:32] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:45:34] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 53 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:45:35] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:45:36] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:45:37] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6183 ms
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:45:38] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:45:39] [INFO ] Deduced a trap composed of 65 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:45:46] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:45:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 16152 ms
[2022-05-17 16:46:02] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:46:06] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:46:06] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:46:06] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7843 ms
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:46:10] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:46:11] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:46:11] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:46:11] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:46:11] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:46:12] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:46:13] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:46:14] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:46:20] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:46:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 16223 ms
[2022-05-17 16:46:27] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:46:28] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:46:28] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:46:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1155 ms
[2022-05-17 16:46:30] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:46:30] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:46:31] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:46:33] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:46:33] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:46:33] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:46:33] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:46:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6241 ms
[2022-05-17 16:46:37] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2843 ms
[2022-05-17 16:46:41] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:46:41] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:46:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2022-05-17 16:46:43] [INFO ] After 181501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :811
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:46:43] [INFO ] After 225024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :811
Fused 813 Parikh solutions to 766 different solutions.
Parikh walk visited 21 properties in 30006 ms.
Support contains 473 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 26 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1696/1696 transitions.
Interrupted random walk after 396915 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 58
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) 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 734) seen :0
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 13117 ms. (steps per millisecond=76 ) properties seen :55
Running SMT prover for 679 properties.
[2022-05-17 16:47:57] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2022-05-17 16:47:57] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 16:48:03] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 16:48:37] [INFO ] After 40048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:679
[2022-05-17 16:48:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 16:49:12] [INFO ] After 24023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :679
[2022-05-17 16:49:12] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 16:49:38] [INFO ] After 26423ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :679
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:49:39] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 0 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 1 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:49:40] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 0 ms to minimize.
[2022-05-17 16:49:41] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 1 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 1 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 3 ms to minimize.
[2022-05-17 16:49:42] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 1 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 0 ms to minimize.
[2022-05-17 16:49:43] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 0 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 109 places in 189 ms of which 1 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 1 ms to minimize.
[2022-05-17 16:49:44] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 64 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 36 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:49:45] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:49:46] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:49:47] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:49:48] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:49:49] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:49:50] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:49:51] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:49:52] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:49:53] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:49:54] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Trap strengthening (SAT) tested/added 91/90 trap constraints in 19716 ms
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 8655 ms
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 51 places in 199 ms of which 1 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 94 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 4 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 13842 ms
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 16692 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 57 places in 205 ms of which 0 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 0 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:49] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 10070 ms
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:51:01] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 9624 ms
[2022-05-17 16:51:02] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:51:02] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:51:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:51:03] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:51:04] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:51:04] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:51:05] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:51:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2125 ms
[2022-05-17 16:51:09] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:51:10] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 0 ms to minimize.
[2022-05-17 16:51:10] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:51:10] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:51:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5874 ms
[2022-05-17 16:51:19] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:51:20] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:51:20] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:51:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 646 ms
[2022-05-17 16:51:21] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:51:21] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:51:21] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:51:22] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:51:22] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:51:22] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:51:23] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:51:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2167 ms
[2022-05-17 16:51:24] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:51:24] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2022-05-17 16:51:24] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:51:25] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:51:25] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:51:25] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:51:25] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:51:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1692 ms
[2022-05-17 16:51:26] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:51:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-17 16:51:26] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:51:26] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 96 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:51:27] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:51:28] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 1 ms to minimize.
[2022-05-17 16:51:28] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:51:28] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:51:28] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:51:29] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:51:29] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:51:29] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 0 ms to minimize.
[2022-05-17 16:51:29] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:51:29] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:51:30] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:51:30] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:51:30] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:51:30] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4102 ms
[2022-05-17 16:51:31] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:51:31] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:51:31] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:51:31] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:51:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 639 ms
[2022-05-17 16:51:32] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:51:32] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:51:32] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:51:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 629 ms
[2022-05-17 16:51:33] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:51:33] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:51:33] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:51:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2022-05-17 16:51:34] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:51:34] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:51:34] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:51:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 544 ms
[2022-05-17 16:51:34] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2022-05-17 16:51:35] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2022-05-17 16:51:35] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2022-05-17 16:51:37] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-17 16:51:37] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:51:37] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:51:37] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:51:37] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:51:38] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:51:38] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:51:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1097 ms
[2022-05-17 16:51:39] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:51:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-17 16:51:40] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:51:40] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:51:40] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:51:40] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:51:41] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:51:41] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:51:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1104 ms
[2022-05-17 16:51:41] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:51:43] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:51:43] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:51:43] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:51:43] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:51:43] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:51:43] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:51:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1080 ms
[2022-05-17 16:51:44] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:51:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:51:45] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:51:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2022-05-17 16:51:45] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:51:45] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:51:45] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:51:46] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:51:46] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:51:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1076 ms
[2022-05-17 16:51:48] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:51:48] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:51:48] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:51:48] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:51:48] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:51:48] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:51:49] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:51:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1402 ms
[2022-05-17 16:51:49] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 533 ms
[2022-05-17 16:51:54] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:51:54] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:51:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2022-05-17 16:51:56] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:51:56] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:51:56] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:51:56] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:51:57] [INFO ] Deduced a trap composed of 62 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:51:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 916 ms
[2022-05-17 16:51:57] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:51:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-17 16:51:58] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:51:58] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:51:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2022-05-17 16:51:58] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:51:59] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:51:59] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:51:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 675 ms
[2022-05-17 16:51:59] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2022-05-17 16:52:00] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:52:00] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2022-05-17 16:52:02] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:52:02] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:52:02] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:52:02] [INFO ] Deduced a trap composed of 121 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:52:03] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:52:03] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:52:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1280 ms
[2022-05-17 16:52:04] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:52:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2022-05-17 16:52:05] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:52:05] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:52:05] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:52:05] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:52:05] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:52:06] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:52:06] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:52:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1481 ms
[2022-05-17 16:52:08] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:52:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2022-05-17 16:52:09] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:52:09] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:52:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 493 ms
[2022-05-17 16:52:10] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:52:11] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:52:11] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2022-05-17 16:52:11] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:52:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 932 ms
[2022-05-17 16:52:12] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:52:12] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:52:12] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:52:12] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:52:12] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:52:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 836 ms
[2022-05-17 16:52:13] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:52:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2022-05-17 16:52:13] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:52:14] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:52:14] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:52:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 627 ms
[2022-05-17 16:52:14] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:52:15] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:52:15] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:52:15] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:52:15] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:52:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 933 ms
[2022-05-17 16:52:17] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:52:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 16:52:19] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:52:19] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:52:19] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:52:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2022-05-17 16:52:20] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:52:20] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:52:20] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:52:20] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:52:21] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:52:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1079 ms
[2022-05-17 16:52:21] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2022-05-17 16:52:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:52:22] [INFO ] After 225021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:679
Fused 679 Parikh solutions to 638 different solutions.
Parikh walk visited 4 properties in 17480 ms.
Support contains 453 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 20 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1696/1696 transitions.
Interrupted random walk after 470309 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 657) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 657) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 657) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 655) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 655) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 654) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 653) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 652) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 651) seen :0
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 11101 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 651 properties.
[2022-05-17 16:53:21] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2022-05-17 16:53:21] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 16:53:27] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 16:53:57] [INFO ] After 35583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:651
[2022-05-17 16:54:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 16:54:29] [INFO ] After 21297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :651
[2022-05-17 16:54:29] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 16:54:56] [INFO ] After 27309ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :651
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 50 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 10984 ms
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 1 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 4 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 59 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:55:21] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Deduced a trap composed of 67 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:55:22] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 14912 ms
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 4 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 0 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:33] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 12669 ms
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:55:38] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:40] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:55:41] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:55:42] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:42] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:55:44] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:55:44] [INFO ] Deduced a trap composed of 47 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:55:45] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:55:48] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:49] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:54] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 17728 ms
[2022-05-17 16:55:54] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:56:03] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:56:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 9159 ms
[2022-05-17 16:56:04] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 1 ms to minimize.
[2022-05-17 16:56:05] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:56:06] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 57 places in 169 ms of which 0 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 0 ms to minimize.
[2022-05-17 16:56:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3173 ms
[2022-05-17 16:56:09] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:56:09] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 1 ms to minimize.
[2022-05-17 16:56:09] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:56:10] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2022-05-17 16:56:11] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:56:11] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 1 ms to minimize.
[2022-05-17 16:56:11] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:56:11] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:56:12] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:56:12] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:56:12] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:56:12] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:56:15] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:56:15] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6224 ms
[2022-05-17 16:56:15] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:56:15] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:56:16] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:56:16] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:56:16] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2022-05-17 16:56:17] [INFO ] Deduced a trap composed of 59 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:56:17] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:56:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1813 ms
[2022-05-17 16:56:19] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:56:19] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:56:20] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:56:20] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 0 ms to minimize.
[2022-05-17 16:56:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 866 ms
[2022-05-17 16:56:20] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:56:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2797 ms
[2022-05-17 16:56:25] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2022-05-17 16:56:25] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:56:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2022-05-17 16:56:27] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 1 ms to minimize.
[2022-05-17 16:56:27] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2022-05-17 16:56:27] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:56:27] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2022-05-17 16:56:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 920 ms
[2022-05-17 16:56:28] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2022-05-17 16:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2022-05-17 16:56:28] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 0 ms to minimize.
[2022-05-17 16:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2022-05-17 16:56:29] [INFO ] Deduced a trap composed of 86 places in 197 ms of which 1 ms to minimize.
[2022-05-17 16:56:29] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 0 ms to minimize.
[2022-05-17 16:56:29] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 0 ms to minimize.
[2022-05-17 16:56:29] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:56:29] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:56:30] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:56:30] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 1 ms to minimize.
[2022-05-17 16:56:30] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:56:30] [INFO ] Deduced a trap composed of 80 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2552 ms
[2022-05-17 16:56:31] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:56:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2022-05-17 16:56:32] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:56:32] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:56:33] [INFO ] Deduced a trap composed of 56 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:56:33] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:56:33] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:56:34] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:56:34] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 0 ms to minimize.
[2022-05-17 16:56:34] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:56:34] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 0 ms to minimize.
[2022-05-17 16:56:34] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:56:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1845 ms
[2022-05-17 16:56:35] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:56:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-17 16:56:35] [INFO ] Deduced a trap composed of 67 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:56:35] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:56:35] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:56:36] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:56:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 681 ms
[2022-05-17 16:56:36] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2022-05-17 16:56:36] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:56:37] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 1 ms to minimize.
[2022-05-17 16:56:37] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 0 ms to minimize.
[2022-05-17 16:56:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 690 ms
[2022-05-17 16:56:37] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:56:37] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:56:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 398 ms
[2022-05-17 16:56:38] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:56:38] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 0 ms to minimize.
[2022-05-17 16:56:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 634 ms
[2022-05-17 16:56:38] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:56:39] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:56:39] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:56:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 571 ms
[2022-05-17 16:56:39] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:56:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:56:40] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:56:40] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:56:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2022-05-17 16:56:41] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:56:41] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:56:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2022-05-17 16:56:42] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:56:42] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:56:43] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:56:43] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:56:43] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 1 ms to minimize.
[2022-05-17 16:56:43] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 0 ms to minimize.
[2022-05-17 16:56:44] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:56:44] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 0 ms to minimize.
[2022-05-17 16:56:44] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:56:44] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:56:44] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:56:45] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:56:45] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:56:45] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:56:45] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:56:45] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:56:45] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:56:46] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3243 ms
[2022-05-17 16:56:47] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:56:47] [INFO ] Deduced a trap composed of 67 places in 161 ms of which 0 ms to minimize.
[2022-05-17 16:56:47] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:56:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 657 ms
[2022-05-17 16:56:48] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:56:48] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:56:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2022-05-17 16:56:49] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:56:49] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:56:50] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:56:50] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:56:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 641 ms
[2022-05-17 16:56:51] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:56:51] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:56:51] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:56:51] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:56:52] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:56:52] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:56:52] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:56:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1327 ms
[2022-05-17 16:56:52] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:56:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:56:54] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:56:55] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:56:55] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:56:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 527 ms
[2022-05-17 16:56:56] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:56:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 0 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 1 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1168 ms
[2022-05-17 16:56:58] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 0 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 0 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 621 ms
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 0 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 0 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 584 ms
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 54 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 60 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 0 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 1 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 0 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 1 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 0 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 1 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2952 ms
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 55 places in 196 ms of which 1 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 1 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 986 ms
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2022-05-17 16:57:13] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 0 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 759 ms
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 1 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 0 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 1 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 1 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 68 places in 199 ms of which 0 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1146 ms
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 0 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1466 ms
[2022-05-17 16:57:23] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 905 ms
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 624 ms
[2022-05-17 16:57:35] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 1 ms to minimize.
[2022-05-17 16:57:35] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 0 ms to minimize.
[2022-05-17 16:57:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 624 ms
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 762 ms
[2022-05-17 16:57:39] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:57:40] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:57:40] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2022-05-17 16:57:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1122 ms
[2022-05-17 16:57:41] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:57:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:57:42] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:57:42] [INFO ] Deduced a trap composed of 2 places in 231 ms of which 0 ms to minimize.
[2022-05-17 16:57:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:57:42] [INFO ] After 225240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:651
Fused 651 Parikh solutions to 606 different solutions.
Parikh walk visited 4 properties in 11241 ms.
Support contains 444 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 20 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1696/1696 transitions.
Interrupted random walk after 509122 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 636) seen :0
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 11331 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 636 properties.
[2022-05-17 16:58:35] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2022-05-17 16:58:35] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 16:58:41] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2022-05-17 16:59:08] [INFO ] After 33065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:636
[2022-05-17 16:59:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2022-05-17 16:59:42] [INFO ] After 22630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :636
[2022-05-17 16:59:42] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 17:00:09] [INFO ] After 27475ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :636
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 1 ms to minimize.
[2022-05-17 17:00:10] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:00:11] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 0 ms to minimize.
[2022-05-17 17:00:12] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 0 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 1 ms to minimize.
[2022-05-17 17:00:13] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2022-05-17 17:00:14] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 1 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:00:15] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:00:16] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 0 ms to minimize.
[2022-05-17 17:00:17] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2022-05-17 17:00:18] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 0 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 0 ms to minimize.
[2022-05-17 17:00:19] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 0 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:00:20] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 0 ms to minimize.
[2022-05-17 17:00:21] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 1 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 1 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2022-05-17 17:00:22] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 0 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 0 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 0 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2022-05-17 17:00:23] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 0 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 0 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 1 ms to minimize.
[2022-05-17 17:00:24] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 1 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 1 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 15383 ms
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:00:25] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 1 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:26] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:00:27] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:28] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:00:28] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:00:28] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 0 ms to minimize.
[2022-05-17 17:00:28] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 0 ms to minimize.
[2022-05-17 17:00:29] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2022-05-17 17:00:29] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2022-05-17 17:00:29] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 0 ms to minimize.
[2022-05-17 17:00:29] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:00:29] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:00:30] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:00:30] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 0 ms to minimize.
[2022-05-17 17:00:30] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:00:30] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2022-05-17 17:00:31] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 0 ms to minimize.
[2022-05-17 17:00:31] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:00:31] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 0 ms to minimize.
[2022-05-17 17:00:31] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2022-05-17 17:00:31] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:00:32] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:00:32] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2022-05-17 17:00:32] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:00:32] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2022-05-17 17:00:33] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:00:33] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2022-05-17 17:00:33] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 0 ms to minimize.
[2022-05-17 17:00:33] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2022-05-17 17:00:34] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2022-05-17 17:00:34] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:34] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2022-05-17 17:00:34] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 1 ms to minimize.
[2022-05-17 17:00:34] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 1 ms to minimize.
[2022-05-17 17:00:35] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:00:35] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 0 ms to minimize.
[2022-05-17 17:00:35] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 0 ms to minimize.
[2022-05-17 17:00:35] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:00:35] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 1 ms to minimize.
[2022-05-17 17:00:36] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 0 ms to minimize.
[2022-05-17 17:00:36] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 0 ms to minimize.
[2022-05-17 17:00:36] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2022-05-17 17:00:36] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 0 ms to minimize.
[2022-05-17 17:00:36] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2022-05-17 17:00:37] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 0 ms to minimize.
[2022-05-17 17:00:37] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 1 ms to minimize.
[2022-05-17 17:00:37] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 0 ms to minimize.
[2022-05-17 17:00:37] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 11919 ms
[2022-05-17 17:00:37] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:00:38] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:38] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:38] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:00:38] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:00:39] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 0 ms to minimize.
[2022-05-17 17:00:39] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2022-05-17 17:00:39] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:00:39] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 0 ms to minimize.
[2022-05-17 17:00:39] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 0 ms to minimize.
[2022-05-17 17:00:40] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 0 ms to minimize.
[2022-05-17 17:00:40] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:00:40] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 0 ms to minimize.
[2022-05-17 17:00:40] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:00:41] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 1 ms to minimize.
[2022-05-17 17:00:41] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:00:41] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 0 ms to minimize.
[2022-05-17 17:00:41] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:00:41] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 0 ms to minimize.
[2022-05-17 17:00:42] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:00:42] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:00:42] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 1 ms to minimize.
[2022-05-17 17:00:42] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 1 ms to minimize.
[2022-05-17 17:00:43] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2022-05-17 17:00:43] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2022-05-17 17:00:43] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2022-05-17 17:00:43] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:00:44] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:44] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:44] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 0 ms to minimize.
[2022-05-17 17:00:44] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:00:44] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2022-05-17 17:00:45] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:00:45] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 0 ms to minimize.
[2022-05-17 17:00:45] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 1 ms to minimize.
[2022-05-17 17:00:45] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 1 ms to minimize.
[2022-05-17 17:00:45] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 1 ms to minimize.
[2022-05-17 17:00:46] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 0 ms to minimize.
[2022-05-17 17:00:46] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 1 ms to minimize.
[2022-05-17 17:00:46] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:00:46] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:00:46] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:00:51] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:00:51] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:00:56] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:01:00] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2022-05-17 17:01:00] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:01:00] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 0 ms to minimize.
[2022-05-17 17:01:00] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 0 ms to minimize.
[2022-05-17 17:01:01] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:01:01] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:01:01] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 0 ms to minimize.
[2022-05-17 17:01:02] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2022-05-17 17:01:02] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2022-05-17 17:01:02] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 0 ms to minimize.
[2022-05-17 17:01:03] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:01:03] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:01:12] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 34827 ms
[2022-05-17 17:01:13] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 0 ms to minimize.
[2022-05-17 17:01:13] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 0 ms to minimize.
[2022-05-17 17:01:13] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 0 ms to minimize.
[2022-05-17 17:01:13] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2022-05-17 17:01:14] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2022-05-17 17:01:14] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 1 ms to minimize.
[2022-05-17 17:01:14] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 1 ms to minimize.
[2022-05-17 17:01:14] [INFO ] Deduced a trap composed of 70 places in 211 ms of which 0 ms to minimize.
[2022-05-17 17:01:14] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 1 ms to minimize.
[2022-05-17 17:01:15] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 1 ms to minimize.
[2022-05-17 17:01:15] [INFO ] Deduced a trap composed of 81 places in 177 ms of which 1 ms to minimize.
[2022-05-17 17:01:15] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 0 ms to minimize.
[2022-05-17 17:01:15] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 1 ms to minimize.
[2022-05-17 17:01:16] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 1 ms to minimize.
[2022-05-17 17:01:16] [INFO ] Deduced a trap composed of 91 places in 202 ms of which 1 ms to minimize.
[2022-05-17 17:01:16] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 0 ms to minimize.
[2022-05-17 17:01:16] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2022-05-17 17:01:17] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 1 ms to minimize.
[2022-05-17 17:01:17] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:01:17] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 0 ms to minimize.
[2022-05-17 17:01:17] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:01:18] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 1 ms to minimize.
[2022-05-17 17:01:18] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:01:18] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2022-05-17 17:01:18] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 0 ms to minimize.
[2022-05-17 17:01:18] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:01:19] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:01:19] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 0 ms to minimize.
[2022-05-17 17:01:19] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 2 ms to minimize.
[2022-05-17 17:01:19] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 1 ms to minimize.
[2022-05-17 17:01:19] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 1 ms to minimize.
[2022-05-17 17:01:20] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:01:20] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 1 ms to minimize.
[2022-05-17 17:01:20] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:01:20] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:01:21] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:01:21] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 1 ms to minimize.
[2022-05-17 17:01:21] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:01:21] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 0 ms to minimize.
[2022-05-17 17:01:21] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 1 ms to minimize.
[2022-05-17 17:01:22] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:01:22] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:01:22] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 1 ms to minimize.
[2022-05-17 17:01:22] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 1 ms to minimize.
[2022-05-17 17:01:22] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 1 ms to minimize.
[2022-05-17 17:01:23] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2022-05-17 17:01:23] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 0 ms to minimize.
[2022-05-17 17:01:24] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 0 ms to minimize.
[2022-05-17 17:01:24] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 0 ms to minimize.
[2022-05-17 17:01:24] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 0 ms to minimize.
[2022-05-17 17:01:25] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:01:25] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 0 ms to minimize.
[2022-05-17 17:01:30] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 0 ms to minimize.
[2022-05-17 17:01:30] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 0 ms to minimize.
[2022-05-17 17:01:30] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 0 ms to minimize.
[2022-05-17 17:01:31] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 18834 ms
[2022-05-17 17:01:32] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:01:33] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 0 ms to minimize.
[2022-05-17 17:01:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3222 ms
[2022-05-17 17:01:45] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 0 ms to minimize.
[2022-05-17 17:01:45] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2022-05-17 17:01:45] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 0 ms to minimize.
[2022-05-17 17:01:46] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2022-05-17 17:01:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 910 ms
[2022-05-17 17:01:47] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 0 ms to minimize.
[2022-05-17 17:01:47] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 0 ms to minimize.
[2022-05-17 17:01:47] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:01:47] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2022-05-17 17:01:47] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2022-05-17 17:01:48] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2022-05-17 17:01:53] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2022-05-17 17:01:53] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2022-05-17 17:01:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7535 ms
[2022-05-17 17:01:56] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:01:57] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:01:58] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:01:59] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2022-05-17 17:02:00] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2022-05-17 17:02:01] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 0 ms to minimize.
[2022-05-17 17:02:01] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2022-05-17 17:02:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5148 ms
[2022-05-17 17:02:02] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:02:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2022-05-17 17:02:04] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 1 ms to minimize.
[2022-05-17 17:02:05] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2022-05-17 17:02:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 433 ms
[2022-05-17 17:02:05] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2022-05-17 17:02:05] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 1 ms to minimize.
[2022-05-17 17:02:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2022-05-17 17:02:06] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 0 ms to minimize.
[2022-05-17 17:02:06] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 0 ms to minimize.
[2022-05-17 17:02:06] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:02:07] [INFO ] Deduced a trap composed of 111 places in 192 ms of which 0 ms to minimize.
[2022-05-17 17:02:07] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 1 ms to minimize.
[2022-05-17 17:02:07] [INFO ] Deduced a trap composed of 87 places in 195 ms of which 1 ms to minimize.
[2022-05-17 17:02:07] [INFO ] Deduced a trap composed of 74 places in 193 ms of which 1 ms to minimize.
[2022-05-17 17:02:08] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2022-05-17 17:02:08] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 0 ms to minimize.
[2022-05-17 17:02:08] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 0 ms to minimize.
[2022-05-17 17:02:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2435 ms
[2022-05-17 17:02:08] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:02:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2022-05-17 17:02:09] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2022-05-17 17:02:09] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 1 ms to minimize.
[2022-05-17 17:02:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2022-05-17 17:02:09] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 0 ms to minimize.
[2022-05-17 17:02:10] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 0 ms to minimize.
[2022-05-17 17:02:10] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:02:10] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:02:10] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:02:10] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:02:11] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 0 ms to minimize.
[2022-05-17 17:02:11] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:02:11] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 0 ms to minimize.
[2022-05-17 17:02:11] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:02:11] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 1 ms to minimize.
[2022-05-17 17:02:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2628 ms
[2022-05-17 17:02:12] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 0 ms to minimize.
[2022-05-17 17:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 17:02:13] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2022-05-17 17:02:13] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2022-05-17 17:02:13] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 0 ms to minimize.
[2022-05-17 17:02:13] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 1 ms to minimize.
[2022-05-17 17:02:13] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 0 ms to minimize.
[2022-05-17 17:02:13] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 0 ms to minimize.
[2022-05-17 17:02:15] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:02:15] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2022-05-17 17:02:15] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:02:15] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 1 ms to minimize.
[2022-05-17 17:02:15] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 0 ms to minimize.
[2022-05-17 17:02:17] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2022-05-17 17:02:17] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2022-05-17 17:02:17] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 0 ms to minimize.
[2022-05-17 17:02:17] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 1 ms to minimize.
[2022-05-17 17:02:18] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 0 ms to minimize.
[2022-05-17 17:02:27] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 14818 ms
[2022-05-17 17:02:28] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-17 17:02:28] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2022-05-17 17:02:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2022-05-17 17:02:29] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 1 ms to minimize.
[2022-05-17 17:02:29] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:02:29] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:02:29] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 1 ms to minimize.
[2022-05-17 17:02:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 793 ms
[2022-05-17 17:02:30] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2022-05-17 17:02:30] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 0 ms to minimize.
[2022-05-17 17:02:30] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 1 ms to minimize.
[2022-05-17 17:02:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 586 ms
[2022-05-17 17:02:30] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 0 ms to minimize.
[2022-05-17 17:02:31] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 0 ms to minimize.
[2022-05-17 17:02:31] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 0 ms to minimize.
[2022-05-17 17:02:31] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 1 ms to minimize.
[2022-05-17 17:02:31] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 1 ms to minimize.
[2022-05-17 17:02:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 828 ms
[2022-05-17 17:02:31] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 0 ms to minimize.
[2022-05-17 17:02:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2022-05-17 17:02:32] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 1 ms to minimize.
[2022-05-17 17:02:33] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:02:33] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:02:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 673 ms
[2022-05-17 17:02:33] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:02:33] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2022-05-17 17:02:34] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 0 ms to minimize.
[2022-05-17 17:02:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2022-05-17 17:02:34] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:02:35] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:02:35] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 0 ms to minimize.
[2022-05-17 17:02:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 689 ms
[2022-05-17 17:02:35] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:02:35] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 1 ms to minimize.
[2022-05-17 17:02:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2022-05-17 17:02:36] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 0 ms to minimize.
[2022-05-17 17:02:36] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 0 ms to minimize.
[2022-05-17 17:02:36] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 0 ms to minimize.
[2022-05-17 17:02:36] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:02:37] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:02:37] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:02:37] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:02:37] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:02:37] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:02:37] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2022-05-17 17:02:38] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:02:38] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 0 ms to minimize.
[2022-05-17 17:02:38] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:02:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2429 ms
[2022-05-17 17:02:39] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 0 ms to minimize.
[2022-05-17 17:02:40] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 1 ms to minimize.
[2022-05-17 17:02:40] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:02:40] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2022-05-17 17:02:40] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 0 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 1 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 0 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 0 ms to minimize.
[2022-05-17 17:02:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2949 ms
[2022-05-17 17:02:42] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 1 ms to minimize.
[2022-05-17 17:02:42] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 0 ms to minimize.
[2022-05-17 17:02:43] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 0 ms to minimize.
[2022-05-17 17:02:43] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 0 ms to minimize.
[2022-05-17 17:02:44] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 0 ms to minimize.
[2022-05-17 17:02:44] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 1 ms to minimize.
[2022-05-17 17:02:44] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 0 ms to minimize.
[2022-05-17 17:02:44] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 0 ms to minimize.
[2022-05-17 17:02:44] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 0 ms to minimize.
[2022-05-17 17:02:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2277 ms
[2022-05-17 17:02:45] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 0 ms to minimize.
[2022-05-17 17:02:45] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2022-05-17 17:02:45] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:02:45] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2022-05-17 17:02:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 847 ms
[2022-05-17 17:02:47] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 1 ms to minimize.
[2022-05-17 17:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2022-05-17 17:02:47] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:02:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2022-05-17 17:02:49] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 0 ms to minimize.
[2022-05-17 17:02:49] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 0 ms to minimize.
[2022-05-17 17:02:49] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 0 ms to minimize.
[2022-05-17 17:02:49] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:02:49] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:02:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 927 ms
[2022-05-17 17:02:50] [INFO ] Deduced a trap composed of 61 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:02:50] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 0 ms to minimize.
[2022-05-17 17:02:50] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 1 ms to minimize.
[2022-05-17 17:02:50] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 1 ms to minimize.
[2022-05-17 17:02:50] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:02:51] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:02:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1175 ms
[2022-05-17 17:02:51] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:02:52] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2022-05-17 17:02:52] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:02:52] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:02:52] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 1 ms to minimize.
[2022-05-17 17:02:53] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
[2022-05-17 17:02:53] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 0 ms to minimize.
[2022-05-17 17:02:53] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 1 ms to minimize.
[2022-05-17 17:02:53] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 1 ms to minimize.
[2022-05-17 17:02:53] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:02:54] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 0 ms to minimize.
[2022-05-17 17:02:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 17:02:54] [INFO ] After 225116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:636
Fused 636 Parikh solutions to 605 different solutions.
Parikh walk visited 3 properties in 14104 ms.
Support contains 436 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 32 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1696/1696 transitions.
Interrupted random walk after 518608 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 629) seen :0
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 11142 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 629 properties.
[2022-05-17 17:03:49] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2022-05-17 17:03:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 17:03:55] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 17:04:22] [INFO ] After 33011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:629
[2022-05-17 17:04:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2022-05-17 17:04:52] [INFO ] After 18763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :629
[2022-05-17 17:04:52] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 17:05:15] [INFO ] After 23551ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :629
[2022-05-17 17:05:15] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2022-05-17 17:05:16] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2022-05-17 17:05:16] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2022-05-17 17:05:16] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2022-05-17 17:05:16] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2022-05-17 17:05:17] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2022-05-17 17:05:17] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2022-05-17 17:05:17] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2022-05-17 17:05:17] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:05:17] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 0 ms to minimize.
[2022-05-17 17:05:18] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:05:18] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2022-05-17 17:05:18] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2022-05-17 17:05:18] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2022-05-17 17:05:19] [INFO ] Deduced a trap composed of 41 places in 198 ms of which 0 ms to minimize.
[2022-05-17 17:05:19] [INFO ] Deduced a trap composed of 93 places in 181 ms of which 0 ms to minimize.
[2022-05-17 17:05:19] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 0 ms to minimize.
[2022-05-17 17:05:19] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:05:19] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 1 ms to minimize.
[2022-05-17 17:05:20] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 0 ms to minimize.
[2022-05-17 17:05:20] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:05:20] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:05:20] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:05:21] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:05:21] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:05:21] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:05:21] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:05:21] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:05:22] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:05:22] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:05:22] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2022-05-17 17:05:22] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:05:23] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 1 ms to minimize.
[2022-05-17 17:05:23] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 0 ms to minimize.
[2022-05-17 17:05:23] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 1 ms to minimize.
[2022-05-17 17:05:23] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:05:23] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:05:23] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2022-05-17 17:05:24] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2022-05-17 17:05:24] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 1 ms to minimize.
[2022-05-17 17:05:24] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 0 ms to minimize.
[2022-05-17 17:05:24] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:05:24] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2022-05-17 17:05:25] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 1 ms to minimize.
[2022-05-17 17:05:25] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:05:25] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2022-05-17 17:05:25] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:05:25] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:05:26] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 0 ms to minimize.
[2022-05-17 17:05:26] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2022-05-17 17:05:26] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2022-05-17 17:05:26] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2022-05-17 17:05:26] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2022-05-17 17:05:26] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2022-05-17 17:05:27] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:05:27] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:05:27] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:05:27] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 1 ms to minimize.
[2022-05-17 17:05:27] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2022-05-17 17:05:28] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2022-05-17 17:05:28] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:05:28] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:05:28] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:05:28] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 1 ms to minimize.
[2022-05-17 17:05:29] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:05:29] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 1 ms to minimize.
[2022-05-17 17:05:29] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:05:29] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2022-05-17 17:05:29] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:05:29] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 0 ms to minimize.
[2022-05-17 17:05:30] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:05:30] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2022-05-17 17:05:30] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:05:31] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 0 ms to minimize.
[2022-05-17 17:05:31] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 0 ms to minimize.
[2022-05-17 17:05:31] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2022-05-17 17:05:31] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:05:32] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 1 ms to minimize.
[2022-05-17 17:05:32] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:05:32] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:05:33] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:05:33] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 1 ms to minimize.
[2022-05-17 17:05:33] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2022-05-17 17:05:33] [INFO ] Trap strengthening (SAT) tested/added 84/83 trap constraints in 18320 ms
[2022-05-17 17:05:34] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 0 ms to minimize.
[2022-05-17 17:05:34] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2022-05-17 17:05:34] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 0 ms to minimize.
[2022-05-17 17:05:35] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2022-05-17 17:05:35] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2022-05-17 17:05:35] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2022-05-17 17:05:35] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 0 ms to minimize.
[2022-05-17 17:05:36] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2022-05-17 17:05:36] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 0 ms to minimize.
[2022-05-17 17:05:36] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 1 ms to minimize.
[2022-05-17 17:05:36] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2022-05-17 17:05:37] [INFO ] Deduced a trap composed of 80 places in 191 ms of which 0 ms to minimize.
[2022-05-17 17:05:37] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:05:37] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 1 ms to minimize.
[2022-05-17 17:05:37] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 0 ms to minimize.
[2022-05-17 17:05:38] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:05:38] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:05:38] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 0 ms to minimize.
[2022-05-17 17:05:38] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 0 ms to minimize.
[2022-05-17 17:05:39] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 0 ms to minimize.
[2022-05-17 17:05:39] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:05:39] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 0 ms to minimize.
[2022-05-17 17:05:39] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2022-05-17 17:05:40] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 0 ms to minimize.
[2022-05-17 17:05:40] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:05:40] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:05:40] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 0 ms to minimize.
[2022-05-17 17:05:41] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 1 ms to minimize.
[2022-05-17 17:05:41] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 0 ms to minimize.
[2022-05-17 17:05:41] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 0 ms to minimize.
[2022-05-17 17:05:41] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 0 ms to minimize.
[2022-05-17 17:05:42] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 1 ms to minimize.
[2022-05-17 17:05:42] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 1 ms to minimize.
[2022-05-17 17:05:42] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2022-05-17 17:05:42] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 1 ms to minimize.
[2022-05-17 17:05:42] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 0 ms to minimize.
[2022-05-17 17:05:43] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 1 ms to minimize.
[2022-05-17 17:05:43] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:05:43] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2022-05-17 17:05:43] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2022-05-17 17:05:43] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2022-05-17 17:05:43] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:05:44] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 0 ms to minimize.
[2022-05-17 17:05:44] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 1 ms to minimize.
[2022-05-17 17:05:44] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2022-05-17 17:05:44] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:05:44] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:05:45] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 0 ms to minimize.
[2022-05-17 17:05:45] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 1 ms to minimize.
[2022-05-17 17:05:45] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:05:45] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:05:45] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 0 ms to minimize.
[2022-05-17 17:05:45] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:05:46] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 0 ms to minimize.
[2022-05-17 17:05:46] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:05:46] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:05:48] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-05-17 17:05:48] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2022-05-17 17:05:48] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2022-05-17 17:05:48] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2022-05-17 17:05:48] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 1 ms to minimize.
[2022-05-17 17:05:49] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2022-05-17 17:05:49] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:05:51] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:05:51] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:05:51] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:05:52] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 0 ms to minimize.
[2022-05-17 17:05:53] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2022-05-17 17:05:53] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 18948 ms
[2022-05-17 17:05:53] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:05:54] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 1 ms to minimize.
[2022-05-17 17:05:54] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2022-05-17 17:05:54] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 0 ms to minimize.
[2022-05-17 17:05:54] [INFO ] Deduced a trap composed of 29 places in 171 ms of which 0 ms to minimize.
[2022-05-17 17:05:55] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:05:55] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 1 ms to minimize.
[2022-05-17 17:05:55] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 0 ms to minimize.
[2022-05-17 17:05:57] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 1 ms to minimize.
[2022-05-17 17:05:57] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2022-05-17 17:05:58] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:05:58] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 1 ms to minimize.
[2022-05-17 17:05:58] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 1 ms to minimize.
[2022-05-17 17:05:58] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:05:59] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:05:59] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:05:59] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2022-05-17 17:05:59] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2022-05-17 17:05:59] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:06:00] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:06:00] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 0 ms to minimize.
[2022-05-17 17:06:00] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:06:00] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 0 ms to minimize.
[2022-05-17 17:06:00] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2022-05-17 17:06:01] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 1 ms to minimize.
[2022-05-17 17:06:02] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2022-05-17 17:06:03] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 0 ms to minimize.
[2022-05-17 17:06:03] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2022-05-17 17:06:03] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2022-05-17 17:06:03] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 0 ms to minimize.
[2022-05-17 17:06:04] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 0 ms to minimize.
[2022-05-17 17:06:04] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:06:04] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 0 ms to minimize.
[2022-05-17 17:06:04] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:06:05] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 0 ms to minimize.
[2022-05-17 17:06:05] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 0 ms to minimize.
[2022-05-17 17:06:05] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 0 ms to minimize.
[2022-05-17 17:06:05] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2022-05-17 17:06:06] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2022-05-17 17:06:06] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2022-05-17 17:06:06] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2022-05-17 17:06:06] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2022-05-17 17:06:10] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 16386 ms
[2022-05-17 17:06:10] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:06:10] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2022-05-17 17:06:10] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2022-05-17 17:06:11] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2022-05-17 17:06:11] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:06:11] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2022-05-17 17:06:11] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:06:12] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 0 ms to minimize.
[2022-05-17 17:06:12] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 1 ms to minimize.
[2022-05-17 17:06:12] [INFO ] Deduced a trap composed of 55 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:06:12] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 1 ms to minimize.
[2022-05-17 17:06:12] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:06:13] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:06:13] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:06:13] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:06:13] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 1 ms to minimize.
[2022-05-17 17:06:14] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 0 ms to minimize.
[2022-05-17 17:06:14] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:06:14] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 1 ms to minimize.
[2022-05-17 17:06:14] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:06:14] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2022-05-17 17:06:15] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2022-05-17 17:06:15] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:06:15] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:06:15] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:06:15] [INFO ] Deduced a trap composed of 44 places in 143 ms of which 1 ms to minimize.
[2022-05-17 17:06:16] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2022-05-17 17:06:16] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 1 ms to minimize.
[2022-05-17 17:06:16] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:06:16] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2022-05-17 17:06:16] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 0 ms to minimize.
[2022-05-17 17:06:16] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 0 ms to minimize.
[2022-05-17 17:06:17] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:06:17] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:06:17] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 0 ms to minimize.
[2022-05-17 17:06:17] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 0 ms to minimize.
[2022-05-17 17:06:17] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 0 ms to minimize.
[2022-05-17 17:06:18] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2022-05-17 17:06:18] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
[2022-05-17 17:06:18] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 0 ms to minimize.
[2022-05-17 17:06:18] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 0 ms to minimize.
[2022-05-17 17:06:18] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 0 ms to minimize.
[2022-05-17 17:06:18] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 8631 ms
[2022-05-17 17:06:19] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:06:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2022-05-17 17:06:20] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 0 ms to minimize.
[2022-05-17 17:06:20] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 0 ms to minimize.
[2022-05-17 17:06:21] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:06:21] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2022-05-17 17:06:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8670 ms
[2022-05-17 17:06:29] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 1 ms to minimize.
[2022-05-17 17:06:29] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2022-05-17 17:06:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 494 ms
[2022-05-17 17:06:36] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 0 ms to minimize.
[2022-05-17 17:06:37] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2022-05-17 17:06:37] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 1 ms to minimize.
[2022-05-17 17:06:37] [INFO ] Deduced a trap composed of 79 places in 187 ms of which 0 ms to minimize.
[2022-05-17 17:06:37] [INFO ] Deduced a trap composed of 88 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:06:38] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 0 ms to minimize.
[2022-05-17 17:06:38] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 0 ms to minimize.
[2022-05-17 17:06:38] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 0 ms to minimize.
[2022-05-17 17:06:38] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 0 ms to minimize.
[2022-05-17 17:06:38] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 0 ms to minimize.
[2022-05-17 17:06:39] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 0 ms to minimize.
[2022-05-17 17:06:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2893 ms
[2022-05-17 17:06:42] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2022-05-17 17:06:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2022-05-17 17:06:43] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
[2022-05-17 17:06:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2046 ms
[2022-05-17 17:06:45] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:06:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2022-05-17 17:06:46] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:06:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2022-05-17 17:06:47] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2022-05-17 17:06:47] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 0 ms to minimize.
[2022-05-17 17:06:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2022-05-17 17:06:48] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2022-05-17 17:06:48] [INFO ] Deduced a trap composed of 77 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:06:48] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:06:48] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:06:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 975 ms
[2022-05-17 17:06:49] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 0 ms to minimize.
[2022-05-17 17:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-05-17 17:06:49] [INFO ] Deduced a trap composed of 95 places in 191 ms of which 1 ms to minimize.
[2022-05-17 17:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2022-05-17 17:06:50] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2022-05-17 17:06:50] [INFO ] Deduced a trap composed of 101 places in 195 ms of which 0 ms to minimize.
[2022-05-17 17:06:50] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 0 ms to minimize.
[2022-05-17 17:06:50] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 0 ms to minimize.
[2022-05-17 17:06:51] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 0 ms to minimize.
[2022-05-17 17:06:51] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 1 ms to minimize.
[2022-05-17 17:06:51] [INFO ] Deduced a trap composed of 99 places in 196 ms of which 1 ms to minimize.
[2022-05-17 17:06:51] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 1 ms to minimize.
[2022-05-17 17:06:52] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 0 ms to minimize.
[2022-05-17 17:06:52] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:06:52] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 0 ms to minimize.
[2022-05-17 17:06:52] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2022-05-17 17:06:52] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
[2022-05-17 17:06:53] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:06:53] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 1 ms to minimize.
[2022-05-17 17:06:53] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 0 ms to minimize.
[2022-05-17 17:06:53] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:06:54] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 0 ms to minimize.
[2022-05-17 17:06:54] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:06:54] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:06:54] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:06:54] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 0 ms to minimize.
[2022-05-17 17:06:55] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:06:55] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 1 ms to minimize.
[2022-05-17 17:06:55] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 1 ms to minimize.
[2022-05-17 17:06:55] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5603 ms
[2022-05-17 17:06:56] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:06:56] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 1 ms to minimize.
[2022-05-17 17:06:56] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 0 ms to minimize.
[2022-05-17 17:06:56] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 0 ms to minimize.
[2022-05-17 17:06:57] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 0 ms to minimize.
[2022-05-17 17:06:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 924 ms
[2022-05-17 17:06:57] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2022-05-17 17:06:57] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 0 ms to minimize.
[2022-05-17 17:06:57] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 0 ms to minimize.
[2022-05-17 17:06:58] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2022-05-17 17:06:58] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 0 ms to minimize.
[2022-05-17 17:06:58] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 0 ms to minimize.
[2022-05-17 17:06:58] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 0 ms to minimize.
[2022-05-17 17:06:58] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2022-05-17 17:06:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1284 ms
[2022-05-17 17:06:59] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 1 ms to minimize.
[2022-05-17 17:07:00] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:07:00] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2022-05-17 17:07:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 696 ms
[2022-05-17 17:07:00] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2022-05-17 17:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 17:07:02] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 1 ms to minimize.
[2022-05-17 17:07:02] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 0 ms to minimize.
[2022-05-17 17:07:02] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 0 ms to minimize.
[2022-05-17 17:07:02] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:07:02] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 0 ms to minimize.
[2022-05-17 17:07:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 946 ms
[2022-05-17 17:07:03] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 0 ms to minimize.
[2022-05-17 17:07:04] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 1 ms to minimize.
[2022-05-17 17:07:12] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 1 ms to minimize.
[2022-05-17 17:07:13] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2022-05-17 17:07:13] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 1 ms to minimize.
[2022-05-17 17:07:13] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 0 ms to minimize.
[2022-05-17 17:07:13] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 1 ms to minimize.
[2022-05-17 17:07:13] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 0 ms to minimize.
[2022-05-17 17:07:14] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:07:14] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 1 ms to minimize.
[2022-05-17 17:07:14] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 1 ms to minimize.
[2022-05-17 17:07:14] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 0 ms to minimize.
[2022-05-17 17:07:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 10966 ms
[2022-05-17 17:07:14] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:07:15] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 0 ms to minimize.
[2022-05-17 17:07:15] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 0 ms to minimize.
[2022-05-17 17:07:15] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2022-05-17 17:07:15] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 0 ms to minimize.
[2022-05-17 17:07:16] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 1 ms to minimize.
[2022-05-17 17:07:16] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:07:16] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 1 ms to minimize.
[2022-05-17 17:07:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1798 ms
[2022-05-17 17:07:17] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2022-05-17 17:07:17] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 0 ms to minimize.
[2022-05-17 17:07:17] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 0 ms to minimize.
[2022-05-17 17:07:17] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 0 ms to minimize.
[2022-05-17 17:07:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 634 ms
[2022-05-17 17:07:17] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 0 ms to minimize.
[2022-05-17 17:07:18] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:07:18] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 0 ms to minimize.
[2022-05-17 17:07:18] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 0 ms to minimize.
[2022-05-17 17:07:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 800 ms
[2022-05-17 17:07:18] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 0 ms to minimize.
[2022-05-17 17:07:18] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 0 ms to minimize.
[2022-05-17 17:07:19] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 1 ms to minimize.
[2022-05-17 17:07:20] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:07:20] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 0 ms to minimize.
[2022-05-17 17:07:20] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2022-05-17 17:07:20] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 1 ms to minimize.
[2022-05-17 17:07:20] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 0 ms to minimize.
[2022-05-17 17:07:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2485 ms
[2022-05-17 17:07:21] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 0 ms to minimize.
[2022-05-17 17:07:22] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 1 ms to minimize.
[2022-05-17 17:07:22] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 0 ms to minimize.
[2022-05-17 17:07:22] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 0 ms to minimize.
[2022-05-17 17:07:22] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 0 ms to minimize.
[2022-05-17 17:07:22] [INFO ] Deduced a trap composed of 69 places in 154 ms of which 1 ms to minimize.
[2022-05-17 17:07:23] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 0 ms to minimize.
[2022-05-17 17:07:23] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 1 ms to minimize.
[2022-05-17 17:07:23] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 1 ms to minimize.
[2022-05-17 17:07:23] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 1 ms to minimize.
[2022-05-17 17:07:23] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 1 ms to minimize.
[2022-05-17 17:07:23] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 0 ms to minimize.
[2022-05-17 17:07:24] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 0 ms to minimize.
[2022-05-17 17:07:24] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2022-05-17 17:07:24] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 0 ms to minimize.
[2022-05-17 17:07:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3557 ms
[2022-05-17 17:07:26] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 0 ms to minimize.
[2022-05-17 17:07:26] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 0 ms to minimize.
[2022-05-17 17:07:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 383 ms
[2022-05-17 17:07:28] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 1 ms to minimize.
[2022-05-17 17:07:28] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 0 ms to minimize.
[2022-05-17 17:07:28] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2022-05-17 17:07:28] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 0 ms to minimize.
[2022-05-17 17:07:28] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 0 ms to minimize.
[2022-05-17 17:07:29] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 0 ms to minimize.
[2022-05-17 17:07:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1072 ms
[2022-05-17 17:07:29] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 0 ms to minimize.
[2022-05-17 17:07:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 17:07:31] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 0 ms to minimize.
[2022-05-17 17:07:31] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 1 ms to minimize.
[2022-05-17 17:07:32] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 0 ms to minimize.
[2022-05-17 17:07:32] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:07:32] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2022-05-17 17:07:32] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:07:32] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 0 ms to minimize.
[2022-05-17 17:07:32] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 0 ms to minimize.
[2022-05-17 17:07:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1387 ms
[2022-05-17 17:07:34] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2022-05-17 17:07:34] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 0 ms to minimize.
[2022-05-17 17:07:34] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2022-05-17 17:07:35] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 0 ms to minimize.
[2022-05-17 17:07:35] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:07:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1049 ms
[2022-05-17 17:07:35] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 1 ms to minimize.
[2022-05-17 17:07:36] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 0 ms to minimize.
[2022-05-17 17:07:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2022-05-17 17:07:36] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 1 ms to minimize.
[2022-05-17 17:07:37] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 1 ms to minimize.
[2022-05-17 17:07:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2022-05-17 17:07:37] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:07:37] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 0 ms to minimize.
[2022-05-17 17:07:37] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 0 ms to minimize.
[2022-05-17 17:07:37] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 1 ms to minimize.
[2022-05-17 17:07:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 934 ms
[2022-05-17 17:07:38] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 1 ms to minimize.
[2022-05-17 17:07:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 17:07:38] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:07:38] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 1 ms to minimize.
[2022-05-17 17:07:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2022-05-17 17:07:39] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 0 ms to minimize.
[2022-05-17 17:07:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 17:07:40] [INFO ] Deduced a trap composed of 135 places in 165 ms of which 1 ms to minimize.
[2022-05-17 17:07:40] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 1 ms to minimize.
[2022-05-17 17:07:40] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 1 ms to minimize.
[2022-05-17 17:07:40] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 1 ms to minimize.
[2022-05-17 17:07:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 863 ms
[2022-05-17 17:07:42] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 0 ms to minimize.
[2022-05-17 17:07:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 17:07:43] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 1 ms to minimize.
[2022-05-17 17:07:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-17 17:07:43] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:07:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-05-17 17:07:44] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 1 ms to minimize.
[2022-05-17 17:07:44] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2022-05-17 17:07:44] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 0 ms to minimize.
[2022-05-17 17:07:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 553 ms
[2022-05-17 17:07:45] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:07:45] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 1 ms to minimize.
[2022-05-17 17:07:45] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 1 ms to minimize.
[2022-05-17 17:07:45] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 0 ms to minimize.
[2022-05-17 17:07:46] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 1 ms to minimize.
[2022-05-17 17:07:46] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 0 ms to minimize.
[2022-05-17 17:07:46] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2022-05-17 17:07:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1676 ms
[2022-05-17 17:07:47] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 0 ms to minimize.
[2022-05-17 17:07:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2022-05-17 17:07:47] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 1 ms to minimize.
[2022-05-17 17:07:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2022-05-17 17:07:49] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 0 ms to minimize.
[2022-05-17 17:07:49] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 1 ms to minimize.
[2022-05-17 17:07:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2022-05-17 17:07:50] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2022-05-17 17:07:50] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2022-05-17 17:07:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2022-05-17 17:07:51] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2022-05-17 17:07:51] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2022-05-17 17:07:51] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 0 ms to minimize.
[2022-05-17 17:07:52] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 1 ms to minimize.
[2022-05-17 17:07:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 818 ms
[2022-05-17 17:07:53] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2022-05-17 17:07:54] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 1 ms to minimize.
[2022-05-17 17:07:55] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 0 ms to minimize.
[2022-05-17 17:07:55] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:07:55] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 1 ms to minimize.
[2022-05-17 17:07:55] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:07:56] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2022-05-17 17:07:56] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 0 ms to minimize.
[2022-05-17 17:07:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1574 ms
[2022-05-17 17:07:58] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:07:58] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 0 ms to minimize.
[2022-05-17 17:07:58] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 0 ms to minimize.
[2022-05-17 17:07:58] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 0 ms to minimize.
[2022-05-17 17:07:59] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 0 ms to minimize.
[2022-05-17 17:07:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1108 ms
[2022-05-17 17:08:00] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 1 ms to minimize.
[2022-05-17 17:08:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2022-05-17 17:08:01] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 0 ms to minimize.
[2022-05-17 17:08:01] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 0 ms to minimize.
[2022-05-17 17:08:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 963 ms
[2022-05-17 17:08:07] [INFO ] After 195879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :628
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 17:08:07] [INFO ] After 225020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :628
Fused 629 Parikh solutions to 591 different solutions.
Parikh walk visited 2 properties in 17552 ms.
Support contains 432 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1696/1696 transitions.
Interrupted random walk after 432091 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 615) 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 615) seen :0
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 12456 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 615 properties.
[2022-05-17 17:09:08] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2022-05-17 17:09:08] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 17:09:13] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2022-05-17 17:09:44] [INFO ] After 36120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:615
[2022-05-17 17:09:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2022-05-17 17:10:15] [INFO ] After 21000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :615
[2022-05-17 17:10:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 17:10:41] [INFO ] After 25217ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :615
[2022-05-17 17:10:41] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:10:41] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 1 ms to minimize.
[2022-05-17 17:10:41] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 0 ms to minimize.
[2022-05-17 17:10:42] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2022-05-17 17:10:42] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 0 ms to minimize.
[2022-05-17 17:10:42] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 1 ms to minimize.
[2022-05-17 17:10:42] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 0 ms to minimize.
[2022-05-17 17:10:43] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:10:43] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 1 ms to minimize.
[2022-05-17 17:10:43] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2022-05-17 17:10:43] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2022-05-17 17:10:43] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 0 ms to minimize.
[2022-05-17 17:10:44] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:10:44] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:10:44] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2022-05-17 17:10:44] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 0 ms to minimize.
[2022-05-17 17:10:44] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:10:45] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 0 ms to minimize.
[2022-05-17 17:10:45] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:10:45] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 0 ms to minimize.
[2022-05-17 17:10:45] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:10:46] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 1 ms to minimize.
[2022-05-17 17:10:46] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2022-05-17 17:10:46] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 0 ms to minimize.
[2022-05-17 17:10:46] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2022-05-17 17:10:46] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:10:47] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 1 ms to minimize.
[2022-05-17 17:10:47] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 1 ms to minimize.
[2022-05-17 17:10:47] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:10:47] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2022-05-17 17:10:47] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2022-05-17 17:10:48] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:10:48] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:10:48] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 0 ms to minimize.
[2022-05-17 17:10:48] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2022-05-17 17:10:48] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 0 ms to minimize.
[2022-05-17 17:10:49] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 0 ms to minimize.
[2022-05-17 17:10:49] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2022-05-17 17:10:49] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 0 ms to minimize.
[2022-05-17 17:10:49] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 0 ms to minimize.
[2022-05-17 17:10:49] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 1 ms to minimize.
[2022-05-17 17:10:50] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:10:50] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 0 ms to minimize.
[2022-05-17 17:10:50] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 1 ms to minimize.
[2022-05-17 17:10:50] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:10:51] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 1 ms to minimize.
[2022-05-17 17:10:51] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 0 ms to minimize.
[2022-05-17 17:10:51] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 1 ms to minimize.
[2022-05-17 17:10:51] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 0 ms to minimize.
[2022-05-17 17:10:51] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 0 ms to minimize.
[2022-05-17 17:10:51] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 0 ms to minimize.
[2022-05-17 17:10:52] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2022-05-17 17:10:52] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 0 ms to minimize.
[2022-05-17 17:10:52] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2022-05-17 17:10:53] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 0 ms to minimize.
[2022-05-17 17:10:53] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 1 ms to minimize.
[2022-05-17 17:10:53] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.

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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination Liveness -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-7"
export BK_EXAMINATION="Liveness"
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-7, examination is Liveness"
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-165277023900059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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