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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 230K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 935K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 857K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 96K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 275K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K 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 877K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652805003748

Running Version 202205111006
[2022-05-17 16:30:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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:30:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:30:05] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-05-17 16:30:05] [INFO ] Transformed 1330 places.
[2022-05-17 16:30:05] [INFO ] Transformed 2030 transitions.
[2022-05-17 16:30:05] [INFO ] Found NUPN structural information;
[2022-05-17 16:30:05] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2022-05-17 16:30:05] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 279 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 4 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 153 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2022-05-17 16:30:05] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2022-05-17 16:30:05] [INFO ] Computed 27 place invariants in 29 ms
[2022-05-17 16:30:05] [INFO ] Implicit Places using invariants in 504 ms returned [387, 388, 390, 398, 399, 400, 401]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 532 ms to find 7 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 399/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 18 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 399/1330 places, 1106/2030 transitions.
Discarding 7 transitions out of 1106. Remains 1099
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1126 ms. (steps per millisecond=8 ) properties (out of 1099) seen :447
Running SMT prover for 651 properties.
[2022-05-17 16:30:07] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:30:07] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 16:30:13] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:30:32] [INFO ] After 14971ms SMT Verify possible using state equation in real domain returned unsat :0 sat :188 real:463
[2022-05-17 16:30:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:30:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 16:30:32] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 651 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 367 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 52 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 365826 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 63
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 588) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 577) 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 576) 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 574) 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 571) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 567) 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 567) 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 564) 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 564) 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 559) 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 556) 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 553) 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 553) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 549) 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 549) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 545) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 541) 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 540) 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 537) 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 537) 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 537) 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 537) 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 537) 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 537) 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 536) 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 536) 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 536) 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 536) 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 536) 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 535) 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 535) 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 535) 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 535) 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 534) 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 529) 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 529) 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 528) 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 528) 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 528) 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 528) 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 528) 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 528) 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 528) 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 526) 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 526) 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 526) 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 526) 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 526) 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 526) 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 526) 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 526) 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 526) 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 526) 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 525) 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 525) 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 525) 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 525) 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 525) 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 525) 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 525) 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 525) 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 525) 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 523) 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 521) 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 521) 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 521) 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 521) 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 519) 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 519) 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 519) 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 519) 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 519) 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 519) 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 518) 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 518) 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 518) 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 516) 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 516) 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 516) 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 514) 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 514) 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 514) 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 514) 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 512) 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 512) 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 512) 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 512) 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 512) 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 510) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 509) 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 508) 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 508) 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 508) 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 508) 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 508) 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 508) 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 508) 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 508) 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 508) 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 507) 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 507) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 507) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 507) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 506) 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 504) 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 504) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 503) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 502) 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 502) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) 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 502) seen :0
Running SMT prover for 502 properties.
[2022-05-17 16:31:04] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:31:04] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:31:08] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-05-17 16:31:25] [INFO ] After 21035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:502
[2022-05-17 16:31:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2022-05-17 16:31:44] [INFO ] After 12524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :502
[2022-05-17 16:31:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:31:58] [INFO ] After 14376ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :502
[2022-05-17 16:31:59] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 5 ms to minimize.
[2022-05-17 16:31:59] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2022-05-17 16:31:59] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 2 ms to minimize.
[2022-05-17 16:31:59] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 1 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2022-05-17 16:32:00] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 11 places in 532 ms of which 0 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 1 ms to minimize.
[2022-05-17 16:32:01] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 0 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:32:02] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:32:03] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:04] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5825 ms
[2022-05-17 16:32:04] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:05] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2152 ms
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2022-05-17 16:32:07] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:32:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1950 ms
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 7 ms to minimize.
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:32:09] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1282 ms
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Deduced a trap composed of 61 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:32:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 709 ms
[2022-05-17 16:32:11] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2022-05-17 16:32:11] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 2 ms to minimize.
[2022-05-17 16:32:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2022-05-17 16:32:11] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 5 ms to minimize.
[2022-05-17 16:32:11] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:32:12] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:12] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:32:12] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:32:12] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:32:12] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:32:12] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:32:12] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1646 ms
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:32:13] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:32:14] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:32:15] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:32:15] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:32:15] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:32:15] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
[2022-05-17 16:32:15] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:32:16] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 0 ms to minimize.
[2022-05-17 16:32:17] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 4517 ms
[2022-05-17 16:32:18] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:32:18] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:32:18] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:32:18] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:32:18] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1181 ms
[2022-05-17 16:32:19] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:32:19] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:32:20] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:32:20] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:32:20] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:32:20] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:32:20] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:32:20] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:32:20] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:32:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1685 ms
[2022-05-17 16:32:21] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:21] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:32:21] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:21] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:21] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:32:22] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:32:22] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:32:22] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:32:22] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:32:22] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:32:22] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:32:23] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:32:23] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:23] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:32:23] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:32:23] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:32:24] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:32:24] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:32:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4276 ms
[2022-05-17 16:32:25] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:32:25] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:32:26] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:32:26] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:32:26] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:32:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 829 ms
[2022-05-17 16:32:26] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:32:26] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:32:27] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:32:27] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:32:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 680 ms
[2022-05-17 16:32:28] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1220 ms
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:32:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:32:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 964 ms
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:32:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:32:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 534 ms
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:32:33] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:32:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1668 ms
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2022-05-17 16:32:35] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:32:36] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:32:40] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7302 ms
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:32:43] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 45 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:32:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1254 ms
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:32:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2022-05-17 16:32:45] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:32:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 501 ms
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:32:47] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:32:48] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:32:49] [INFO ] Deduced a trap composed of 54 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6891 ms
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:32:54] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 0 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:32:55] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 9699 ms
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:33:04] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:33:05] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:33:06] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:33:06] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:33:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1809 ms
[2022-05-17 16:33:06] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:07] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:33:08] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:33:08] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 0 ms to minimize.
[2022-05-17 16:33:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1089 ms
[2022-05-17 16:33:08] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:33:09] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:33:09] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:33:09] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:33:09] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:33:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1184 ms
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:33:10] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:33:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 727 ms
[2022-05-17 16:33:11] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:33:12] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:33:12] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:33:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:33:13] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:33:14] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:33:14] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 1 ms to minimize.
[2022-05-17 16:33:14] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:33:14] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:33:17] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:33:17] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5481 ms
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:33:18] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 3 ms to minimize.
[2022-05-17 16:33:24] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:33:24] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:33:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 6347 ms
[2022-05-17 16:33:25] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:33:25] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:33:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 387 ms
[2022-05-17 16:33:27] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:33:27] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:33:27] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:33:27] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:33:28] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:33:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 859 ms
[2022-05-17 16:33:28] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:33:29] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:33:30] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:33:39] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 10079 ms
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:33:41] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:33:42] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 516 ms
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:33:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:33:44] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:33:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1039 ms
[2022-05-17 16:33:45] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:33:46] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:33:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:33:47] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 519 ms
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:33:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 570 ms
[2022-05-17 16:33:49] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-17 16:33:50] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:33:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:33:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 477 ms
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:33:53] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1178 ms
[2022-05-17 16:33:54] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 16:33:55] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-17 16:33:56] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:33:57] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:33:58] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2022-05-17 16:33:59] [INFO ] Deduced a trap composed of 46 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2022-05-17 16:34:00] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-17 16:34:01] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:34:02] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 757 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-17 16:34:03] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:34:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 599 ms
[2022-05-17 16:34:05] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:34:06] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 716 ms
[2022-05-17 16:34:07] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:34:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 16:34:08] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2022-05-17 16:34:10] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:34:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2022-05-17 16:34:12] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:34:13] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-17 16:34:15] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:34:16] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1775 ms
[2022-05-17 16:34:17] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 356 ms
[2022-05-17 16:34:19] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:34:20] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:34:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:34:24] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:34:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:34:25] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 833 ms
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2022-05-17 16:34:28] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:34:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:34:47] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:34:48] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:34:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:34:49] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:34:50] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:34:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 829 ms
[2022-05-17 16:34:51] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 0 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:34:52] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:34:53] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:34:53] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:34:53] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:34:53] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1963 ms
[2022-05-17 16:34:56] [INFO ] After 191963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :500
Attempting to minimize the solution found.
Minimization took 14563 ms.
[2022-05-17 16:35:10] [INFO ] After 225012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :499
Fused 502 Parikh solutions to 475 different solutions.
Parikh walk visited 5 properties in 6916 ms.
Support contains 310 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 25 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 479305 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 465) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 459) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 458) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 454) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 454) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 454) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 454) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 454) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 454) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 444) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 433) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 427) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 417) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 412) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 412) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 410) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 407) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 405) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 403) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 400) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 400) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 398) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 394) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 392) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 391) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 389) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 389) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 388) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 381) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 380) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 378) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 378) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 377) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 376) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 376) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 376) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 375) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 373) seen :0
Running SMT prover for 373 properties.
[2022-05-17 16:35:56] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:35:56] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:35:58] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:36:11] [INFO ] After 10206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :11 real:362
[2022-05-17 16:36:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:36:11] [INFO ] After 420ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:373
[2022-05-17 16:36:11] [INFO ] After 15245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:373
[2022-05-17 16:36:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 18 ms returned sat
[2022-05-17 16:36:25] [INFO ] After 9315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :373
[2022-05-17 16:36:36] [INFO ] After 10725ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :373
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:36:36] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:36:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1430 ms
[2022-05-17 16:36:38] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:36:38] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:36:38] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:36:38] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:36:38] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:36:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 850 ms
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:36:39] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:36:40] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 33 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:36:41] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3082 ms
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:36:42] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1541 ms
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:36:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2022-05-17 16:36:43] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:36:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:36:45] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:36:46] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2381 ms
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:36:47] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 5 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:36:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1596 ms
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:36:49] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:36:50] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:36:50] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:36:50] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:36:50] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:36:50] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:36:50] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:36:50] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:36:51] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:36:51] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:36:51] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:36:51] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:36:51] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:36:51] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:36:51] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:36:52] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 12 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4205 ms
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:53] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:36:54] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:36:54] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:36:54] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:36:54] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:36:54] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:36:55] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:36:55] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:36:55] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:36:55] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:36:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2291 ms
[2022-05-17 16:36:55] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:36:55] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:36:56] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:36:56] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:36:56] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:36:56] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:36:56] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:36:56] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:36:57] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:36:57] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:36:57] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:36:57] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:36:57] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:36:57] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:36:58] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:36:58] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:36:58] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:36:58] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:36:58] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:36:58] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:36:58] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:36:59] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:36:59] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:36:59] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:36:59] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:36:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3986 ms
[2022-05-17 16:36:59] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-17 16:37:00] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:37:00] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:37:00] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:37:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 370 ms
[2022-05-17 16:37:00] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:37:00] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:00] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:01] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:01] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:01] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:01] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:37:01] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:37:01] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1377 ms
[2022-05-17 16:37:01] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:37:02] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:37:02] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:02] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:37:02] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:37:02] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:37:02] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:37:02] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:37:03] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 1 ms to minimize.
[2022-05-17 16:37:03] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:37:03] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:37:03] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:37:03] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:37:03] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:37:03] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:37:04] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:37:04] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:37:04] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2456 ms
[2022-05-17 16:37:04] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:37:04] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:37:04] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:04] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:37:05] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:05] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:05] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:37:05] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:37:05] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:37:05] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:37:05] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:37:06] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:37:06] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2080 ms
[2022-05-17 16:37:06] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:37:06] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:37:06] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:37:06] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 820 ms
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2022-05-17 16:37:07] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:37:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 491 ms
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:08] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2022-05-17 16:37:09] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:37:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 416 ms
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:37:10] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1110 ms
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:37:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2022-05-17 16:37:11] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:37:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:37:13] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:37:14] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2205 ms
[2022-05-17 16:37:15] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:37:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:37:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 652 ms
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:37:17] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:37:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1234 ms
[2022-05-17 16:37:18] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:37:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:37:19] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2022-05-17 16:37:20] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:37:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:37:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 617 ms
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:37:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:37:24] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:37:25] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:37:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1295 ms
[2022-05-17 16:37:27] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:37:27] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 785 ms
[2022-05-17 16:37:28] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:37:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:29] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:37:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 750 ms
[2022-05-17 16:37:30] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 697 ms
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:37:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-17 16:37:31] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 618 ms
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 506 ms
[2022-05-17 16:37:33] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:37:33] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2022-05-17 16:37:34] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:37:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:37:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 521 ms
[2022-05-17 16:37:37] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:37:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:37:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 519 ms
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:37:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:37:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2022-05-17 16:37:43] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:37:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2022-05-17 16:37:44] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:37:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:37:45] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:37:47] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:37:47] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:37:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 438 ms
[2022-05-17 16:37:48] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:37:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:37:48] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:37:49] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:37:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 734 ms
[2022-05-17 16:37:49] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-17 16:37:49] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-17 16:37:50] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:37:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:37:58] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:37:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 621 ms
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:38:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 764 ms
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:38:01] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2022-05-17 16:38:04] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:38:06] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:38:08] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:38:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:38:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2022-05-17 16:38:09] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:38:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 549 ms
[2022-05-17 16:38:13] [INFO ] After 108319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :373
Attempting to minimize the solution found.
Minimization took 38328 ms.
[2022-05-17 16:38:52] [INFO ] After 160450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :373
Fused 373 Parikh solutions to 350 different solutions.
Parikh walk visited 0 properties in 4725 ms.
Support contains 272 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 20 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 564343 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 373) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 371) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 367) seen :0
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 95677 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 367 properties.
[2022-05-17 16:41:10] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:41:10] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:41:12] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-05-17 16:41:25] [INFO ] After 14972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2022-05-17 16:41:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:41:39] [INFO ] After 9561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2022-05-17 16:41:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:41:50] [INFO ] After 10808ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2022-05-17 16:41:50] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 1 ms to minimize.
[2022-05-17 16:41:50] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2022-05-17 16:41:50] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:41:51] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:41:52] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:41:53] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:41:53] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:41:53] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3023 ms
[2022-05-17 16:41:53] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:41:53] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:41:54] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:41:55] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:41:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3133 ms
[2022-05-17 16:41:56] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:41:57] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:41:58] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2722 ms
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:41:59] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 651 ms
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:42:00] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:42:01] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:01] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:01] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:42:01] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:01] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:42:01] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:42:02] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:42:02] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:02] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:42:02] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:42:02] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:42:02] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:42:02] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:42:03] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:42:03] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:42:03] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:03] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:03] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:42:03] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:42:03] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3391 ms
[2022-05-17 16:42:04] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:42:04] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:04] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:42:04] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:42:04] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:42:04] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:42:05] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:42:06] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:42:06] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:42:06] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:42:06] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2509 ms
[2022-05-17 16:42:06] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:42:06] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:42:06] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 0 ms to minimize.
[2022-05-17 16:42:07] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:42:07] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:07] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:42:07] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:42:07] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:42:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1270 ms
[2022-05-17 16:42:07] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:42:07] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:42:08] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:42:08] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:42:08] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:42:08] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:42:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 897 ms
[2022-05-17 16:42:08] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:09] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1362 ms
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:10] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 922 ms
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:42:11] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:42:12] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:42:13] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:42:14] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:42:15] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:42:16] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5349 ms
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:42:17] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:42:18] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:42:19] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3075 ms
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:42:20] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:42:21] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 47 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:42:22] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:23] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3583 ms
[2022-05-17 16:42:23] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 29 places in 159 ms of which 1 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:42:24] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1388 ms
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:42:25] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 812 ms
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:42:26] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1083 ms
[2022-05-17 16:42:27] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2022-05-17 16:42:28] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:42:29] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:42:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1923 ms
[2022-05-17 16:42:30] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:42:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1024 ms
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:42:32] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 558 ms
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:42:33] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:42:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 955 ms
[2022-05-17 16:42:34] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 652 ms
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:35] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:42:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:37] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 790 ms
[2022-05-17 16:42:38] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:42:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 616 ms
[2022-05-17 16:42:39] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:42:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:42:40] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:42:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:42:41] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:42:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:42:43] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:42:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1096 ms
[2022-05-17 16:42:44] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 500 ms
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:42:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:42:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:42:47] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:42:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 647 ms
[2022-05-17 16:42:48] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:42:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:42:48] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:42:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 634 ms
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 466 ms
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:42:50] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:42:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 946 ms
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:42:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 839 ms
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 16:42:53] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:42:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:42:54] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:42:54] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:42:54] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 638 ms
[2022-05-17 16:42:55] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:42:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:42:56] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2022-05-17 16:42:57] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2022-05-17 16:42:57] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2022-05-17 16:42:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-17 16:42:58] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:42:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:42:58] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:42:59] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:42:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:43:00] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:43:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:43:01] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2022-05-17 16:43:02] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:43:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2022-05-17 16:43:05] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:43:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-17 16:43:05] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:43:06] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:43:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2022-05-17 16:43:06] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:43:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:43:07] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:43:07] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:43:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2022-05-17 16:43:08] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:43:08] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:43:08] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:43:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2022-05-17 16:43:09] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:43:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:43:09] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:43:09] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:43:09] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:43:09] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:43:09] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:43:10] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:43:10] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:43:10] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:43:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1185 ms
[2022-05-17 16:43:10] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:43:10] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-17 16:43:11] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:43:11] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:43:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 659 ms
[2022-05-17 16:43:13] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:43:13] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:43:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2022-05-17 16:43:14] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:43:16] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:43:18] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:43:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 16:43:19] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 16:43:19] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:43:19] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:43:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2022-05-17 16:43:22] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:43:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:43:26] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2022-05-17 16:43:29] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:43:30] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-17 16:43:30] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:43:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:43:31] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-17 16:43:31] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 954 ms
[2022-05-17 16:43:32] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:43:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 563 ms
[2022-05-17 16:43:33] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:43:33] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:43:33] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:43:34] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:43:34] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:43:34] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:43:34] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:43:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1231 ms
[2022-05-17 16:43:35] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:43:37] [INFO ] After 117922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :367
Attempting to minimize the solution found.
Minimization took 34051 ms.
[2022-05-17 16:44:11] [INFO ] After 166018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :367
Fused 367 Parikh solutions to 344 different solutions.
Parikh walk visited 0 properties in 4941 ms.
Support contains 269 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 24 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Interrupted random walk after 554847 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 95829 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 367 properties.
[2022-05-17 16:46:25] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:46:25] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:46:28] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:46:40] [INFO ] After 14793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2022-05-17 16:46:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:46:54] [INFO ] After 9089ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2022-05-17 16:46:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:47:04] [INFO ] After 10459ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2022-05-17 16:47:04] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:47:05] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:47:05] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:47:05] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:47:05] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:47:05] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:47:05] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:47:06] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:47:06] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:47:06] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:47:06] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:47:06] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:47:06] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:47:07] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:47:07] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:47:07] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:47:07] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:47:07] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2840 ms
[2022-05-17 16:47:07] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:47:08] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:47:08] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:47:08] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:47:08] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:47:08] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:47:08] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:47:09] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:09] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:47:09] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:09] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:09] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:09] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:47:10] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:10] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:47:10] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:10] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:10] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:10] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:10] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3020 ms
[2022-05-17 16:47:10] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:47:11] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:47:11] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:47:11] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:47:11] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:47:11] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:47:11] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:47:12] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:47:12] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:47:12] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:47:12] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:12] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:47:12] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:47:12] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:47:13] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:47:13] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:47:13] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:47:13] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:47:13] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2683 ms
[2022-05-17 16:47:13] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:47:14] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:14] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:47:14] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:47:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 623 ms
[2022-05-17 16:47:14] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:47:14] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:47:14] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2022-05-17 16:47:15] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:47:15] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:15] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:15] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:47:15] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:47:15] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:47:16] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:47:16] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:47:16] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:47:16] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:47:16] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:47:16] [INFO ] Deduced a trap composed of 46 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:47:16] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:47:17] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:47:17] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:47:17] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:47:17] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:47:17] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:47:17] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:47:17] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3377 ms
[2022-05-17 16:47:18] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:18] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:47:18] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:47:18] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:18] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:18] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 43 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:47:19] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:47:20] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:47:20] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:47:20] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:47:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2432 ms
[2022-05-17 16:47:20] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:47:20] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:47:20] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:47:21] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:47:21] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:47:21] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:47:21] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:47:21] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:47:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1208 ms
[2022-05-17 16:47:21] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:47:21] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:47:22] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:47:22] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:47:22] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:47:22] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:47:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 899 ms
[2022-05-17 16:47:22] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:47:22] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:47:23] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:47:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1383 ms
[2022-05-17 16:47:24] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:47:24] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:47:24] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:24] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:24] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:47:24] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:47:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 931 ms
[2022-05-17 16:47:25] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:47:25] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2022-05-17 16:47:25] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:47:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 360 ms
[2022-05-17 16:47:25] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:47:25] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:47:25] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:47:25] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:47:26] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:47:26] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:47:26] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:47:26] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:47:26] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:47:26] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:47:27] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:47:28] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:47:28] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:47:28] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:28] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:47:28] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:28] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:47:28] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:47:29] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:47:29] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:47:29] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:47:29] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:47:29] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:29] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:47:30] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:47:30] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:47:30] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:47:30] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:47:30] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:47:30] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:47:30] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5431 ms
[2022-05-17 16:47:31] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:47:31] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:47:31] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:47:31] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:47:32] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:47:33] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:47:33] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:47:33] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2022-05-17 16:47:33] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:47:33] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:47:33] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:47:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2880 ms
[2022-05-17 16:47:34] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:47:34] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:47:34] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:34] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:47:34] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:47:34] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:47:34] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:47:35] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:47:36] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:47:36] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:47:36] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:47:36] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:47:36] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:47:36] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:47:37] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:37] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:47:37] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3343 ms
[2022-05-17 16:47:37] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:47:37] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:47:37] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:47:38] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:47:38] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:47:38] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:47:38] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:47:38] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:47:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1338 ms
[2022-05-17 16:47:38] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:47:39] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:47:39] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:39] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:47:39] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:47:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 798 ms
[2022-05-17 16:47:39] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:47:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:47:39] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:47:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:47:40] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:40] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:47:40] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:47:40] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:47:40] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:47:40] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:47:41] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:47:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1036 ms
[2022-05-17 16:47:41] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:47:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:47:41] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:47:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:47:41] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:47:42] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:47:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2022-05-17 16:47:42] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:47:42] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:42] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:47:42] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:47:43] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:47:43] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:47:43] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:47:43] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:43] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2022-05-17 16:47:43] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:47:44] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:47:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1815 ms
[2022-05-17 16:47:44] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:47:44] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:47:44] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:47:44] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:47:45] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:47:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1015 ms
[2022-05-17 16:47:45] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:47:45] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:47:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2022-05-17 16:47:45] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:47:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:47:46] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:47:46] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:47:46] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:47:46] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:47:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 580 ms
[2022-05-17 16:47:46] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:47:47] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:47:47] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:47:47] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:47] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 964 ms
[2022-05-17 16:47:48] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:48] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:47:48] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:47:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:47:48] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2022-05-17 16:47:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 632 ms
[2022-05-17 16:47:49] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:47:49] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2022-05-17 16:47:49] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:47:49] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:47:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2022-05-17 16:47:50] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:47:50] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:47:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2022-05-17 16:47:50] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:47:51] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:47:51] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:47:51] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:51] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:47:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 843 ms
[2022-05-17 16:47:51] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:47:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2022-05-17 16:47:52] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:52] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:47:52] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:47:53] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:47:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 660 ms
[2022-05-17 16:47:53] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:47:53] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:47:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:47:54] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:47:54] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:47:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2022-05-17 16:47:54] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:47:55] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:47:55] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2022-05-17 16:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-17 16:47:55] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:47:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:47:55] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:47:56] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:47:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2022-05-17 16:47:56] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:47:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:47:57] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:47:57] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:47:57] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:47:57] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:47:57] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2022-05-17 16:47:57] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:58] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1102 ms
[2022-05-17 16:47:58] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:47:58] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:47:58] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:47:58] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:47:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 503 ms
[2022-05-17 16:47:59] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:47:59] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:47:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2022-05-17 16:48:00] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:48:00] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:48:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2022-05-17 16:48:00] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:48:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2022-05-17 16:48:01] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:48:01] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:48:01] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:48:01] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:48:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 672 ms
[2022-05-17 16:48:01] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-17 16:48:02] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:48:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2022-05-17 16:48:03] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:48:03] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:48:03] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:48:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 470 ms
[2022-05-17 16:48:04] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:48:04] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:48:04] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:48:04] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:48:04] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:48:04] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:48:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 991 ms
[2022-05-17 16:48:05] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:48:06] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2022-05-17 16:48:06] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:48:06] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:48:06] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:48:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 893 ms
[2022-05-17 16:48:07] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:48:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2022-05-17 16:48:07] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:48:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2022-05-17 16:48:08] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:48:08] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:48:08] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:48:08] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:48:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 660 ms
[2022-05-17 16:48:09] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:48:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:48:10] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:48:10] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:48:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2022-05-17 16:48:11] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:48:11] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-17 16:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 16:48:11] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:48:12] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:48:12] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:48:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
[2022-05-17 16:48:13] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-17 16:48:13] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:48:14] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:48:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:48:15] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:48:15] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:48:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2022-05-17 16:48:16] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:48:16] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2022-05-17 16:48:19] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2022-05-17 16:48:19] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 0 ms to minimize.
[2022-05-17 16:48:19] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:48:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2022-05-17 16:48:20] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:48:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:48:20] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:48:20] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:48:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2022-05-17 16:48:22] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:48:22] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-05-17 16:48:22] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:48:22] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2022-05-17 16:48:23] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:48:23] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:48:23] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:48:23] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:48:23] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:48:23] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:48:24] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:48:24] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:48:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1245 ms
[2022-05-17 16:48:24] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:48:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:48:24] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-05-17 16:48:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 16:48:24] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:48:25] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:48:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 654 ms
[2022-05-17 16:48:27] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:48:27] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:48:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2022-05-17 16:48:28] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:48:30] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:48:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:48:32] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:48:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:48:33] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:48:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 16:48:33] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:48:33] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:48:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2022-05-17 16:48:36] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-17 16:48:40] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 483 ms
[2022-05-17 16:48:42] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:48:43] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:48:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:48:44] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:48:44] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:48:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:48:45] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 924 ms
[2022-05-17 16:48:46] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2022-05-17 16:48:47] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:48:47] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:48:47] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:48:47] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:48:47] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:48:47] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:48:48] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:48:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1255 ms
[2022-05-17 16:48:49] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:48:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 16:48:50] [INFO ] After 116602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :367
Attempting to minimize the solution found.
Minimization took 36015 ms.
[2022-05-17 16:49:26] [INFO ] After 166130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :367
Fused 367 Parikh solutions to 344 different solutions.
Parikh walk visited 0 properties in 4726 ms.
Support contains 269 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 17 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 16 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:49:31] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:49:31] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:49:31] [INFO ] Implicit Places using invariants in 165 ms returned []
[2022-05-17 16:49:31] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:49:31] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:49:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:49:32] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2022-05-17 16:49:32] [INFO ] Redundant transitions in 72 ms returned []
[2022-05-17 16:49:32] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:49:32] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:49:33] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4217 ms. (steps per millisecond=23 ) properties (out of 269) seen :98
Running SMT prover for 171 properties.
[2022-05-17 16:49:37] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:49:37] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:49:38] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:49:44] [INFO ] After 6919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:171
[2022-05-17 16:49:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:49:50] [INFO ] After 4304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :171
[2022-05-17 16:49:50] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:49:55] [INFO ] After 4606ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :171
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:49:55] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2022-05-17 16:49:56] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:49:57] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:49:58] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:49:59] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4900 ms
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:00] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1028 ms
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 431 ms
[2022-05-17 16:50:01] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:02] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:50:03] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:50:04] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2871 ms
[2022-05-17 16:50:04] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:05] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1298 ms
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:50:06] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:50:07] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2235 ms
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:08] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:50:09] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1910 ms
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:50:10] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:50:11] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:50:12] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2574 ms
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:13] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:50:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1812 ms
[2022-05-17 16:50:14] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 478 ms
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:50:15] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 886 ms
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:16] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1323 ms
[2022-05-17 16:50:17] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:18] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1227 ms
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:50:19] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 664 ms
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:50:20] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1393 ms
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:50:21] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 696 ms
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 45 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:50:22] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:50:23] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2058 ms
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:50:24] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:50:25] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:50:26] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:50:27] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3351 ms
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:50:28] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:50:29] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2209 ms
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:50:30] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 956 ms
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:50:31] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:50:32] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 538 ms
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:50:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 580 ms
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:50:34] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1246 ms
[2022-05-17 16:50:35] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:50:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:36] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 766 ms
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:50:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:50:37] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 492 ms
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:50:38] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:50:39] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:50:39] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 828 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-17 16:50:40] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:50:41] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 690 ms
[2022-05-17 16:50:42] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:43] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1342 ms
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 531 ms
[2022-05-17 16:50:44] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:50:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2022-05-17 16:50:46] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:50:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-17 16:50:47] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2022-05-17 16:50:48] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:50:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 964 ms
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:50:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:50:52] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 753 ms
[2022-05-17 16:50:53] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:50:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 528 ms
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:50:54] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:50:55] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:50:57] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:50:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-05-17 16:50:57] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:50:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 426 ms
[2022-05-17 16:50:57] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 508 ms
[2022-05-17 16:50:58] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-17 16:50:58] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2022-05-17 16:50:59] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:51:00] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-17 16:51:00] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2022-05-17 16:51:00] [INFO ] After 70128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :171
Attempting to minimize the solution found.
Minimization took 17157 ms.
[2022-05-17 16:51:17] [INFO ] After 93687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :171
Interrupted random walk after 543709 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 367) seen :0
Probabilistic random walk after 10000000 steps, saw 1257049 distinct states, run finished after 98404 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 367 properties.
[2022-05-17 16:53:29] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:53:29] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:53:32] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:53:44] [INFO ] After 14763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2022-05-17 16:53:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-17 16:53:58] [INFO ] After 8908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2022-05-17 16:53:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:54:09] [INFO ] After 10986ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2022-05-17 16:54:09] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 0 ms to minimize.
[2022-05-17 16:54:09] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:54:09] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:54:09] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:54:09] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:54:10] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:54:10] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2022-05-17 16:54:10] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:54:10] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 0 ms to minimize.
[2022-05-17 16:54:10] [INFO ] Deduced a trap composed of 21 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:54:10] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2022-05-17 16:54:11] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2022-05-17 16:54:11] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:54:11] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:54:11] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:54:11] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:54:11] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:54:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2929 ms
[2022-05-17 16:54:12] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:54:12] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:54:12] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:54:12] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:54:13] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:54:13] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:54:13] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:54:13] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:54:13] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:54:13] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:54:14] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:54:14] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:54:14] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:54:14] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:54:14] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:54:14] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:54:15] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:54:15] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:54:15] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:54:15] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3154 ms
[2022-05-17 16:54:15] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:54:15] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:54:15] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:54:16] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:54:16] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:54:16] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:54:16] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:54:16] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:54:16] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:54:16] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:54:17] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:54:17] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:54:17] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:54:17] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:54:17] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:54:17] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:54:17] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:54:18] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:54:18] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2753 ms
[2022-05-17 16:54:18] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:54:18] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:54:18] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:54:19] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:54:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 652 ms
[2022-05-17 16:54:19] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:54:19] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:54:19] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:54:19] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:54:19] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:54:20] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:54:20] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 0 ms to minimize.
[2022-05-17 16:54:20] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:54:20] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:54:20] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:54:20] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:54:21] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:54:21] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:54:21] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:54:21] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:54:21] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:54:21] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:54:21] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:54:22] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:54:22] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:54:22] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:54:22] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:54:22] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3379 ms
[2022-05-17 16:54:22] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:54:22] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:54:23] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:54:23] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:54:23] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:54:23] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:54:23] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:54:23] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:54:24] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:54:25] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:54:25] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2461 ms
[2022-05-17 16:54:25] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2022-05-17 16:54:25] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:54:25] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:54:25] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:54:25] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:54:26] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:54:26] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:54:26] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2022-05-17 16:54:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1250 ms
[2022-05-17 16:54:26] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:54:26] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:54:26] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:54:26] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:54:27] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:54:27] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:54:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 900 ms
[2022-05-17 16:54:27] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:54:27] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:54:27] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:54:27] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 0 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:54:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1374 ms
[2022-05-17 16:54:28] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:54:29] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:54:29] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:54:29] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:54:29] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:54:29] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:54:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 906 ms
[2022-05-17 16:54:29] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:54:29] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:54:30] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:54:31] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:54:31] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:54:31] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:54:31] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:54:31] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2022-05-17 16:54:32] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:54:33] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:54:33] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:54:33] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:54:33] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2022-05-17 16:54:33] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:54:33] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:54:33] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:54:34] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:54:34] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:54:34] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:54:34] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:54:34] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:54:34] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:54:34] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:54:35] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:54:35] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:54:35] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:54:35] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5215 ms
[2022-05-17 16:54:35] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:54:36] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:54:37] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2886 ms
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:54:38] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:54:39] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:54:40] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:54:41] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3403 ms
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:54:42] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1325 ms
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:54:43] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 786 ms
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:54:44] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1038 ms
[2022-05-17 16:54:45] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2022-05-17 16:54:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 16:54:46] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:54:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-17 16:54:46] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:54:46] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:54:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2022-05-17 16:54:46] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:54:47] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:54:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1820 ms
[2022-05-17 16:54:48] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2022-05-17 16:54:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1025 ms
[2022-05-17 16:54:49] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:54:50] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 587 ms
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 0 ms to minimize.
[2022-05-17 16:54:51] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:54:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1002 ms
[2022-05-17 16:54:52] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 659 ms
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:54:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:54:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:54:55] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 790 ms
[2022-05-17 16:54:56] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 1 ms to minimize.
[2022-05-17 16:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 600 ms
[2022-05-17 16:54:57] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:54:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 16:54:58] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:54:59] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-05-17 16:54:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:55:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:55:01] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:55:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1113 ms
[2022-05-17 16:55:02] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 502 ms
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:55:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 630 ms
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:55:06] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 0 ms to minimize.
[2022-05-17 16:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 648 ms
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:55:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 477 ms
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:55:08] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:55:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 955 ms
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 845 ms
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-17 16:55:11] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:55:12] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 623 ms
[2022-05-17 16:55:13] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:14] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-17 16:55:15] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-05-17 16:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:55:16] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-17 16:55:17] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2022-05-17 16:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-17 16:55:18] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:55:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2022-05-17 16:55:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:55:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2022-05-17 16:55:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2022-05-17 16:55:25] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-05-17 16:55:26] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 1 ms to minimize.
[2022-05-17 16:55:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1150 ms
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2022-05-17 16:55:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-17 16:55:28] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:55:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 642 ms
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:55:30] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:55:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2022-05-17 16:55:32] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-17 16:55:34] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-17 16:55:35] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-05-17 16:55:36] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 0 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:55:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2022-05-17 16:55:39] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:55:43] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:55:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:55:46] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:55:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-17 16:55:47] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:55:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-17 16:55:48] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 902 ms
[2022-05-17 16:55:49] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 537 ms
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:55:50] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:55:51] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:55:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1237 ms
[2022-05-17 16:55:52] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:55:53] [INFO ] After 115741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :367
Attempting to minimize the solution found.
Minimization took 33371 ms.
[2022-05-17 16:56:27] [INFO ] After 162371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :367
Fused 367 Parikh solutions to 344 different solutions.
Parikh walk visited 0 properties in 5113 ms.
Support contains 269 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 27 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:56:32] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:56:32] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:56:32] [INFO ] Implicit Places using invariants in 132 ms returned []
[2022-05-17 16:56:32] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:56:32] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:56:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:56:33] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2022-05-17 16:56:33] [INFO ] Redundant transitions in 130 ms returned []
[2022-05-17 16:56:33] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:56:33] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 16:56:33] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 4111 ms. (steps per millisecond=24 ) properties (out of 269) seen :96
Running SMT prover for 173 properties.
[2022-05-17 16:56:37] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:56:37] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 16:56:38] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:56:44] [INFO ] After 6842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:173
[2022-05-17 16:56:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:56:51] [INFO ] After 4388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :173
[2022-05-17 16:56:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:56:56] [INFO ] After 4886ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :173
[2022-05-17 16:56:56] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 0 ms to minimize.
[2022-05-17 16:56:56] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:56:56] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:56:56] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:56:56] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:56:57] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:56:58] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:56:59] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:56:59] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:56:59] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:56:59] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:56:59] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:56:59] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:57:00] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 1 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:57:01] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:57:02] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 6710 ms
[2022-05-17 16:57:02] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:57:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 992 ms
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:57:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1014 ms
[2022-05-17 16:57:05] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:57:05] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:57:05] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:57:05] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:57:05] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:57:05] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:57:05] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:57:06] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:07] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3447 ms
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:57:08] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 634 ms
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:57:09] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:57:10] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 52 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:57:11] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2624 ms
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:57:12] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2022-05-17 16:57:13] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2022-05-17 16:57:13] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2022-05-17 16:57:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1314 ms
[2022-05-17 16:57:13] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-17 16:57:13] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-17 16:57:13] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:57:14] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 0 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:57:15] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2022-05-17 16:57:16] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2858 ms
[2022-05-17 16:57:17] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2022-05-17 16:57:17] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:57:17] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 0 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 1 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:57:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1159 ms
[2022-05-17 16:57:19] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:57:19] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
[2022-05-17 16:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2022-05-17 16:57:19] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:57:19] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2022-05-17 16:57:19] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1171 ms
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:57:20] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 0 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 0 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 0 ms to minimize.
[2022-05-17 16:57:21] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:57:22] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-05-17 16:57:23] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:57:23] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-17 16:57:23] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:57:23] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2617 ms
[2022-05-17 16:57:23] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-17 16:57:23] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2022-05-17 16:57:23] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:57:24] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1600 ms
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2022-05-17 16:57:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 323 ms
[2022-05-17 16:57:26] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:57:26] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:57:26] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:26] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2022-05-17 16:57:26] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:57:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 712 ms
[2022-05-17 16:57:26] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 0 ms to minimize.
[2022-05-17 16:57:27] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:57:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2022-05-17 16:57:27] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:57:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2022-05-17 16:57:28] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:57:28] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:57:28] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:57:28] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:57:28] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:57:29] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:57:29] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:57:29] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2022-05-17 16:57:29] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:57:29] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2022-05-17 16:57:29] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2022-05-17 16:57:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1886 ms
[2022-05-17 16:57:30] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:57:30] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:57:30] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:57:30] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:57:30] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2022-05-17 16:57:30] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2022-05-17 16:57:30] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:57:31] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 0 ms to minimize.
[2022-05-17 16:57:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 991 ms
[2022-05-17 16:57:31] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:57:31] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:31] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:31] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:57:31] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:57:32] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2022-05-17 16:57:32] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:57:32] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 1 ms to minimize.
[2022-05-17 16:57:32] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2022-05-17 16:57:32] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 1 ms to minimize.
[2022-05-17 16:57:33] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 1 ms to minimize.
[2022-05-17 16:57:33] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:57:33] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:57:33] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2022-05-17 16:57:33] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2022-05-17 16:57:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2418 ms
[2022-05-17 16:57:33] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:57:33] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:57:34] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:34] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:57:34] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2022-05-17 16:57:34] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2022-05-17 16:57:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1121 ms
[2022-05-17 16:57:34] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:57:35] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:57:35] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-05-17 16:57:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2022-05-17 16:57:35] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2022-05-17 16:57:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 0 ms to minimize.
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:57:36] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 1 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1018 ms
[2022-05-17 16:57:37] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 0 ms to minimize.
[2022-05-17 16:57:37] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:57:38] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 1 ms to minimize.
[2022-05-17 16:57:38] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:57:38] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2022-05-17 16:57:38] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:57:38] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:57:38] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 0 ms to minimize.
[2022-05-17 16:57:39] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:57:39] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:57:39] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2022-05-17 16:57:39] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:57:39] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:57:39] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2425 ms
[2022-05-17 16:57:39] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2022-05-17 16:57:40] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2022-05-17 16:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:57:40] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2022-05-17 16:57:40] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:57:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2022-05-17 16:57:41] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 0 ms to minimize.
[2022-05-17 16:57:41] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 1 ms to minimize.
[2022-05-17 16:57:41] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 0 ms to minimize.
[2022-05-17 16:57:41] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:57:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 925 ms
[2022-05-17 16:57:42] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-05-17 16:57:42] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:57:42] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2022-05-17 16:57:42] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-05-17 16:57:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 530 ms
[2022-05-17 16:57:42] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:57:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2022-05-17 16:57:43] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 1 ms to minimize.
[2022-05-17 16:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2022-05-17 16:57:43] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:57:43] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:57:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2022-05-17 16:57:43] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:57:44] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:44] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-05-17 16:57:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2022-05-17 16:57:44] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:57:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:57:45] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 0 ms to minimize.
[2022-05-17 16:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-17 16:57:45] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 0 ms to minimize.
[2022-05-17 16:57:45] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 3 ms to minimize.
[2022-05-17 16:57:45] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:57:45] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2022-05-17 16:57:45] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2022-05-17 16:57:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 612 ms
[2022-05-17 16:57:46] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2022-05-17 16:57:46] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 0 ms to minimize.
[2022-05-17 16:57:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2022-05-17 16:57:47] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 0 ms to minimize.
[2022-05-17 16:57:47] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 0 ms to minimize.
[2022-05-17 16:57:47] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 0 ms to minimize.
[2022-05-17 16:57:47] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2022-05-17 16:57:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 494 ms
[2022-05-17 16:57:47] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 0 ms to minimize.
[2022-05-17 16:57:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:57:48] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:57:48] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:57:48] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:57:48] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:57:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 668 ms
[2022-05-17 16:57:49] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:57:50] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 0 ms to minimize.
[2022-05-17 16:57:50] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
[2022-05-17 16:57:50] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2022-05-17 16:57:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2022-05-17 16:57:50] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:57:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-17 16:57:51] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2022-05-17 16:57:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-17 16:57:52] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 0 ms to minimize.
[2022-05-17 16:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-17 16:57:52] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2022-05-17 16:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:57:52] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:57:52] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2022-05-17 16:57:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 353 ms
[2022-05-17 16:57:53] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 1 ms to minimize.
[2022-05-17 16:57:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2022-05-17 16:57:53] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2022-05-17 16:57:53] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2022-05-17 16:57:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2022-05-17 16:57:54] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2022-05-17 16:57:54] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2022-05-17 16:57:55] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:57:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-17 16:57:56] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2022-05-17 16:57:56] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:56] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2022-05-17 16:57:56] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2022-05-17 16:57:56] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2022-05-17 16:57:56] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 0 ms to minimize.
[2022-05-17 16:57:57] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:57:57] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2022-05-17 16:57:57] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 1 ms to minimize.
[2022-05-17 16:57:57] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:57] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:57:57] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:57:57] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 0 ms to minimize.
[2022-05-17 16:57:58] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2022-05-17 16:57:58] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2022-05-17 16:57:58] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2022-05-17 16:57:58] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 1 ms to minimize.
[2022-05-17 16:57:58] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:57:58] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 0 ms to minimize.
[2022-05-17 16:57:58] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3067 ms
[2022-05-17 16:57:59] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2022-05-17 16:57:59] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2022-05-17 16:57:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2022-05-17 16:57:59] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2022-05-17 16:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:57:59] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
[2022-05-17 16:57:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-17 16:58:00] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2022-05-17 16:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-05-17 16:58:00] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 0 ms to minimize.
[2022-05-17 16:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-17 16:58:01] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 0 ms to minimize.
[2022-05-17 16:58:01] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2022-05-17 16:58:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2022-05-17 16:58:02] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2022-05-17 16:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-17 16:58:03] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2022-05-17 16:58:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2022-05-17 16:58:06] [INFO ] After 75121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :173
Attempting to minimize the solution found.
Minimization took 17083 ms.
[2022-05-17 16:58:23] [INFO ] After 98731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :173
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=33 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 714988 steps, run visited all 1 properties in 2173 ms. (steps per millisecond=329 )
Probabilistic random walk after 714988 steps, saw 93532 distinct states, run finished after 2173 ms. (steps per millisecond=329 ) properties seen :1
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 995048 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 995048 steps, saw 131159 distinct states, run finished after 3004 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:58:28] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:28] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 16:58:28] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 16:58:29] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:29] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:29] [INFO ] After 56ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:29] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-17 16:58:29] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 20 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 978056 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :{}
Probabilistic random walk after 978056 steps, saw 129573 distinct states, run finished after 3002 ms. (steps per millisecond=325 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:58:32] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:32] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:58:32] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:58:32] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:32] [INFO ] After 60ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:32] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 16:58:32] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 26 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 22 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:58:32] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:32] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:58:33] [INFO ] Implicit Places using invariants in 249 ms returned []
[2022-05-17 16:58:33] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:33] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:58:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:34] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2022-05-17 16:58:34] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-17 16:58:34] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:34] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:58:34] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 289 / 399 are part of one of the 42 SCC in 3 ms
Free SCC test removed 247 places
Drop transitions removed 494 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 745 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 152 transition count 320
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 111 transition count 320
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 107 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 95 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 116 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 130 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.31 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 182 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 218 place count 2 transition count 2
Applied a total of 218 rules in 55 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:58:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:58:35] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:58:35] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:35] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:58:35] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:35] [INFO ] Flatten gal took : 11 ms
[2022-05-17 16:58:35] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:58:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7222856029392535300.gal : 3 ms
[2022-05-17 16:58:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10979395588407876041.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7222856029392535300.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10979395588407876041.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10979395588407876041.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.008439,3284,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.008728,3708,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 349678 steps, run visited all 1 properties in 1058 ms. (steps per millisecond=330 )
Probabilistic random walk after 349678 steps, saw 48531 distinct states, run finished after 1060 ms. (steps per millisecond=329 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 837398 steps, run visited all 1 properties in 2494 ms. (steps per millisecond=335 )
Probabilistic random walk after 837398 steps, saw 109156 distinct states, run finished after 2495 ms. (steps per millisecond=335 ) properties seen :1
Finished random walk after 7454 steps, including 2 resets, run visited all 1 properties in 16 ms. (steps per millisecond=465 )
Finished random walk after 3785 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=420 )
Finished random walk after 9255 steps, including 2 resets, run visited all 1 properties in 21 ms. (steps per millisecond=440 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1012976 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1012976 steps, saw 133670 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:58:41] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:41] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-17 16:58:42] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2022-05-17 16:58:42] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:42] [INFO ] After 72ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:42] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 1 ms to minimize.
[2022-05-17 16:58:42] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 1 ms to minimize.
[2022-05-17 16:58:42] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 0 ms to minimize.
[2022-05-17 16:58:43] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 0 ms to minimize.
[2022-05-17 16:58:43] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 0 ms to minimize.
[2022-05-17 16:58:43] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 0 ms to minimize.
[2022-05-17 16:58:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1010 ms
[2022-05-17 16:58:43] [INFO ] After 1114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-17 16:58:43] [INFO ] After 1439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 15 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 961880 steps, run timeout after 3001 ms. (steps per millisecond=320 ) properties seen :{}
Probabilistic random walk after 961880 steps, saw 126817 distinct states, run finished after 3001 ms. (steps per millisecond=320 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:58:46] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:46] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:58:46] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:58:46] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:46] [INFO ] After 67ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:47] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 0 ms to minimize.
[2022-05-17 16:58:47] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 0 ms to minimize.
[2022-05-17 16:58:47] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2022-05-17 16:58:47] [INFO ] Deduced a trap composed of 35 places in 136 ms of which 1 ms to minimize.
[2022-05-17 16:58:47] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2022-05-17 16:58:48] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 0 ms to minimize.
[2022-05-17 16:58:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1070 ms
[2022-05-17 16:58:48] [INFO ] After 1161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-17 16:58:48] [INFO ] After 1452ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 37 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 15 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:58:48] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:48] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 16:58:48] [INFO ] Implicit Places using invariants in 250 ms returned []
[2022-05-17 16:58:48] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:48] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:58:48] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:49] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
[2022-05-17 16:58:50] [INFO ] Redundant transitions in 188 ms returned []
[2022-05-17 16:58:50] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:50] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:58:50] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 15 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:58:50] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-17 16:58:50] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:58:50] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:50] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:58:50] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:50] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:58:50] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:58:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10464621612954514748.gal : 1 ms
[2022-05-17 16:58:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3021667907583952684.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10464621612954514748.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3021667907583952684.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality3021667907583952684.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001563,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001849,3904,2,3,6,12,7,0,16,6,0
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1008256 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1008256 steps, saw 132941 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:58:53] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:53] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:58:53] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 16:58:53] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:54] [INFO ] After 116ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:54] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 16:58:54] [INFO ] After 472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 15 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 984760 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 984760 steps, saw 130261 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:58:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:57] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 16:58:57] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:58:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:58:57] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:57] [INFO ] After 65ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:58:57] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-17 16:58:57] [INFO ] After 431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:58:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:57] [INFO ] Computed 20 place invariants in 16 ms
[2022-05-17 16:58:58] [INFO ] Implicit Places using invariants in 275 ms returned []
[2022-05-17 16:58:58] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:58] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:58:58] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:58:59] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
[2022-05-17 16:58:59] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-17 16:58:59] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:58:59] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:59:00] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 2 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 15 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:59:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:59:00] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:59:00] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:00] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:59:00] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:00] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:59:00] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:59:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2908117612293473864.gal : 0 ms
[2022-05-17 16:59:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14485554005061328381.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2908117612293473864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14485554005061328381.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14485554005061328381.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001804,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002115,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 996032 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 996032 steps, saw 131285 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:03] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:03] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 16:59:03] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:59:03] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:03] [INFO ] After 55ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:03] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-17 16:59:03] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 13 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1010976 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1010976 steps, saw 133376 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:06] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:06] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:59:06] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:59:07] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:07] [INFO ] After 49ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:07] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-17 16:59:07] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:59:07] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:07] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:07] [INFO ] Implicit Places using invariants in 264 ms returned []
[2022-05-17 16:59:07] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:07] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 16:59:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:08] [INFO ] Implicit Places using invariants and state equation in 1410 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
[2022-05-17 16:59:08] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:59:08] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:08] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:09] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 1 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 18 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:59:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:59:09] [INFO ] After 12ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:59:09] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:09] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-05-17 16:59:09] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:09] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:59:09] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:59:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8712462892130549594.gal : 1 ms
[2022-05-17 16:59:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4835511008832032164.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8712462892130549594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4835511008832032164.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4835511008832032164.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001556,3460,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001809,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4404 steps, run visited all 1 properties in 16 ms. (steps per millisecond=275 )
Probabilistic random walk after 4404 steps, saw 2543 distinct states, run finished after 16 ms. (steps per millisecond=275 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1008784 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1008784 steps, saw 133045 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:12] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:12] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 16:59:12] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 16:59:12] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:12] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:12] [INFO ] After 60ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:12] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 16:59:13] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1000680 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1000680 steps, saw 131832 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:16] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:16] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:16] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 16:59:16] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:16] [INFO ] After 62ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:16] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 16:59:16] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:59:16] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:16] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:16] [INFO ] Implicit Places using invariants in 299 ms returned []
[2022-05-17 16:59:16] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:16] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:18] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2022-05-17 16:59:18] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:59:18] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:18] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:18] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 4 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 16 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:59:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:59:18] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:59:18] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:18] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:59:18] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:18] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:59:18] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:59:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality566157003539423091.gal : 2 ms
[2022-05-17 16:59:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1645231396123468273.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality566157003539423091.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1645231396123468273.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality1645231396123468273.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.005208,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.005438,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1023920 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1023920 steps, saw 135050 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:21] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:21] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:59:22] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:59:22] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:22] [INFO ] After 57ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:22] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-17 16:59:22] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 25 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1018968 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1018968 steps, saw 134381 distinct states, run finished after 3002 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:25] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:25] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:59:25] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:59:25] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:25] [INFO ] After 57ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:25] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 16:59:25] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:59:26] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:26] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:26] [INFO ] Implicit Places using invariants in 341 ms returned []
[2022-05-17 16:59:26] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:26] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:26] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:27] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1852 ms to find 0 implicit places.
[2022-05-17 16:59:27] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-17 16:59:27] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:27] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 16:59:28] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 289 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 247 places
Drop transitions removed 494 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 745 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 152 transition count 320
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 111 transition count 320
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 107 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 95 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 116 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 130 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 182 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 218 place count 2 transition count 2
Applied a total of 218 rules in 18 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:59:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:59:28] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:59:28] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:28] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:59:28] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:28] [INFO ] Flatten gal took : 2 ms
[2022-05-17 16:59:28] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:59:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15175338518067624479.gal : 1 ms
[2022-05-17 16:59:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4127055518896277549.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15175338518067624479.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4127055518896277549.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4127055518896277549.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002917,3468,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.00317,3908,2,3,6,12,7,0,16,6,0
Finished random walk after 904 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=301 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1026400 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1026400 steps, saw 135410 distinct states, run finished after 3003 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:31] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:31] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:59:31] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 16:59:31] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:31] [INFO ] After 48ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:31] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 16:59:32] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1014704 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1014704 steps, saw 133993 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:35] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:35] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:59:35] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 16:59:35] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:35] [INFO ] After 50ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:35] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-17 16:59:35] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:59:35] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:35] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:35] [INFO ] Implicit Places using invariants in 232 ms returned []
[2022-05-17 16:59:35] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:35] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 16:59:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:37] [INFO ] Implicit Places using invariants and state equation in 1519 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2022-05-17 16:59:37] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:59:37] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:37] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:59:37] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 32 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:59:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:59:37] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:59:37] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:37] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:59:37] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:37] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:59:37] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:59:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4543911394604375247.gal : 1 ms
[2022-05-17 16:59:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16793389204972774177.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4543911394604375247.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16793389204972774177.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16793389204972774177.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.00186,3468,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.002125,3908,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1015648 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1015648 steps, saw 134067 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:40] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:41] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:41] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 16:59:41] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:41] [INFO ] After 56ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:41] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 16:59:41] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1021904 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1021904 steps, saw 134792 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:44] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:44] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:59:44] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:59:44] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:44] [INFO ] After 55ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:44] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-17 16:59:45] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:59:45] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:45] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 16:59:45] [INFO ] Implicit Places using invariants in 467 ms returned []
[2022-05-17 16:59:45] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:45] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 16:59:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:47] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2022-05-17 16:59:47] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-17 16:59:47] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:47] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 16:59:47] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 17 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:59:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 16:59:47] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 16:59:47] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:47] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-17 16:59:47] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:47] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:59:47] [INFO ] Flatten gal took : 1 ms
[2022-05-17 16:59:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4598769154532783923.gal : 3 ms
[2022-05-17 16:59:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5904237844017371404.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4598769154532783923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5904237844017371404.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality5904237844017371404.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001296,3464,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001543,3904,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 15062 steps, run visited all 1 properties in 48 ms. (steps per millisecond=313 )
Probabilistic random walk after 15062 steps, saw 7804 distinct states, run finished after 49 ms. (steps per millisecond=307 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 719228 steps, run visited all 1 properties in 2137 ms. (steps per millisecond=336 )
Probabilistic random walk after 719228 steps, saw 95753 distinct states, run finished after 2137 ms. (steps per millisecond=336 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1007024 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :{}
Probabilistic random walk after 1007024 steps, saw 132856 distinct states, run finished after 3002 ms. (steps per millisecond=335 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:53] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:53] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 16:59:53] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:59:53] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:53] [INFO ] After 46ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:53] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 16:59:53] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1003344 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :{}
Probabilistic random walk after 1003344 steps, saw 132356 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:59:56] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:56] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 16:59:56] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2022-05-17 16:59:56] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:57] [INFO ] After 50ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:57] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-05-17 16:59:57] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2022-05-17 16:59:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:57] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:57] [INFO ] Implicit Places using invariants in 482 ms returned []
[2022-05-17 16:59:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:57] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 16:59:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 16:59:59] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
[2022-05-17 16:59:59] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-17 16:59:59] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 16:59:59] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 16:59:59] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Graph (trivial) has 837 edges and 399 vertex of which 290 / 399 are part of one of the 42 SCC in 1 ms
Free SCC test removed 248 places
Drop transitions removed 496 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 747 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 318
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 318
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 89 place count 107 transition count 315
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 92 place count 107 transition count 312
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 113 place count 93 transition count 305
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 86 transition count 298
Graph (trivial) has 43 edges and 86 vertex of which 43 / 86 are part of one of the 7 SCC in 0 ms
Free SCC test removed 36 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 44 transition count 298
Drop transitions removed 43 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 260 edges and 44 vertex of which 2 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 216 output transitions
Drop transitions removed 216 transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 179 place count 2 transition count 38
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 215 place count 2 transition count 2
Applied a total of 215 rules in 11 ms. Remains 2 /399 variables (removed 397) and now considering 2/1106 (removed 1104) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 16:59:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 16:59:59] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:59:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 16:59:59] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:59] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-17 16:59:59] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 16:59:59] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:59:59] [INFO ] Flatten gal took : 0 ms
[2022-05-17 16:59:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5125073737132501336.gal : 12 ms
[2022-05-17 16:59:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3127779473358990894.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1283692904494994623;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5125073737132501336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3127779473358990894.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3127779473358990894.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.001228,3468,2,4,5,12,7,0,14,6,0
Total reachable state count : 2

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,1,0.001463,3908,2,3,6,12,7,0,16,6,0
Finished random walk after 2077 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=346 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1016808 steps, run timeout after 3001 ms. (steps per millisecond=338 ) properties seen :{}
Probabilistic random walk after 1016808 steps, saw 134151 distinct states, run finished after 3001 ms. (steps per millisecond=338 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-17 17:00:02] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2022-05-17 17:00:02] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 17:00:02] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 17:00:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-17 17:00:02] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 17:00:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 17:00:03] [INFO ] After 56ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 17:00:03] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-17 17:00:03] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 12 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1106/1106 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination QuasiLiveness -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-6"
export BK_EXAMINATION="QuasiLiveness"
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-6, examination is QuasiLiveness"
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-165277023900052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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