About the Execution of 2022-gold for Peterson-PT-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 613.764 | 1800000.00 | 2162538.00 | 3916.00 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r288-smll-167863554400397.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r288-smll-167863554400397
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 204K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 847K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 215K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 124K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 364K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 288K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 839K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 877K Mar 5 18:23 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 1678916930848
Running Version 202205111006
[2023-03-15 21:48:53] [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]
[2023-03-15 21:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:48:53] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2023-03-15 21:48:53] [INFO ] Transformed 1330 places.
[2023-03-15 21:48:53] [INFO ] Transformed 2030 transitions.
[2023-03-15 21:48:53] [INFO ] Found NUPN structural information;
[2023-03-15 21:48:53] [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]
[2023-03-15 21:48:53] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 540 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 6 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 246 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2023-03-15 21:48:54] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2023-03-15 21:48:54] [INFO ] Computed 27 place invariants in 37 ms
[2023-03-15 21:48:55] [INFO ] Implicit Places using invariants in 1186 ms returned [387, 388, 390, 398, 399, 400, 401]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1238 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 20 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 1462 ms. (steps per millisecond=6 ) properties (out of 1099) seen :431
Running SMT prover for 667 properties.
[2023-03-15 21:48:56] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 21:48:56] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 21:49:06] [INFO ] [Real]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-15 21:49:22] [INFO ] After 7325ms SMT Verify possible using state equation in real domain returned unsat :0 sat :558 real:109
[2023-03-15 21:49:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 21:49:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 21:49:22] [INFO ] After 25063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 667 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 369 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 102 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 328884 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 64
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 603) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 594) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 587) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 582) seen :5
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 :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 574) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 573) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 572) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 563) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 559) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 558) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 556) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 555) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 552) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 551) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 551) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 551) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 551) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 548) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 546) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 545) 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 545) 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 545) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 544) 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 544) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 544) 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 544) 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 544) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 543) 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 543) 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 543) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 543) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 543) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 543) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 543) 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 543) 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 543) 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 543) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 541) 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 541) 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 541) 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 541) 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 541) 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 541) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 541) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 541) 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 541) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 541) 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 541) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 540) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 540) 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 540) 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 540) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 540) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 540) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 539) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 539) 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 539) 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 539) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 538) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 538) 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 538) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 536) 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 536) 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 536) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 536) 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 536) 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 536) 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 536) 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 536) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 536) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 535) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 535) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 535) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 535) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 534) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 534) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 532) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 531) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 528) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 528) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 525) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 525) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 525) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 525) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 525) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 523) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 522) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 522) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 522) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 521) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 521) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 520) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 519) 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 519) 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 519) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 519) 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 519) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 518) 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 518) 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 518) 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 518) 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 518) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 518) 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 518) 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 518) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 516) 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 516) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 516) 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 516) 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 516) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 516) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 516) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 515) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 515) 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 515) 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 515) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 515) 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 515) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 515) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 515) 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 515) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 515) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 515) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 514) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 514) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 514) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 514) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) 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 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) 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 512) 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 512) 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 512) 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 512) 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 512) 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 512) 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 512) 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 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 512) 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 512) 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 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) 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 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 512) 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 512) 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 512) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 512) 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 512) 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 512) 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 512) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 510) 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 510) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 510) 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 510) 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 510) 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 510) 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 510) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 506) 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 506) 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 506) 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 506) 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 506) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 504) 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 504) 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 504) 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 504) 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 504) 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 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 504) 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 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 504) 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 504) 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 504) 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 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 504) 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 504) 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 504) 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 504) 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 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) 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 504) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 504) 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 504) 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 504) 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 504) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 501) 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 501) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 499) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 499) seen :0
Running SMT prover for 499 properties.
[2023-03-15 21:49:56] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 21:49:56] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 21:50:03] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 21:50:34] [INFO ] After 37667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:499
[2023-03-15 21:50:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 21:51:09] [INFO ] After 22681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :499
[2023-03-15 21:51:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 21:51:36] [INFO ] After 27342ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :499
[2023-03-15 21:51:37] [INFO ] Deduced a trap composed of 18 places in 506 ms of which 14 ms to minimize.
[2023-03-15 21:51:38] [INFO ] Deduced a trap composed of 18 places in 450 ms of which 4 ms to minimize.
[2023-03-15 21:51:38] [INFO ] Deduced a trap composed of 13 places in 467 ms of which 3 ms to minimize.
[2023-03-15 21:51:39] [INFO ] Deduced a trap composed of 22 places in 454 ms of which 3 ms to minimize.
[2023-03-15 21:51:39] [INFO ] Deduced a trap composed of 23 places in 412 ms of which 2 ms to minimize.
[2023-03-15 21:51:39] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 2 ms to minimize.
[2023-03-15 21:51:40] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 1 ms to minimize.
[2023-03-15 21:51:40] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 2 ms to minimize.
[2023-03-15 21:51:41] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 1 ms to minimize.
[2023-03-15 21:51:41] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 1 ms to minimize.
[2023-03-15 21:51:42] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 1 ms to minimize.
[2023-03-15 21:51:42] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2023-03-15 21:51:43] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 1 ms to minimize.
[2023-03-15 21:51:43] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 1 ms to minimize.
[2023-03-15 21:51:43] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2023-03-15 21:51:44] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 1 ms to minimize.
[2023-03-15 21:51:44] [INFO ] Deduced a trap composed of 15 places in 353 ms of which 1 ms to minimize.
[2023-03-15 21:51:44] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:51:44] [INFO ] Deduced a trap composed of 18 places in 240 ms of which 0 ms to minimize.
[2023-03-15 21:51:45] [INFO ] Deduced a trap composed of 18 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:51:45] [INFO ] Deduced a trap composed of 31 places in 327 ms of which 2 ms to minimize.
[2023-03-15 21:51:46] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 1 ms to minimize.
[2023-03-15 21:51:46] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:51:46] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 1 ms to minimize.
[2023-03-15 21:51:47] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 1 ms to minimize.
[2023-03-15 21:51:47] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 1 ms to minimize.
[2023-03-15 21:51:47] [INFO ] Deduced a trap composed of 26 places in 325 ms of which 1 ms to minimize.
[2023-03-15 21:51:48] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 11099 ms
[2023-03-15 21:51:48] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:51:48] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:51:49] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 1 ms to minimize.
[2023-03-15 21:51:49] [INFO ] Deduced a trap composed of 12 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:51:50] [INFO ] Deduced a trap composed of 12 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:51:50] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 1 ms to minimize.
[2023-03-15 21:51:51] [INFO ] Deduced a trap composed of 58 places in 387 ms of which 2 ms to minimize.
[2023-03-15 21:51:51] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 5 ms to minimize.
[2023-03-15 21:51:51] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 0 ms to minimize.
[2023-03-15 21:51:52] [INFO ] Deduced a trap composed of 21 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:51:52] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:51:53] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:51:53] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 3 ms to minimize.
[2023-03-15 21:51:53] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 1 ms to minimize.
[2023-03-15 21:51:54] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 1 ms to minimize.
[2023-03-15 21:51:54] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:51:55] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 0 ms to minimize.
[2023-03-15 21:51:55] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2023-03-15 21:51:55] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 1 ms to minimize.
[2023-03-15 21:51:55] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2023-03-15 21:51:56] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 1 ms to minimize.
[2023-03-15 21:51:56] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 1 ms to minimize.
[2023-03-15 21:51:56] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 0 ms to minimize.
[2023-03-15 21:51:57] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 1 ms to minimize.
[2023-03-15 21:51:57] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 1 ms to minimize.
[2023-03-15 21:51:57] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 1 ms to minimize.
[2023-03-15 21:51:58] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-15 21:51:58] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2023-03-15 21:51:58] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 4 ms to minimize.
[2023-03-15 21:51:58] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 1 ms to minimize.
[2023-03-15 21:51:58] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 1 ms to minimize.
[2023-03-15 21:51:59] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2023-03-15 21:51:59] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 11096 ms
[2023-03-15 21:51:59] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 0 ms to minimize.
[2023-03-15 21:51:59] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2023-03-15 21:51:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2023-03-15 21:52:00] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 1 ms to minimize.
[2023-03-15 21:52:00] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 0 ms to minimize.
[2023-03-15 21:52:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2023-03-15 21:52:00] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 1 ms to minimize.
[2023-03-15 21:52:00] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 1 ms to minimize.
[2023-03-15 21:52:01] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 1 ms to minimize.
[2023-03-15 21:52:01] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 2 ms to minimize.
[2023-03-15 21:52:01] [INFO ] Deduced a trap composed of 38 places in 396 ms of which 2 ms to minimize.
[2023-03-15 21:52:02] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 2 ms to minimize.
[2023-03-15 21:52:02] [INFO ] Deduced a trap composed of 69 places in 405 ms of which 1 ms to minimize.
[2023-03-15 21:52:03] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 1 ms to minimize.
[2023-03-15 21:52:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2915 ms
[2023-03-15 21:52:03] [INFO ] Deduced a trap composed of 18 places in 358 ms of which 1 ms to minimize.
[2023-03-15 21:52:04] [INFO ] Deduced a trap composed of 36 places in 355 ms of which 1 ms to minimize.
[2023-03-15 21:52:04] [INFO ] Deduced a trap composed of 51 places in 370 ms of which 1 ms to minimize.
[2023-03-15 21:52:05] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:52:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1707 ms
[2023-03-15 21:52:05] [INFO ] Deduced a trap composed of 60 places in 389 ms of which 1 ms to minimize.
[2023-03-15 21:52:06] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 1 ms to minimize.
[2023-03-15 21:52:06] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2023-03-15 21:52:06] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 0 ms to minimize.
[2023-03-15 21:52:07] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-15 21:52:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1784 ms
[2023-03-15 21:52:07] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2023-03-15 21:52:07] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 0 ms to minimize.
[2023-03-15 21:52:08] [INFO ] Deduced a trap composed of 29 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:52:08] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 1 ms to minimize.
[2023-03-15 21:52:08] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 0 ms to minimize.
[2023-03-15 21:52:09] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 0 ms to minimize.
[2023-03-15 21:52:09] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 0 ms to minimize.
[2023-03-15 21:52:09] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 1 ms to minimize.
[2023-03-15 21:52:09] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 1 ms to minimize.
[2023-03-15 21:52:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2723 ms
[2023-03-15 21:52:10] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 1 ms to minimize.
[2023-03-15 21:52:10] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 1 ms to minimize.
[2023-03-15 21:52:10] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2023-03-15 21:52:11] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:52:11] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 0 ms to minimize.
[2023-03-15 21:52:11] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 1 ms to minimize.
[2023-03-15 21:52:12] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 1 ms to minimize.
[2023-03-15 21:52:12] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2023-03-15 21:52:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2295 ms
[2023-03-15 21:52:12] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 1 ms to minimize.
[2023-03-15 21:52:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-15 21:52:13] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2023-03-15 21:52:13] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2023-03-15 21:52:13] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 0 ms to minimize.
[2023-03-15 21:52:13] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 1 ms to minimize.
[2023-03-15 21:52:13] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2023-03-15 21:52:14] [INFO ] Deduced a trap composed of 36 places in 150 ms of which 0 ms to minimize.
[2023-03-15 21:52:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1216 ms
[2023-03-15 21:52:14] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 1 ms to minimize.
[2023-03-15 21:52:14] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 1 ms to minimize.
[2023-03-15 21:52:14] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 0 ms to minimize.
[2023-03-15 21:52:15] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 1 ms to minimize.
[2023-03-15 21:52:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 984 ms
[2023-03-15 21:52:15] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 0 ms to minimize.
[2023-03-15 21:52:15] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 1 ms to minimize.
[2023-03-15 21:52:16] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2023-03-15 21:52:16] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:52:16] [INFO ] Deduced a trap composed of 55 places in 335 ms of which 0 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 0 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 0 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 1 ms to minimize.
[2023-03-15 21:52:18] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2023-03-15 21:52:18] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 2 ms to minimize.
[2023-03-15 21:52:18] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 0 ms to minimize.
[2023-03-15 21:52:19] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:52:19] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 1 ms to minimize.
[2023-03-15 21:52:19] [INFO ] Deduced a trap composed of 22 places in 310 ms of which 0 ms to minimize.
[2023-03-15 21:52:19] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 1 ms to minimize.
[2023-03-15 21:52:20] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 1 ms to minimize.
[2023-03-15 21:52:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4951 ms
[2023-03-15 21:52:21] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 0 ms to minimize.
[2023-03-15 21:52:21] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 0 ms to minimize.
[2023-03-15 21:52:21] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 0 ms to minimize.
[2023-03-15 21:52:21] [INFO ] Deduced a trap composed of 34 places in 179 ms of which 1 ms to minimize.
[2023-03-15 21:52:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 961 ms
[2023-03-15 21:52:22] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 0 ms to minimize.
[2023-03-15 21:52:22] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 1 ms to minimize.
[2023-03-15 21:52:23] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 0 ms to minimize.
[2023-03-15 21:52:23] [INFO ] Deduced a trap composed of 36 places in 286 ms of which 0 ms to minimize.
[2023-03-15 21:52:23] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 0 ms to minimize.
[2023-03-15 21:52:23] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 1 ms to minimize.
[2023-03-15 21:52:24] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:52:24] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 1 ms to minimize.
[2023-03-15 21:52:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2566 ms
[2023-03-15 21:52:25] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2023-03-15 21:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-15 21:52:25] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 0 ms to minimize.
[2023-03-15 21:52:25] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 1 ms to minimize.
[2023-03-15 21:52:25] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 1 ms to minimize.
[2023-03-15 21:52:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 821 ms
[2023-03-15 21:52:26] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2023-03-15 21:52:27] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 1 ms to minimize.
[2023-03-15 21:52:27] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 1 ms to minimize.
[2023-03-15 21:52:27] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 1 ms to minimize.
[2023-03-15 21:52:28] [INFO ] Deduced a trap composed of 61 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:52:28] [INFO ] Deduced a trap composed of 48 places in 300 ms of which 0 ms to minimize.
[2023-03-15 21:52:28] [INFO ] Deduced a trap composed of 43 places in 336 ms of which 0 ms to minimize.
[2023-03-15 21:52:29] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2023-03-15 21:52:29] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2777 ms
[2023-03-15 21:52:30] [INFO ] Deduced a trap composed of 47 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:52:30] [INFO ] Deduced a trap composed of 65 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:52:31] [INFO ] Deduced a trap composed of 76 places in 387 ms of which 1 ms to minimize.
[2023-03-15 21:52:31] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 0 ms to minimize.
[2023-03-15 21:52:31] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 1 ms to minimize.
[2023-03-15 21:52:32] [INFO ] Deduced a trap composed of 61 places in 268 ms of which 0 ms to minimize.
[2023-03-15 21:52:32] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 1 ms to minimize.
[2023-03-15 21:52:32] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 0 ms to minimize.
[2023-03-15 21:52:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3263 ms
[2023-03-15 21:52:34] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 0 ms to minimize.
[2023-03-15 21:52:34] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 0 ms to minimize.
[2023-03-15 21:52:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 790 ms
[2023-03-15 21:52:35] [INFO ] Deduced a trap composed of 34 places in 371 ms of which 1 ms to minimize.
[2023-03-15 21:52:36] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 1 ms to minimize.
[2023-03-15 21:52:36] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 1 ms to minimize.
[2023-03-15 21:52:36] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 0 ms to minimize.
[2023-03-15 21:52:37] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 1 ms to minimize.
[2023-03-15 21:52:37] [INFO ] Deduced a trap composed of 52 places in 238 ms of which 0 ms to minimize.
[2023-03-15 21:52:37] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 0 ms to minimize.
[2023-03-15 21:52:37] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 1 ms to minimize.
[2023-03-15 21:52:38] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 0 ms to minimize.
[2023-03-15 21:52:38] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 0 ms to minimize.
[2023-03-15 21:52:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2932 ms
[2023-03-15 21:52:38] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 0 ms to minimize.
[2023-03-15 21:52:39] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-15 21:52:39] [INFO ] Deduced a trap composed of 22 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:52:40] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 1 ms to minimize.
[2023-03-15 21:52:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1796 ms
[2023-03-15 21:52:42] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 0 ms to minimize.
[2023-03-15 21:52:42] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 1 ms to minimize.
[2023-03-15 21:52:43] [INFO ] Deduced a trap composed of 28 places in 321 ms of which 0 ms to minimize.
[2023-03-15 21:52:43] [INFO ] Deduced a trap composed of 28 places in 311 ms of which 1 ms to minimize.
[2023-03-15 21:52:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1655 ms
[2023-03-15 21:52:44] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 1 ms to minimize.
[2023-03-15 21:52:45] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 0 ms to minimize.
[2023-03-15 21:52:45] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 1 ms to minimize.
[2023-03-15 21:52:45] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 1 ms to minimize.
[2023-03-15 21:52:45] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 0 ms to minimize.
[2023-03-15 21:52:46] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 1 ms to minimize.
[2023-03-15 21:52:46] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 1 ms to minimize.
[2023-03-15 21:52:46] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 0 ms to minimize.
[2023-03-15 21:52:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6823 ms
[2023-03-15 21:52:52] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-15 21:52:52] [INFO ] Deduced a trap composed of 46 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:52:53] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 1 ms to minimize.
[2023-03-15 21:52:53] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 1 ms to minimize.
[2023-03-15 21:52:54] [INFO ] Deduced a trap composed of 38 places in 288 ms of which 1 ms to minimize.
[2023-03-15 21:52:55] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 1 ms to minimize.
[2023-03-15 21:52:55] [INFO ] Deduced a trap composed of 91 places in 382 ms of which 1 ms to minimize.
[2023-03-15 21:52:56] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 1 ms to minimize.
[2023-03-15 21:52:56] [INFO ] Deduced a trap composed of 15 places in 402 ms of which 1 ms to minimize.
[2023-03-15 21:52:57] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 1 ms to minimize.
[2023-03-15 21:52:57] [INFO ] Deduced a trap composed of 38 places in 386 ms of which 1 ms to minimize.
[2023-03-15 21:52:58] [INFO ] Deduced a trap composed of 55 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:52:59] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 0 ms to minimize.
[2023-03-15 21:53:00] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-15 21:53:00] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 0 ms to minimize.
[2023-03-15 21:53:00] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 1 ms to minimize.
[2023-03-15 21:53:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 8997 ms
[2023-03-15 21:53:01] [INFO ] Deduced a trap composed of 47 places in 142 ms of which 0 ms to minimize.
[2023-03-15 21:53:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-15 21:53:02] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 1 ms to minimize.
[2023-03-15 21:53:02] [INFO ] Deduced a trap composed of 48 places in 153 ms of which 1 ms to minimize.
[2023-03-15 21:53:03] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 1 ms to minimize.
[2023-03-15 21:53:03] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2023-03-15 21:53:03] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 1 ms to minimize.
[2023-03-15 21:53:04] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 1 ms to minimize.
[2023-03-15 21:53:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2167 ms
[2023-03-15 21:53:05] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 1 ms to minimize.
[2023-03-15 21:53:05] [INFO ] Deduced a trap composed of 53 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:53:06] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2023-03-15 21:53:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1190 ms
[2023-03-15 21:53:07] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 0 ms to minimize.
[2023-03-15 21:53:07] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 0 ms to minimize.
[2023-03-15 21:53:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 847 ms
[2023-03-15 21:53:08] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 1 ms to minimize.
[2023-03-15 21:53:08] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 0 ms to minimize.
[2023-03-15 21:53:08] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 0 ms to minimize.
[2023-03-15 21:53:09] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:53:09] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 0 ms to minimize.
[2023-03-15 21:53:09] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 1 ms to minimize.
[2023-03-15 21:53:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1448 ms
[2023-03-15 21:53:10] [INFO ] Deduced a trap composed of 50 places in 285 ms of which 1 ms to minimize.
[2023-03-15 21:53:10] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 1 ms to minimize.
[2023-03-15 21:53:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2023-03-15 21:53:12] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 1 ms to minimize.
[2023-03-15 21:53:12] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 1 ms to minimize.
[2023-03-15 21:53:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2023-03-15 21:53:14] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 0 ms to minimize.
[2023-03-15 21:53:14] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2023-03-15 21:53:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2023-03-15 21:53:15] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 1 ms to minimize.
[2023-03-15 21:53:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-15 21:53:17] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2023-03-15 21:53:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-15 21:53:19] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 1 ms to minimize.
[2023-03-15 21:53:20] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2023-03-15 21:53:20] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2023-03-15 21:53:21] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 0 ms to minimize.
[2023-03-15 21:53:21] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2023-03-15 21:53:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2406 ms
[2023-03-15 21:53:22] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2023-03-15 21:53:22] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2023-03-15 21:53:22] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 1 ms to minimize.
[2023-03-15 21:53:23] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 1 ms to minimize.
[2023-03-15 21:53:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1208 ms
[2023-03-15 21:53:25] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 0 ms to minimize.
[2023-03-15 21:53:26] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 1 ms to minimize.
[2023-03-15 21:53:26] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 7 ms to minimize.
[2023-03-15 21:53:27] [INFO ] Deduced a trap composed of 54 places in 351 ms of which 1 ms to minimize.
[2023-03-15 21:53:27] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 1 ms to minimize.
[2023-03-15 21:53:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1916 ms
[2023-03-15 21:53:28] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 1 ms to minimize.
[2023-03-15 21:53:28] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 1 ms to minimize.
[2023-03-15 21:53:28] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 1 ms to minimize.
[2023-03-15 21:53:28] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:53:28] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 0 ms to minimize.
[2023-03-15 21:53:29] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2023-03-15 21:53:38] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 10247 ms
[2023-03-15 21:53:39] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 2 ms to minimize.
[2023-03-15 21:53:39] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 2 ms to minimize.
[2023-03-15 21:53:39] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 1 ms to minimize.
[2023-03-15 21:53:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 820 ms
[2023-03-15 21:53:40] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 1 ms to minimize.
[2023-03-15 21:53:40] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2023-03-15 21:53:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 632 ms
[2023-03-15 21:53:41] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 1 ms to minimize.
[2023-03-15 21:53:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-15 21:53:43] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 1 ms to minimize.
[2023-03-15 21:53:43] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 0 ms to minimize.
[2023-03-15 21:53:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 520 ms
[2023-03-15 21:53:44] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 0 ms to minimize.
[2023-03-15 21:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 21:53:44] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 0 ms to minimize.
[2023-03-15 21:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-15 21:53:45] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 1 ms to minimize.
[2023-03-15 21:53:45] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 1 ms to minimize.
[2023-03-15 21:53:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2023-03-15 21:53:46] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 0 ms to minimize.
[2023-03-15 21:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-15 21:53:47] [INFO ] Deduced a trap composed of 76 places in 309 ms of which 1 ms to minimize.
[2023-03-15 21:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-15 21:53:51] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 1 ms to minimize.
[2023-03-15 21:53:51] [INFO ] Deduced a trap composed of 61 places in 350 ms of which 1 ms to minimize.
[2023-03-15 21:53:52] [INFO ] Deduced a trap composed of 61 places in 331 ms of which 1 ms to minimize.
[2023-03-15 21:53:52] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-15 21:53:52] [INFO ] Deduced a trap composed of 55 places in 329 ms of which 1 ms to minimize.
[2023-03-15 21:53:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1541 ms
[2023-03-15 21:53:53] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2023-03-15 21:53:54] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2023-03-15 21:53:54] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2023-03-15 21:53:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 582 ms
[2023-03-15 21:53:55] [INFO ] Deduced a trap composed of 60 places in 194 ms of which 1 ms to minimize.
[2023-03-15 21:53:55] [INFO ] Deduced a trap composed of 54 places in 282 ms of which 1 ms to minimize.
[2023-03-15 21:53:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2023-03-15 21:53:56] [INFO ] Deduced a trap composed of 53 places in 248 ms of which 1 ms to minimize.
[2023-03-15 21:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-15 21:53:56] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 0 ms to minimize.
[2023-03-15 21:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-15 21:53:57] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 1 ms to minimize.
[2023-03-15 21:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-15 21:53:59] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 0 ms to minimize.
[2023-03-15 21:53:59] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 0 ms to minimize.
[2023-03-15 21:53:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-15 21:54:04] [INFO ] Deduced a trap composed of 60 places in 292 ms of which 1 ms to minimize.
[2023-03-15 21:54:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2023-03-15 21:54:06] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 1 ms to minimize.
[2023-03-15 21:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 992 ms
[2023-03-15 21:54:08] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 1 ms to minimize.
[2023-03-15 21:54:08] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2023-03-15 21:54:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 616 ms
[2023-03-15 21:54:12] [INFO ] Deduced a trap composed of 44 places in 344 ms of which 1 ms to minimize.
[2023-03-15 21:54:13] [INFO ] Deduced a trap composed of 20 places in 367 ms of which 1 ms to minimize.
[2023-03-15 21:54:13] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 0 ms to minimize.
[2023-03-15 21:54:14] [INFO ] Deduced a trap composed of 34 places in 316 ms of which 1 ms to minimize.
[2023-03-15 21:54:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2115 ms
[2023-03-15 21:54:14] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 0 ms to minimize.
[2023-03-15 21:54:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2023-03-15 21:54:15] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 1 ms to minimize.
[2023-03-15 21:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2023-03-15 21:54:15] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 0 ms to minimize.
[2023-03-15 21:54:16] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 1 ms to minimize.
[2023-03-15 21:54:16] [INFO ] Deduced a trap composed of 62 places in 272 ms of which 1 ms to minimize.
[2023-03-15 21:54:16] [INFO ] Deduced a trap composed of 76 places in 287 ms of which 1 ms to minimize.
[2023-03-15 21:54:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1470 ms
[2023-03-15 21:54:18] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 1 ms to minimize.
[2023-03-15 21:54:19] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 1 ms to minimize.
[2023-03-15 21:54:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 869 ms
[2023-03-15 21:54:19] [INFO ] After 189921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :498
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 21:54:19] [INFO ] After 225026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :498
Fused 499 Parikh solutions to 470 different solutions.
Parikh walk visited 7 properties in 15064 ms.
Support contains 309 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 28 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 382912 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 450) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 447) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 447) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 446) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 444) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 444) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 444) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 444) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 444) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 442) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 442) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 433) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 427) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 426) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 425) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 420) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 416) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 404) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 399) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 397) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 394) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 391) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 391) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 388) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 386) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 385) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 385) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 385) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 383) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 383) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 381) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 381) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 379) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 379) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 379) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 377) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 377) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 375) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 375) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 374) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 374) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 373) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 373) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 371) 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 371) 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 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 371) 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 371) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 369) 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 369) 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 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 369) 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 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 369) 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 369) 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 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 369) 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 369) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 369) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) 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 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 368) 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 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) 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 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 368) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 368) seen :0
Running SMT prover for 368 properties.
[2023-03-15 21:55:18] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 21:55:18] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 21:55:24] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 21:55:44] [INFO ] After 15466ms SMT Verify possible using state equation in real domain returned unsat :0 sat :25 real:343
[2023-03-15 21:55:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 21:55:45] [INFO ] After 1049ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:368
[2023-03-15 21:55:45] [INFO ] After 26597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:368
[2023-03-15 21:55:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 21:56:01] [INFO ] After 10396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :368
[2023-03-15 21:56:14] [INFO ] After 12979ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :368
[2023-03-15 21:56:15] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 1 ms to minimize.
[2023-03-15 21:56:15] [INFO ] Deduced a trap composed of 44 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:56:16] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 0 ms to minimize.
[2023-03-15 21:56:16] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 1 ms to minimize.
[2023-03-15 21:56:16] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-15 21:56:17] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 0 ms to minimize.
[2023-03-15 21:56:17] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2023-03-15 21:56:17] [INFO ] Deduced a trap composed of 37 places in 402 ms of which 1 ms to minimize.
[2023-03-15 21:56:18] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 1 ms to minimize.
[2023-03-15 21:56:18] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 0 ms to minimize.
[2023-03-15 21:56:18] [INFO ] Deduced a trap composed of 40 places in 372 ms of which 1 ms to minimize.
[2023-03-15 21:56:19] [INFO ] Deduced a trap composed of 45 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:56:19] [INFO ] Deduced a trap composed of 92 places in 401 ms of which 1 ms to minimize.
[2023-03-15 21:56:20] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 1 ms to minimize.
[2023-03-15 21:56:20] [INFO ] Deduced a trap composed of 61 places in 411 ms of which 1 ms to minimize.
[2023-03-15 21:56:21] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 1 ms to minimize.
[2023-03-15 21:56:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6236 ms
[2023-03-15 21:56:21] [INFO ] Deduced a trap composed of 24 places in 378 ms of which 1 ms to minimize.
[2023-03-15 21:56:22] [INFO ] Deduced a trap composed of 37 places in 376 ms of which 1 ms to minimize.
[2023-03-15 21:56:22] [INFO ] Deduced a trap composed of 29 places in 419 ms of which 1 ms to minimize.
[2023-03-15 21:56:23] [INFO ] Deduced a trap composed of 32 places in 407 ms of which 1 ms to minimize.
[2023-03-15 21:56:23] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:56:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2297 ms
[2023-03-15 21:56:24] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 1 ms to minimize.
[2023-03-15 21:56:24] [INFO ] Deduced a trap composed of 35 places in 375 ms of which 1 ms to minimize.
[2023-03-15 21:56:25] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 1 ms to minimize.
[2023-03-15 21:56:25] [INFO ] Deduced a trap composed of 22 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:56:26] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 1 ms to minimize.
[2023-03-15 21:56:26] [INFO ] Deduced a trap composed of 37 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:56:27] [INFO ] Deduced a trap composed of 22 places in 402 ms of which 1 ms to minimize.
[2023-03-15 21:56:27] [INFO ] Deduced a trap composed of 35 places in 379 ms of which 1 ms to minimize.
[2023-03-15 21:56:27] [INFO ] Deduced a trap composed of 21 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:56:28] [INFO ] Deduced a trap composed of 28 places in 375 ms of which 0 ms to minimize.
[2023-03-15 21:56:28] [INFO ] Deduced a trap composed of 48 places in 384 ms of which 1 ms to minimize.
[2023-03-15 21:56:29] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 1 ms to minimize.
[2023-03-15 21:56:29] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:56:30] [INFO ] Deduced a trap composed of 41 places in 405 ms of which 1 ms to minimize.
[2023-03-15 21:56:30] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 1 ms to minimize.
[2023-03-15 21:56:30] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 1 ms to minimize.
[2023-03-15 21:56:31] [INFO ] Deduced a trap composed of 12 places in 405 ms of which 1 ms to minimize.
[2023-03-15 21:56:31] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 0 ms to minimize.
[2023-03-15 21:56:32] [INFO ] Deduced a trap composed of 42 places in 380 ms of which 1 ms to minimize.
[2023-03-15 21:56:32] [INFO ] Deduced a trap composed of 53 places in 379 ms of which 1 ms to minimize.
[2023-03-15 21:56:33] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 1 ms to minimize.
[2023-03-15 21:56:33] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 9278 ms
[2023-03-15 21:56:33] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:56:33] [INFO ] Deduced a trap composed of 67 places in 276 ms of which 1 ms to minimize.
[2023-03-15 21:56:34] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 0 ms to minimize.
[2023-03-15 21:56:34] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 1 ms to minimize.
[2023-03-15 21:56:35] [INFO ] Deduced a trap composed of 29 places in 360 ms of which 1 ms to minimize.
[2023-03-15 21:56:35] [INFO ] Deduced a trap composed of 27 places in 344 ms of which 1 ms to minimize.
[2023-03-15 21:56:36] [INFO ] Deduced a trap composed of 20 places in 373 ms of which 1 ms to minimize.
[2023-03-15 21:56:36] [INFO ] Deduced a trap composed of 20 places in 349 ms of which 1 ms to minimize.
[2023-03-15 21:56:36] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 1 ms to minimize.
[2023-03-15 21:56:37] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 1 ms to minimize.
[2023-03-15 21:56:37] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:56:38] [INFO ] Deduced a trap composed of 26 places in 469 ms of which 1 ms to minimize.
[2023-03-15 21:56:38] [INFO ] Deduced a trap composed of 10 places in 404 ms of which 1 ms to minimize.
[2023-03-15 21:56:39] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 1 ms to minimize.
[2023-03-15 21:56:39] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 0 ms to minimize.
[2023-03-15 21:56:39] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 1 ms to minimize.
[2023-03-15 21:56:40] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:56:40] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 1 ms to minimize.
[2023-03-15 21:56:40] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 1 ms to minimize.
[2023-03-15 21:56:41] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 1 ms to minimize.
[2023-03-15 21:56:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8191 ms
[2023-03-15 21:56:42] [INFO ] Deduced a trap composed of 47 places in 420 ms of which 1 ms to minimize.
[2023-03-15 21:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2023-03-15 21:56:42] [INFO ] Deduced a trap composed of 52 places in 335 ms of which 1 ms to minimize.
[2023-03-15 21:56:43] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 1 ms to minimize.
[2023-03-15 21:56:43] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 1 ms to minimize.
[2023-03-15 21:56:43] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 0 ms to minimize.
[2023-03-15 21:56:44] [INFO ] Deduced a trap composed of 64 places in 302 ms of which 1 ms to minimize.
[2023-03-15 21:56:44] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 0 ms to minimize.
[2023-03-15 21:56:44] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 0 ms to minimize.
[2023-03-15 21:56:44] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:56:45] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 1 ms to minimize.
[2023-03-15 21:56:45] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 1 ms to minimize.
[2023-03-15 21:56:45] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 0 ms to minimize.
[2023-03-15 21:56:46] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 1 ms to minimize.
[2023-03-15 21:56:46] [INFO ] Deduced a trap composed of 50 places in 301 ms of which 1 ms to minimize.
[2023-03-15 21:56:46] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2023-03-15 21:56:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4628 ms
[2023-03-15 21:56:47] [INFO ] Deduced a trap composed of 18 places in 458 ms of which 1 ms to minimize.
[2023-03-15 21:56:48] [INFO ] Deduced a trap composed of 13 places in 449 ms of which 1 ms to minimize.
[2023-03-15 21:56:48] [INFO ] Deduced a trap composed of 13 places in 451 ms of which 1 ms to minimize.
[2023-03-15 21:56:49] [INFO ] Deduced a trap composed of 13 places in 449 ms of which 1 ms to minimize.
[2023-03-15 21:56:49] [INFO ] Deduced a trap composed of 20 places in 425 ms of which 1 ms to minimize.
[2023-03-15 21:56:49] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 1 ms to minimize.
[2023-03-15 21:56:50] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 1 ms to minimize.
[2023-03-15 21:56:50] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 1 ms to minimize.
[2023-03-15 21:56:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3763 ms
[2023-03-15 21:56:51] [INFO ] Deduced a trap composed of 20 places in 434 ms of which 1 ms to minimize.
[2023-03-15 21:56:51] [INFO ] Deduced a trap composed of 38 places in 323 ms of which 0 ms to minimize.
[2023-03-15 21:56:52] [INFO ] Deduced a trap composed of 31 places in 347 ms of which 1 ms to minimize.
[2023-03-15 21:56:52] [INFO ] Deduced a trap composed of 38 places in 419 ms of which 1 ms to minimize.
[2023-03-15 21:56:53] [INFO ] Deduced a trap composed of 12 places in 426 ms of which 1 ms to minimize.
[2023-03-15 21:56:53] [INFO ] Deduced a trap composed of 13 places in 432 ms of which 1 ms to minimize.
[2023-03-15 21:56:54] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 1 ms to minimize.
[2023-03-15 21:56:54] [INFO ] Deduced a trap composed of 29 places in 337 ms of which 1 ms to minimize.
[2023-03-15 21:56:54] [INFO ] Deduced a trap composed of 28 places in 328 ms of which 0 ms to minimize.
[2023-03-15 21:56:55] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2023-03-15 21:56:55] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 1 ms to minimize.
[2023-03-15 21:56:55] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 1 ms to minimize.
[2023-03-15 21:56:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5015 ms
[2023-03-15 21:56:56] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 1 ms to minimize.
[2023-03-15 21:56:56] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 1 ms to minimize.
[2023-03-15 21:56:56] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 0 ms to minimize.
[2023-03-15 21:56:57] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2023-03-15 21:56:57] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 1 ms to minimize.
[2023-03-15 21:56:57] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 1 ms to minimize.
[2023-03-15 21:56:58] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 1 ms to minimize.
[2023-03-15 21:56:58] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 1 ms to minimize.
[2023-03-15 21:56:58] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 1 ms to minimize.
[2023-03-15 21:56:58] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 1 ms to minimize.
[2023-03-15 21:56:59] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2023-03-15 21:56:59] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 0 ms to minimize.
[2023-03-15 21:56:59] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 0 ms to minimize.
[2023-03-15 21:56:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3405 ms
[2023-03-15 21:56:59] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 0 ms to minimize.
[2023-03-15 21:56:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 21:57:00] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-15 21:57:00] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 1 ms to minimize.
[2023-03-15 21:57:00] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 1 ms to minimize.
[2023-03-15 21:57:00] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2023-03-15 21:57:00] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 0 ms to minimize.
[2023-03-15 21:57:01] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 0 ms to minimize.
[2023-03-15 21:57:01] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 0 ms to minimize.
[2023-03-15 21:57:01] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-15 21:57:01] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 1 ms to minimize.
[2023-03-15 21:57:01] [INFO ] Deduced a trap composed of 58 places in 147 ms of which 1 ms to minimize.
[2023-03-15 21:57:02] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 0 ms to minimize.
[2023-03-15 21:57:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2242 ms
[2023-03-15 21:57:02] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 0 ms to minimize.
[2023-03-15 21:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-15 21:57:02] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2023-03-15 21:57:02] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2023-03-15 21:57:02] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2023-03-15 21:57:02] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2023-03-15 21:57:03] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2023-03-15 21:57:03] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 0 ms to minimize.
[2023-03-15 21:57:03] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 0 ms to minimize.
[2023-03-15 21:57:03] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 1 ms to minimize.
[2023-03-15 21:57:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1626 ms
[2023-03-15 21:57:04] [INFO ] Deduced a trap composed of 72 places in 225 ms of which 1 ms to minimize.
[2023-03-15 21:57:04] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 0 ms to minimize.
[2023-03-15 21:57:04] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 1 ms to minimize.
[2023-03-15 21:57:05] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:57:05] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:57:05] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 1 ms to minimize.
[2023-03-15 21:57:06] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 0 ms to minimize.
[2023-03-15 21:57:06] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 0 ms to minimize.
[2023-03-15 21:57:06] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 4 ms to minimize.
[2023-03-15 21:57:06] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2023-03-15 21:57:07] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 1 ms to minimize.
[2023-03-15 21:57:07] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2023-03-15 21:57:07] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2023-03-15 21:57:07] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2023-03-15 21:57:08] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 0 ms to minimize.
[2023-03-15 21:57:08] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2023-03-15 21:57:08] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2023-03-15 21:57:08] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 1 ms to minimize.
[2023-03-15 21:57:08] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 1 ms to minimize.
[2023-03-15 21:57:08] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4650 ms
[2023-03-15 21:57:09] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 1 ms to minimize.
[2023-03-15 21:57:09] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 0 ms to minimize.
[2023-03-15 21:57:09] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 0 ms to minimize.
[2023-03-15 21:57:09] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 1 ms to minimize.
[2023-03-15 21:57:10] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 1 ms to minimize.
[2023-03-15 21:57:10] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2023-03-15 21:57:10] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 1 ms to minimize.
[2023-03-15 21:57:11] [INFO ] Deduced a trap composed of 24 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:57:11] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 0 ms to minimize.
[2023-03-15 21:57:11] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2023-03-15 21:57:12] [INFO ] Deduced a trap composed of 41 places in 384 ms of which 1 ms to minimize.
[2023-03-15 21:57:12] [INFO ] Deduced a trap composed of 46 places in 277 ms of which 1 ms to minimize.
[2023-03-15 21:57:12] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 0 ms to minimize.
[2023-03-15 21:57:13] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 0 ms to minimize.
[2023-03-15 21:57:13] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:57:13] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2023-03-15 21:57:13] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2023-03-15 21:57:14] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 0 ms to minimize.
[2023-03-15 21:57:14] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 1 ms to minimize.
[2023-03-15 21:57:14] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 0 ms to minimize.
[2023-03-15 21:57:14] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 1 ms to minimize.
[2023-03-15 21:57:14] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 1 ms to minimize.
[2023-03-15 21:57:15] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6090 ms
[2023-03-15 21:57:15] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-15 21:57:15] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2023-03-15 21:57:15] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 1 ms to minimize.
[2023-03-15 21:57:15] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
[2023-03-15 21:57:16] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 1 ms to minimize.
[2023-03-15 21:57:16] [INFO ] Deduced a trap composed of 39 places in 192 ms of which 0 ms to minimize.
[2023-03-15 21:57:16] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 1 ms to minimize.
[2023-03-15 21:57:16] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 0 ms to minimize.
[2023-03-15 21:57:16] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 1 ms to minimize.
[2023-03-15 21:57:17] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 0 ms to minimize.
[2023-03-15 21:57:17] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2023-03-15 21:57:17] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 1 ms to minimize.
[2023-03-15 21:57:18] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 0 ms to minimize.
[2023-03-15 21:57:18] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 0 ms to minimize.
[2023-03-15 21:57:18] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 1 ms to minimize.
[2023-03-15 21:57:18] [INFO ] Deduced a trap composed of 75 places in 231 ms of which 1 ms to minimize.
[2023-03-15 21:57:19] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 1 ms to minimize.
[2023-03-15 21:57:19] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 0 ms to minimize.
[2023-03-15 21:57:19] [INFO ] Deduced a trap composed of 69 places in 322 ms of which 1 ms to minimize.
[2023-03-15 21:57:20] [INFO ] Deduced a trap composed of 47 places in 333 ms of which 1 ms to minimize.
[2023-03-15 21:57:20] [INFO ] Deduced a trap composed of 47 places in 352 ms of which 1 ms to minimize.
[2023-03-15 21:57:20] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5487 ms
[2023-03-15 21:57:21] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2023-03-15 21:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2023-03-15 21:57:21] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 0 ms to minimize.
[2023-03-15 21:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-15 21:57:22] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 1 ms to minimize.
[2023-03-15 21:57:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 446 ms
[2023-03-15 21:57:22] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 0 ms to minimize.
[2023-03-15 21:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-15 21:57:23] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 1 ms to minimize.
[2023-03-15 21:57:23] [INFO ] Deduced a trap composed of 34 places in 306 ms of which 1 ms to minimize.
[2023-03-15 21:57:24] [INFO ] Deduced a trap composed of 19 places in 346 ms of which 1 ms to minimize.
[2023-03-15 21:57:24] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 1 ms to minimize.
[2023-03-15 21:57:24] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 1 ms to minimize.
[2023-03-15 21:57:25] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 0 ms to minimize.
[2023-03-15 21:57:25] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 1 ms to minimize.
[2023-03-15 21:57:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2365 ms
[2023-03-15 21:57:25] [INFO ] Deduced a trap composed of 17 places in 338 ms of which 1 ms to minimize.
[2023-03-15 21:57:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2023-03-15 21:57:26] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 1 ms to minimize.
[2023-03-15 21:57:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2023-03-15 21:57:27] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 1 ms to minimize.
[2023-03-15 21:57:27] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 0 ms to minimize.
[2023-03-15 21:57:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 751 ms
[2023-03-15 21:57:27] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 0 ms to minimize.
[2023-03-15 21:57:28] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 0 ms to minimize.
[2023-03-15 21:57:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
[2023-03-15 21:57:28] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 0 ms to minimize.
[2023-03-15 21:57:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-15 21:57:29] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 1 ms to minimize.
[2023-03-15 21:57:29] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 0 ms to minimize.
[2023-03-15 21:57:29] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2023-03-15 21:57:29] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 0 ms to minimize.
[2023-03-15 21:57:30] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 0 ms to minimize.
[2023-03-15 21:57:30] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 0 ms to minimize.
[2023-03-15 21:57:30] [INFO ] Deduced a trap composed of 61 places in 267 ms of which 1 ms to minimize.
[2023-03-15 21:57:30] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 1 ms to minimize.
[2023-03-15 21:57:31] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
[2023-03-15 21:57:31] [INFO ] Deduced a trap composed of 66 places in 300 ms of which 1 ms to minimize.
[2023-03-15 21:57:31] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 1 ms to minimize.
[2023-03-15 21:57:31] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 0 ms to minimize.
[2023-03-15 21:57:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2941 ms
[2023-03-15 21:57:32] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 1 ms to minimize.
[2023-03-15 21:57:32] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:57:32] [INFO ] Deduced a trap composed of 22 places in 178 ms of which 1 ms to minimize.
[2023-03-15 21:57:33] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2023-03-15 21:57:35] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2023-03-15 21:57:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3758 ms
[2023-03-15 21:57:36] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 0 ms to minimize.
[2023-03-15 21:57:36] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 1 ms to minimize.
[2023-03-15 21:57:36] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-15 21:57:36] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 0 ms to minimize.
[2023-03-15 21:57:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 907 ms
[2023-03-15 21:57:37] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 1 ms to minimize.
[2023-03-15 21:57:37] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 1 ms to minimize.
[2023-03-15 21:57:37] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 0 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2023-03-15 21:57:38] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2023-03-15 21:57:39] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 0 ms to minimize.
[2023-03-15 21:57:39] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 0 ms to minimize.
[2023-03-15 21:57:39] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2023-03-15 21:57:39] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 1 ms to minimize.
[2023-03-15 21:57:39] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 1 ms to minimize.
[2023-03-15 21:57:40] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2023-03-15 21:57:40] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 1 ms to minimize.
[2023-03-15 21:57:40] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 1 ms to minimize.
[2023-03-15 21:57:40] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3361 ms
[2023-03-15 21:57:40] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 1 ms to minimize.
[2023-03-15 21:57:41] [INFO ] Deduced a trap composed of 15 places in 256 ms of which 1 ms to minimize.
[2023-03-15 21:57:42] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 0 ms to minimize.
[2023-03-15 21:57:42] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 1 ms to minimize.
[2023-03-15 21:57:42] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:57:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1480 ms
[2023-03-15 21:57:43] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2023-03-15 21:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 21:57:44] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 1 ms to minimize.
[2023-03-15 21:57:44] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 0 ms to minimize.
[2023-03-15 21:57:44] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2023-03-15 21:57:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1119 ms
[2023-03-15 21:57:45] [INFO ] Deduced a trap composed of 49 places in 248 ms of which 0 ms to minimize.
[2023-03-15 21:57:45] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 1 ms to minimize.
[2023-03-15 21:57:45] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 1 ms to minimize.
[2023-03-15 21:57:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 772 ms
[2023-03-15 21:57:46] [INFO ] Deduced a trap composed of 54 places in 341 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 24 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 0 ms to minimize.
[2023-03-15 21:57:47] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 0 ms to minimize.
[2023-03-15 21:57:48] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 1 ms to minimize.
[2023-03-15 21:57:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1556 ms
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 0 ms to minimize.
[2023-03-15 21:57:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-15 21:57:49] [INFO ] Deduced a trap composed of 20 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:57:50] [INFO ] Deduced a trap composed of 31 places in 230 ms of which 1 ms to minimize.
[2023-03-15 21:57:50] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 1 ms to minimize.
[2023-03-15 21:57:50] [INFO ] Deduced a trap composed of 46 places in 172 ms of which 1 ms to minimize.
[2023-03-15 21:57:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1040 ms
[2023-03-15 21:57:50] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 1 ms to minimize.
[2023-03-15 21:57:51] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 0 ms to minimize.
[2023-03-15 21:57:51] [INFO ] Deduced a trap composed of 21 places in 239 ms of which 1 ms to minimize.
[2023-03-15 21:57:51] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2023-03-15 21:57:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1283 ms
[2023-03-15 21:57:52] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 0 ms to minimize.
[2023-03-15 21:57:52] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2023-03-15 21:57:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2023-03-15 21:57:53] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2023-03-15 21:57:53] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2023-03-15 21:57:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 567 ms
[2023-03-15 21:57:54] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 1 ms to minimize.
[2023-03-15 21:57:54] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2023-03-15 21:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2023-03-15 21:57:54] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2023-03-15 21:57:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-15 21:57:55] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2023-03-15 21:57:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-15 21:57:56] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 1 ms to minimize.
[2023-03-15 21:57:57] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 1 ms to minimize.
[2023-03-15 21:57:57] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 0 ms to minimize.
[2023-03-15 21:57:57] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 1 ms to minimize.
[2023-03-15 21:57:57] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 1 ms to minimize.
[2023-03-15 21:57:57] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 0 ms to minimize.
[2023-03-15 21:57:58] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2023-03-15 21:57:58] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 0 ms to minimize.
[2023-03-15 21:57:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1812 ms
[2023-03-15 21:58:00] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 0 ms to minimize.
[2023-03-15 21:58:00] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 1 ms to minimize.
[2023-03-15 21:58:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2023-03-15 21:58:00] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2023-03-15 21:58:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 27 places in 251 ms of which 1 ms to minimize.
[2023-03-15 21:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 354 ms
[2023-03-15 21:58:02] [INFO ] Deduced a trap composed of 34 places in 417 ms of which 1 ms to minimize.
[2023-03-15 21:58:03] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 1 ms to minimize.
[2023-03-15 21:58:03] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 0 ms to minimize.
[2023-03-15 21:58:03] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2023-03-15 21:58:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1484 ms
[2023-03-15 21:58:04] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 0 ms to minimize.
[2023-03-15 21:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 433 ms
[2023-03-15 21:58:05] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 1 ms to minimize.
[2023-03-15 21:58:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-15 21:58:06] [INFO ] Deduced a trap composed of 36 places in 300 ms of which 0 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 20 places in 260 ms of which 1 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 20 places in 351 ms of which 1 ms to minimize.
[2023-03-15 21:58:07] [INFO ] Deduced a trap composed of 20 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 22 places in 335 ms of which 0 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 20 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:58:08] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 0 ms to minimize.
[2023-03-15 21:58:09] [INFO ] Deduced a trap composed of 36 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:58:09] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 1 ms to minimize.
[2023-03-15 21:58:09] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 1 ms to minimize.
[2023-03-15 21:58:10] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 1 ms to minimize.
[2023-03-15 21:58:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4352 ms
[2023-03-15 21:58:11] [INFO ] Deduced a trap composed of 18 places in 439 ms of which 1 ms to minimize.
[2023-03-15 21:58:11] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 1 ms to minimize.
[2023-03-15 21:58:12] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 1 ms to minimize.
[2023-03-15 21:58:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1257 ms
[2023-03-15 21:58:13] [INFO ] Deduced a trap composed of 28 places in 308 ms of which 1 ms to minimize.
[2023-03-15 21:58:13] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 1 ms to minimize.
[2023-03-15 21:58:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1162 ms
[2023-03-15 21:58:16] [INFO ] Deduced a trap composed of 50 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:58:16] [INFO ] Deduced a trap composed of 34 places in 294 ms of which 1 ms to minimize.
[2023-03-15 21:58:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1032 ms
[2023-03-15 21:58:18] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 1 ms to minimize.
[2023-03-15 21:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-15 21:58:18] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 1 ms to minimize.
[2023-03-15 21:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 415 ms
[2023-03-15 21:58:20] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2023-03-15 21:58:20] [INFO ] Deduced a trap composed of 54 places in 391 ms of which 1 ms to minimize.
[2023-03-15 21:58:21] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:58:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1133 ms
[2023-03-15 21:58:22] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 1 ms to minimize.
[2023-03-15 21:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2023-03-15 21:58:23] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 0 ms to minimize.
[2023-03-15 21:58:24] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 1 ms to minimize.
[2023-03-15 21:58:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-03-15 21:58:24] [INFO ] Deduced a trap composed of 22 places in 368 ms of which 1 ms to minimize.
[2023-03-15 21:58:25] [INFO ] Deduced a trap composed of 26 places in 410 ms of which 1 ms to minimize.
[2023-03-15 21:58:25] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 1 ms to minimize.
[2023-03-15 21:58:26] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 1 ms to minimize.
[2023-03-15 21:58:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1763 ms
[2023-03-15 21:58:29] [INFO ] Deduced a trap composed of 14 places in 397 ms of which 1 ms to minimize.
[2023-03-15 21:58:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 513 ms
[2023-03-15 21:58:30] [INFO ] Deduced a trap composed of 28 places in 342 ms of which 1 ms to minimize.
[2023-03-15 21:58:31] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 1 ms to minimize.
[2023-03-15 21:58:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 830 ms
[2023-03-15 21:58:34] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-15 21:58:34] [INFO ] Deduced a trap composed of 43 places in 327 ms of which 0 ms to minimize.
[2023-03-15 21:58:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-15 21:58:38] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 0 ms to minimize.
[2023-03-15 21:58:39] [INFO ] Deduced a trap composed of 55 places in 198 ms of which 1 ms to minimize.
[2023-03-15 21:58:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 581 ms
[2023-03-15 21:58:41] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 1 ms to minimize.
[2023-03-15 21:58:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-15 21:58:44] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2023-03-15 21:58:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-15 21:58:45] [INFO ] Deduced a trap composed of 64 places in 356 ms of which 1 ms to minimize.
[2023-03-15 21:58:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 478 ms
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 29 places in 379 ms of which 4 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 32 places in 370 ms of which 1 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 924 ms
[2023-03-15 21:58:46] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-15 21:58:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 76 places in 272 ms of which 1 ms to minimize.
[2023-03-15 21:58:47] [INFO ] Deduced a trap composed of 70 places in 353 ms of which 0 ms to minimize.
[2023-03-15 21:58:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 819 ms
[2023-03-15 21:58:48] [INFO ] Deduced a trap composed of 49 places in 357 ms of which 1 ms to minimize.
[2023-03-15 21:58:48] [INFO ] Deduced a trap composed of 28 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Deduced a trap composed of 76 places in 346 ms of which 1 ms to minimize.
[2023-03-15 21:58:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1287 ms
[2023-03-15 21:58:51] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 0 ms to minimize.
[2023-03-15 21:58:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2023-03-15 21:58:58] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2023-03-15 21:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2023-03-15 21:58:59] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
[2023-03-15 21:58:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-15 21:59:00] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 1 ms to minimize.
[2023-03-15 21:59:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1009 ms
[2023-03-15 21:59:07] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 0 ms to minimize.
[2023-03-15 21:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-15 21:59:09] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 1 ms to minimize.
[2023-03-15 21:59:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2023-03-15 21:59:13] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 1 ms to minimize.
[2023-03-15 21:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-15 21:59:17] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 1 ms to minimize.
[2023-03-15 21:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-15 21:59:18] [INFO ] Deduced a trap composed of 32 places in 373 ms of which 0 ms to minimize.
[2023-03-15 21:59:18] [INFO ] Deduced a trap composed of 62 places in 343 ms of which 1 ms to minimize.
[2023-03-15 21:59:19] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 0 ms to minimize.
[2023-03-15 21:59:19] [INFO ] Deduced a trap composed of 90 places in 362 ms of which 1 ms to minimize.
[2023-03-15 21:59:19] [INFO ] Deduced a trap composed of 61 places in 337 ms of which 1 ms to minimize.
[2023-03-15 21:59:20] [INFO ] Deduced a trap composed of 104 places in 340 ms of which 0 ms to minimize.
[2023-03-15 21:59:20] [INFO ] Deduced a trap composed of 47 places in 345 ms of which 1 ms to minimize.
[2023-03-15 21:59:21] [INFO ] Deduced a trap composed of 26 places in 351 ms of which 1 ms to minimize.
[2023-03-15 21:59:21] [INFO ] Deduced a trap composed of 89 places in 351 ms of which 0 ms to minimize.
[2023-03-15 21:59:21] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 1 ms to minimize.
[2023-03-15 21:59:22] [INFO ] Deduced a trap composed of 89 places in 358 ms of which 1 ms to minimize.
[2023-03-15 21:59:22] [INFO ] Deduced a trap composed of 36 places in 334 ms of which 0 ms to minimize.
[2023-03-15 21:59:23] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 1 ms to minimize.
[2023-03-15 21:59:23] [INFO ] Deduced a trap composed of 48 places in 316 ms of which 1 ms to minimize.
[2023-03-15 21:59:23] [INFO ] Deduced a trap composed of 79 places in 325 ms of which 1 ms to minimize.
[2023-03-15 21:59:24] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:59:24] [INFO ] Deduced a trap composed of 75 places in 340 ms of which 1 ms to minimize.
[2023-03-15 21:59:25] [INFO ] Deduced a trap composed of 99 places in 350 ms of which 1 ms to minimize.
[2023-03-15 21:59:25] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 1 ms to minimize.
[2023-03-15 21:59:25] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7680 ms
[2023-03-15 21:59:27] [INFO ] Deduced a trap composed of 88 places in 275 ms of which 1 ms to minimize.
[2023-03-15 21:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-15 21:59:29] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2023-03-15 21:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 21:59:30] [INFO ] Deduced a trap composed of 64 places in 348 ms of which 1 ms to minimize.
[2023-03-15 21:59:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 21:59:30] [INFO ] After 225154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:368
Fused 368 Parikh solutions to 333 different solutions.
Parikh walk visited 1 properties in 5377 ms.
Support contains 268 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 436469 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 367) 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 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) 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 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 95 ms. (steps per millisecond=105 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 367) 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 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 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 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 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 77 ms. (steps per millisecond=129 ) properties (out of 367) 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 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) 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 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 367) 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 367) seen :0
Interrupted probabilistic random walk after 7585896 steps, run timeout after 102001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 7585896 steps, saw 953780 distinct states, run finished after 102006 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 367 properties.
[2023-03-15 22:01:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:01:52] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:01:57] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 22:02:15] [INFO ] After 15061ms SMT Verify possible using state equation in real domain returned unsat :0 sat :21 real:346
[2023-03-15 22:02:15] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:02:17] [INFO ] After 1253ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 22:02:17] [INFO ] After 24357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 22:02:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-15 22:02:41] [INFO ] After 16979ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2023-03-15 22:03:01] [INFO ] After 19788ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2023-03-15 22:03:02] [INFO ] Deduced a trap composed of 11 places in 462 ms of which 2 ms to minimize.
[2023-03-15 22:03:02] [INFO ] Deduced a trap composed of 26 places in 417 ms of which 1 ms to minimize.
[2023-03-15 22:03:03] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 0 ms to minimize.
[2023-03-15 22:03:03] [INFO ] Deduced a trap composed of 26 places in 418 ms of which 1 ms to minimize.
[2023-03-15 22:03:04] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 1 ms to minimize.
[2023-03-15 22:03:04] [INFO ] Deduced a trap composed of 27 places in 457 ms of which 1 ms to minimize.
[2023-03-15 22:03:05] [INFO ] Deduced a trap composed of 27 places in 415 ms of which 1 ms to minimize.
[2023-03-15 22:03:05] [INFO ] Deduced a trap composed of 18 places in 437 ms of which 1 ms to minimize.
[2023-03-15 22:03:06] [INFO ] Deduced a trap composed of 34 places in 445 ms of which 1 ms to minimize.
[2023-03-15 22:03:06] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2023-03-15 22:03:07] [INFO ] Deduced a trap composed of 12 places in 432 ms of which 1 ms to minimize.
[2023-03-15 22:03:07] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 1 ms to minimize.
[2023-03-15 22:03:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5846 ms
[2023-03-15 22:03:08] [INFO ] Deduced a trap composed of 51 places in 410 ms of which 1 ms to minimize.
[2023-03-15 22:03:08] [INFO ] Deduced a trap composed of 53 places in 409 ms of which 1 ms to minimize.
[2023-03-15 22:03:09] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2023-03-15 22:03:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1446 ms
[2023-03-15 22:03:09] [INFO ] Deduced a trap composed of 12 places in 414 ms of which 1 ms to minimize.
[2023-03-15 22:03:10] [INFO ] Deduced a trap composed of 58 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:03:10] [INFO ] Deduced a trap composed of 80 places in 395 ms of which 1 ms to minimize.
[2023-03-15 22:03:11] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 1 ms to minimize.
[2023-03-15 22:03:11] [INFO ] Deduced a trap composed of 58 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:03:12] [INFO ] Deduced a trap composed of 36 places in 346 ms of which 1 ms to minimize.
[2023-03-15 22:03:12] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:03:12] [INFO ] Deduced a trap composed of 42 places in 412 ms of which 1 ms to minimize.
[2023-03-15 22:03:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3533 ms
[2023-03-15 22:03:13] [INFO ] Deduced a trap composed of 28 places in 369 ms of which 1 ms to minimize.
[2023-03-15 22:03:13] [INFO ] Deduced a trap composed of 29 places in 357 ms of which 1 ms to minimize.
[2023-03-15 22:03:14] [INFO ] Deduced a trap composed of 28 places in 345 ms of which 1 ms to minimize.
[2023-03-15 22:03:14] [INFO ] Deduced a trap composed of 27 places in 344 ms of which 1 ms to minimize.
[2023-03-15 22:03:15] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:03:15] [INFO ] Deduced a trap composed of 20 places in 352 ms of which 1 ms to minimize.
[2023-03-15 22:03:15] [INFO ] Deduced a trap composed of 68 places in 359 ms of which 1 ms to minimize.
[2023-03-15 22:03:16] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 1 ms to minimize.
[2023-03-15 22:03:16] [INFO ] Deduced a trap composed of 20 places in 341 ms of which 1 ms to minimize.
[2023-03-15 22:03:16] [INFO ] Deduced a trap composed of 67 places in 297 ms of which 0 ms to minimize.
[2023-03-15 22:03:17] [INFO ] Deduced a trap composed of 20 places in 353 ms of which 1 ms to minimize.
[2023-03-15 22:03:17] [INFO ] Deduced a trap composed of 13 places in 333 ms of which 0 ms to minimize.
[2023-03-15 22:03:18] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:03:18] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2023-03-15 22:03:18] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 1 ms to minimize.
[2023-03-15 22:03:19] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2023-03-15 22:03:19] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 1 ms to minimize.
[2023-03-15 22:03:20] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 1 ms to minimize.
[2023-03-15 22:03:20] [INFO ] Deduced a trap composed of 21 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:03:20] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2023-03-15 22:03:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7819 ms
[2023-03-15 22:03:21] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 1 ms to minimize.
[2023-03-15 22:03:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 450 ms
[2023-03-15 22:03:22] [INFO ] Deduced a trap composed of 44 places in 334 ms of which 2 ms to minimize.
[2023-03-15 22:03:22] [INFO ] Deduced a trap composed of 62 places in 324 ms of which 1 ms to minimize.
[2023-03-15 22:03:22] [INFO ] Deduced a trap composed of 86 places in 272 ms of which 1 ms to minimize.
[2023-03-15 22:03:23] [INFO ] Deduced a trap composed of 44 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:03:23] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:03:23] [INFO ] Deduced a trap composed of 52 places in 298 ms of which 1 ms to minimize.
[2023-03-15 22:03:24] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:03:24] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 1 ms to minimize.
[2023-03-15 22:03:24] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 1 ms to minimize.
[2023-03-15 22:03:25] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:03:25] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 0 ms to minimize.
[2023-03-15 22:03:25] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:03:26] [INFO ] Deduced a trap composed of 73 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:03:26] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2023-03-15 22:03:26] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 1 ms to minimize.
[2023-03-15 22:03:27] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 1 ms to minimize.
[2023-03-15 22:03:27] [INFO ] Deduced a trap composed of 46 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:03:27] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 0 ms to minimize.
[2023-03-15 22:03:27] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6112 ms
[2023-03-15 22:03:28] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 1 ms to minimize.
[2023-03-15 22:03:28] [INFO ] Deduced a trap composed of 21 places in 375 ms of which 1 ms to minimize.
[2023-03-15 22:03:29] [INFO ] Deduced a trap composed of 29 places in 379 ms of which 1 ms to minimize.
[2023-03-15 22:03:29] [INFO ] Deduced a trap composed of 20 places in 390 ms of which 1 ms to minimize.
[2023-03-15 22:03:30] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 1 ms to minimize.
[2023-03-15 22:03:30] [INFO ] Deduced a trap composed of 22 places in 388 ms of which 1 ms to minimize.
[2023-03-15 22:03:31] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 0 ms to minimize.
[2023-03-15 22:03:31] [INFO ] Deduced a trap composed of 20 places in 368 ms of which 1 ms to minimize.
[2023-03-15 22:03:31] [INFO ] Deduced a trap composed of 12 places in 416 ms of which 1 ms to minimize.
[2023-03-15 22:03:32] [INFO ] Deduced a trap composed of 30 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:03:32] [INFO ] Deduced a trap composed of 29 places in 326 ms of which 1 ms to minimize.
[2023-03-15 22:03:33] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 1 ms to minimize.
[2023-03-15 22:03:33] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:03:33] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2023-03-15 22:03:34] [INFO ] Deduced a trap composed of 46 places in 269 ms of which 1 ms to minimize.
[2023-03-15 22:03:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 6180 ms
[2023-03-15 22:03:34] [INFO ] Deduced a trap composed of 46 places in 268 ms of which 1 ms to minimize.
[2023-03-15 22:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-15 22:03:34] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2023-03-15 22:03:35] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 1 ms to minimize.
[2023-03-15 22:03:35] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 0 ms to minimize.
[2023-03-15 22:03:35] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 1 ms to minimize.
[2023-03-15 22:03:36] [INFO ] Deduced a trap composed of 58 places in 305 ms of which 1 ms to minimize.
[2023-03-15 22:03:36] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 0 ms to minimize.
[2023-03-15 22:03:36] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 1 ms to minimize.
[2023-03-15 22:03:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2360 ms
[2023-03-15 22:03:37] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 1 ms to minimize.
[2023-03-15 22:03:37] [INFO ] Deduced a trap composed of 37 places in 297 ms of which 1 ms to minimize.
[2023-03-15 22:03:38] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 1 ms to minimize.
[2023-03-15 22:03:38] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 1 ms to minimize.
[2023-03-15 22:03:38] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 1 ms to minimize.
[2023-03-15 22:03:39] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 1 ms to minimize.
[2023-03-15 22:03:39] [INFO ] Deduced a trap composed of 21 places in 376 ms of which 1 ms to minimize.
[2023-03-15 22:03:40] [INFO ] Deduced a trap composed of 66 places in 320 ms of which 1 ms to minimize.
[2023-03-15 22:03:40] [INFO ] Deduced a trap composed of 44 places in 322 ms of which 1 ms to minimize.
[2023-03-15 22:03:40] [INFO ] Deduced a trap composed of 44 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:03:41] [INFO ] Deduced a trap composed of 61 places in 315 ms of which 1 ms to minimize.
[2023-03-15 22:03:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4260 ms
[2023-03-15 22:03:41] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 1 ms to minimize.
[2023-03-15 22:03:42] [INFO ] Deduced a trap composed of 43 places in 369 ms of which 1 ms to minimize.
[2023-03-15 22:03:42] [INFO ] Deduced a trap composed of 45 places in 384 ms of which 1 ms to minimize.
[2023-03-15 22:03:43] [INFO ] Deduced a trap composed of 44 places in 370 ms of which 0 ms to minimize.
[2023-03-15 22:03:43] [INFO ] Deduced a trap composed of 45 places in 393 ms of which 0 ms to minimize.
[2023-03-15 22:03:44] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 1 ms to minimize.
[2023-03-15 22:03:44] [INFO ] Deduced a trap composed of 39 places in 354 ms of which 1 ms to minimize.
[2023-03-15 22:03:44] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 1 ms to minimize.
[2023-03-15 22:03:45] [INFO ] Deduced a trap composed of 61 places in 320 ms of which 1 ms to minimize.
[2023-03-15 22:03:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3847 ms
[2023-03-15 22:03:45] [INFO ] Deduced a trap composed of 53 places in 213 ms of which 1 ms to minimize.
[2023-03-15 22:03:45] [INFO ] Deduced a trap composed of 55 places in 267 ms of which 1 ms to minimize.
[2023-03-15 22:03:46] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 0 ms to minimize.
[2023-03-15 22:03:46] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 1 ms to minimize.
[2023-03-15 22:03:46] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 0 ms to minimize.
[2023-03-15 22:03:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1484 ms
[2023-03-15 22:03:47] [INFO ] Deduced a trap composed of 18 places in 382 ms of which 1 ms to minimize.
[2023-03-15 22:03:48] [INFO ] Deduced a trap composed of 10 places in 403 ms of which 1 ms to minimize.
[2023-03-15 22:03:48] [INFO ] Deduced a trap composed of 22 places in 330 ms of which 1 ms to minimize.
[2023-03-15 22:03:48] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 1 ms to minimize.
[2023-03-15 22:03:49] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 1 ms to minimize.
[2023-03-15 22:03:49] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:03:49] [INFO ] Deduced a trap composed of 37 places in 278 ms of which 0 ms to minimize.
[2023-03-15 22:03:50] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 1 ms to minimize.
[2023-03-15 22:03:50] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 1 ms to minimize.
[2023-03-15 22:03:50] [INFO ] Deduced a trap composed of 50 places in 196 ms of which 0 ms to minimize.
[2023-03-15 22:03:50] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 1 ms to minimize.
[2023-03-15 22:03:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3672 ms
[2023-03-15 22:03:51] [INFO ] Deduced a trap composed of 40 places in 400 ms of which 1 ms to minimize.
[2023-03-15 22:03:51] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 1 ms to minimize.
[2023-03-15 22:03:52] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 1 ms to minimize.
[2023-03-15 22:03:52] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 1 ms to minimize.
[2023-03-15 22:03:52] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 1 ms to minimize.
[2023-03-15 22:03:53] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 1 ms to minimize.
[2023-03-15 22:03:53] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 1 ms to minimize.
[2023-03-15 22:03:53] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 1 ms to minimize.
[2023-03-15 22:03:53] [INFO ] Deduced a trap composed of 50 places in 195 ms of which 1 ms to minimize.
[2023-03-15 22:03:53] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 1 ms to minimize.
[2023-03-15 22:03:54] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 1 ms to minimize.
[2023-03-15 22:03:54] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 0 ms to minimize.
[2023-03-15 22:03:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3307 ms
[2023-03-15 22:03:54] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 1 ms to minimize.
[2023-03-15 22:03:55] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2023-03-15 22:03:55] [INFO ] Deduced a trap composed of 47 places in 242 ms of which 1 ms to minimize.
[2023-03-15 22:03:56] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 1 ms to minimize.
[2023-03-15 22:03:56] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 1 ms to minimize.
[2023-03-15 22:03:56] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 1 ms to minimize.
[2023-03-15 22:03:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2370 ms
[2023-03-15 22:03:57] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 1 ms to minimize.
[2023-03-15 22:03:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-15 22:03:57] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 1 ms to minimize.
[2023-03-15 22:03:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-15 22:03:58] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 1 ms to minimize.
[2023-03-15 22:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2023-03-15 22:03:58] [INFO ] Deduced a trap composed of 42 places in 300 ms of which 1 ms to minimize.
[2023-03-15 22:03:59] [INFO ] Deduced a trap composed of 50 places in 270 ms of which 0 ms to minimize.
[2023-03-15 22:03:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 730 ms
[2023-03-15 22:03:59] [INFO ] Deduced a trap composed of 34 places in 290 ms of which 1 ms to minimize.
[2023-03-15 22:04:00] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 0 ms to minimize.
[2023-03-15 22:04:00] [INFO ] Deduced a trap composed of 34 places in 293 ms of which 1 ms to minimize.
[2023-03-15 22:04:00] [INFO ] Deduced a trap composed of 34 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:04:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1422 ms
[2023-03-15 22:04:01] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 1 ms to minimize.
[2023-03-15 22:04:01] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2023-03-15 22:04:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-15 22:04:02] [INFO ] Deduced a trap composed of 36 places in 441 ms of which 1 ms to minimize.
[2023-03-15 22:04:02] [INFO ] Deduced a trap composed of 59 places in 346 ms of which 1 ms to minimize.
[2023-03-15 22:04:02] [INFO ] Deduced a trap composed of 30 places in 314 ms of which 1 ms to minimize.
[2023-03-15 22:04:03] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 0 ms to minimize.
[2023-03-15 22:04:03] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 1 ms to minimize.
[2023-03-15 22:04:04] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 1 ms to minimize.
[2023-03-15 22:04:04] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:04:04] [INFO ] Deduced a trap composed of 41 places in 281 ms of which 0 ms to minimize.
[2023-03-15 22:04:04] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 0 ms to minimize.
[2023-03-15 22:04:05] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 0 ms to minimize.
[2023-03-15 22:04:05] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 0 ms to minimize.
[2023-03-15 22:04:06] [INFO ] Deduced a trap composed of 30 places in 304 ms of which 1 ms to minimize.
[2023-03-15 22:04:06] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 1 ms to minimize.
[2023-03-15 22:04:06] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:04:07] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2023-03-15 22:04:07] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 1 ms to minimize.
[2023-03-15 22:04:07] [INFO ] Deduced a trap composed of 61 places in 220 ms of which 1 ms to minimize.
[2023-03-15 22:04:07] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 1 ms to minimize.
[2023-03-15 22:04:08] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:04:08] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 0 ms to minimize.
[2023-03-15 22:04:08] [INFO ] Deduced a trap composed of 63 places in 227 ms of which 0 ms to minimize.
[2023-03-15 22:04:09] [INFO ] Deduced a trap composed of 37 places in 226 ms of which 1 ms to minimize.
[2023-03-15 22:04:09] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2023-03-15 22:04:09] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 1 ms to minimize.
[2023-03-15 22:04:09] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 0 ms to minimize.
[2023-03-15 22:04:10] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 1 ms to minimize.
[2023-03-15 22:04:10] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 1 ms to minimize.
[2023-03-15 22:04:10] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 1 ms to minimize.
[2023-03-15 22:04:10] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8921 ms
[2023-03-15 22:04:10] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 1 ms to minimize.
[2023-03-15 22:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-15 22:04:11] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 0 ms to minimize.
[2023-03-15 22:04:11] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 0 ms to minimize.
[2023-03-15 22:04:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2023-03-15 22:04:11] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2023-03-15 22:04:11] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 0 ms to minimize.
[2023-03-15 22:04:12] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 0 ms to minimize.
[2023-03-15 22:04:12] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 1 ms to minimize.
[2023-03-15 22:04:12] [INFO ] Deduced a trap composed of 67 places in 330 ms of which 1 ms to minimize.
[2023-03-15 22:04:12] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 1 ms to minimize.
[2023-03-15 22:04:13] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 0 ms to minimize.
[2023-03-15 22:04:13] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 1 ms to minimize.
[2023-03-15 22:04:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2005 ms
[2023-03-15 22:04:13] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 0 ms to minimize.
[2023-03-15 22:04:14] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 1 ms to minimize.
[2023-03-15 22:04:14] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 1 ms to minimize.
[2023-03-15 22:04:14] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 0 ms to minimize.
[2023-03-15 22:04:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1180 ms
[2023-03-15 22:04:14] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 1 ms to minimize.
[2023-03-15 22:04:15] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 1 ms to minimize.
[2023-03-15 22:04:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2023-03-15 22:04:15] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 1 ms to minimize.
[2023-03-15 22:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-15 22:04:15] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-15 22:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-15 22:04:16] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 0 ms to minimize.
[2023-03-15 22:04:16] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2023-03-15 22:04:16] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 0 ms to minimize.
[2023-03-15 22:04:17] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:04:24] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 0 ms to minimize.
[2023-03-15 22:04:24] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 1 ms to minimize.
[2023-03-15 22:04:24] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2023-03-15 22:04:25] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2023-03-15 22:04:25] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 0 ms to minimize.
[2023-03-15 22:04:25] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 1 ms to minimize.
[2023-03-15 22:04:25] [INFO ] Deduced a trap composed of 59 places in 147 ms of which 1 ms to minimize.
[2023-03-15 22:04:25] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 1 ms to minimize.
[2023-03-15 22:04:25] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9732 ms
[2023-03-15 22:04:26] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2023-03-15 22:04:26] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2023-03-15 22:04:26] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2023-03-15 22:04:26] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2023-03-15 22:04:26] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2023-03-15 22:04:27] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 1 ms to minimize.
[2023-03-15 22:04:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1202 ms
[2023-03-15 22:04:27] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 1 ms to minimize.
[2023-03-15 22:04:27] [INFO ] Deduced a trap composed of 60 places in 245 ms of which 1 ms to minimize.
[2023-03-15 22:04:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2023-03-15 22:04:28] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 0 ms to minimize.
[2023-03-15 22:04:28] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 1 ms to minimize.
[2023-03-15 22:04:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2023-03-15 22:04:28] [INFO ] Deduced a trap composed of 23 places in 255 ms of which 1 ms to minimize.
[2023-03-15 22:04:29] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 0 ms to minimize.
[2023-03-15 22:04:29] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 1 ms to minimize.
[2023-03-15 22:04:29] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 0 ms to minimize.
[2023-03-15 22:04:29] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 1 ms to minimize.
[2023-03-15 22:04:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1260 ms
[2023-03-15 22:04:30] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 0 ms to minimize.
[2023-03-15 22:04:30] [INFO ] Deduced a trap composed of 79 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:04:30] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 0 ms to minimize.
[2023-03-15 22:04:31] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 1 ms to minimize.
[2023-03-15 22:04:31] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2023-03-15 22:04:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1485 ms
[2023-03-15 22:04:32] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2023-03-15 22:04:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-15 22:04:33] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2023-03-15 22:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-15 22:04:33] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 1 ms to minimize.
[2023-03-15 22:04:34] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2023-03-15 22:04:35] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 0 ms to minimize.
[2023-03-15 22:04:35] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2023-03-15 22:04:35] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 0 ms to minimize.
[2023-03-15 22:04:35] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 1 ms to minimize.
[2023-03-15 22:04:36] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 0 ms to minimize.
[2023-03-15 22:04:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3595 ms
[2023-03-15 22:04:38] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-15 22:04:38] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2023-03-15 22:04:38] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 1 ms to minimize.
[2023-03-15 22:04:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 652 ms
[2023-03-15 22:04:39] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 0 ms to minimize.
[2023-03-15 22:04:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2023-03-15 22:04:40] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 1 ms to minimize.
[2023-03-15 22:04:40] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 1 ms to minimize.
[2023-03-15 22:04:40] [INFO ] Deduced a trap composed of 63 places in 195 ms of which 1 ms to minimize.
[2023-03-15 22:04:40] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2023-03-15 22:04:40] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 0 ms to minimize.
[2023-03-15 22:04:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1177 ms
[2023-03-15 22:04:41] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:04:41] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 0 ms to minimize.
[2023-03-15 22:04:42] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2023-03-15 22:04:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 831 ms
[2023-03-15 22:04:42] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 0 ms to minimize.
[2023-03-15 22:04:42] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 1 ms to minimize.
[2023-03-15 22:04:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2023-03-15 22:04:43] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 1 ms to minimize.
[2023-03-15 22:04:43] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 1 ms to minimize.
[2023-03-15 22:04:43] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2023-03-15 22:04:44] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2023-03-15 22:04:44] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2023-03-15 22:04:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1184 ms
[2023-03-15 22:04:45] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2023-03-15 22:04:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-15 22:04:45] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2023-03-15 22:04:45] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 0 ms to minimize.
[2023-03-15 22:04:45] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 0 ms to minimize.
[2023-03-15 22:04:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 645 ms
[2023-03-15 22:04:48] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:04:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-15 22:04:48] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 0 ms to minimize.
[2023-03-15 22:04:48] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2023-03-15 22:04:48] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2023-03-15 22:04:49] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2023-03-15 22:04:49] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 0 ms to minimize.
[2023-03-15 22:04:49] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 0 ms to minimize.
[2023-03-15 22:04:49] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 0 ms to minimize.
[2023-03-15 22:04:50] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 1 ms to minimize.
[2023-03-15 22:04:50] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:04:50] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 0 ms to minimize.
[2023-03-15 22:04:50] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 1 ms to minimize.
[2023-03-15 22:04:50] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 0 ms to minimize.
[2023-03-15 22:04:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2694 ms
[2023-03-15 22:04:52] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 1 ms to minimize.
[2023-03-15 22:04:52] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 1 ms to minimize.
[2023-03-15 22:04:52] [INFO ] Deduced a trap composed of 20 places in 367 ms of which 0 ms to minimize.
[2023-03-15 22:04:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1346 ms
[2023-03-15 22:04:54] [INFO ] Deduced a trap composed of 35 places in 308 ms of which 1 ms to minimize.
[2023-03-15 22:04:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1048 ms
[2023-03-15 22:04:55] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 0 ms to minimize.
[2023-03-15 22:04:55] [INFO ] Deduced a trap composed of 54 places in 206 ms of which 0 ms to minimize.
[2023-03-15 22:04:56] [INFO ] Deduced a trap composed of 53 places in 184 ms of which 1 ms to minimize.
[2023-03-15 22:04:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 786 ms
[2023-03-15 22:04:56] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 1 ms to minimize.
[2023-03-15 22:04:57] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 1 ms to minimize.
[2023-03-15 22:04:57] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 1 ms to minimize.
[2023-03-15 22:04:58] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 1 ms to minimize.
[2023-03-15 22:04:58] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 1 ms to minimize.
[2023-03-15 22:04:59] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 1 ms to minimize.
[2023-03-15 22:04:59] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 1 ms to minimize.
[2023-03-15 22:04:59] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 1 ms to minimize.
[2023-03-15 22:04:59] [INFO ] Deduced a trap composed of 45 places in 236 ms of which 1 ms to minimize.
[2023-03-15 22:05:00] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 1 ms to minimize.
[2023-03-15 22:05:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4298 ms
[2023-03-15 22:05:01] [INFO ] Deduced a trap composed of 64 places in 291 ms of which 1 ms to minimize.
[2023-03-15 22:05:02] [INFO ] Deduced a trap composed of 51 places in 315 ms of which 1 ms to minimize.
[2023-03-15 22:05:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 791 ms
[2023-03-15 22:05:02] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 1 ms to minimize.
[2023-03-15 22:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2023-03-15 22:05:04] [INFO ] Deduced a trap composed of 20 places in 401 ms of which 1 ms to minimize.
[2023-03-15 22:05:04] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 1 ms to minimize.
[2023-03-15 22:05:05] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 1 ms to minimize.
[2023-03-15 22:05:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1398 ms
[2023-03-15 22:05:06] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 1 ms to minimize.
[2023-03-15 22:05:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-15 22:05:08] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 1 ms to minimize.
[2023-03-15 22:05:08] [INFO ] Deduced a trap composed of 15 places in 396 ms of which 1 ms to minimize.
[2023-03-15 22:05:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 988 ms
[2023-03-15 22:05:10] [INFO ] Deduced a trap composed of 47 places in 396 ms of which 1 ms to minimize.
[2023-03-15 22:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2023-03-15 22:05:11] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 1 ms to minimize.
[2023-03-15 22:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 468 ms
[2023-03-15 22:05:14] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:05:14] [INFO ] Deduced a trap composed of 26 places in 369 ms of which 1 ms to minimize.
[2023-03-15 22:05:15] [INFO ] Deduced a trap composed of 46 places in 325 ms of which 1 ms to minimize.
[2023-03-15 22:05:15] [INFO ] Deduced a trap composed of 33 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:05:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1641 ms
[2023-03-15 22:05:17] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2023-03-15 22:05:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-15 22:05:18] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 0 ms to minimize.
[2023-03-15 22:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-15 22:05:20] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2023-03-15 22:05:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-15 22:05:21] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:05:22] [INFO ] Deduced a trap composed of 49 places in 261 ms of which 1 ms to minimize.
[2023-03-15 22:05:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 683 ms
[2023-03-15 22:05:23] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 1 ms to minimize.
[2023-03-15 22:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-15 22:05:25] [INFO ] Deduced a trap composed of 21 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:05:25] [INFO ] Deduced a trap composed of 40 places in 375 ms of which 1 ms to minimize.
[2023-03-15 22:05:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 935 ms
[2023-03-15 22:05:26] [INFO ] Deduced a trap composed of 45 places in 415 ms of which 1 ms to minimize.
[2023-03-15 22:05:27] [INFO ] Deduced a trap composed of 38 places in 448 ms of which 1 ms to minimize.
[2023-03-15 22:05:27] [INFO ] Deduced a trap composed of 30 places in 411 ms of which 1 ms to minimize.
[2023-03-15 22:05:28] [INFO ] Deduced a trap composed of 22 places in 433 ms of which 1 ms to minimize.
[2023-03-15 22:05:28] [INFO ] Deduced a trap composed of 52 places in 364 ms of which 1 ms to minimize.
[2023-03-15 22:05:29] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 0 ms to minimize.
[2023-03-15 22:05:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2812 ms
[2023-03-15 22:05:29] [INFO ] Deduced a trap composed of 23 places in 414 ms of which 1 ms to minimize.
[2023-03-15 22:05:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 533 ms
[2023-03-15 22:05:30] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2023-03-15 22:05:30] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 0 ms to minimize.
[2023-03-15 22:05:31] [INFO ] Deduced a trap composed of 52 places in 320 ms of which 1 ms to minimize.
[2023-03-15 22:05:31] [INFO ] Deduced a trap composed of 19 places in 310 ms of which 1 ms to minimize.
[2023-03-15 22:05:31] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 0 ms to minimize.
[2023-03-15 22:05:31] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2023-03-15 22:05:32] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2023-03-15 22:05:32] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 1 ms to minimize.
[2023-03-15 22:05:32] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 1 ms to minimize.
[2023-03-15 22:05:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2945 ms
[2023-03-15 22:05:36] [INFO ] Deduced a trap composed of 64 places in 241 ms of which 1 ms to minimize.
[2023-03-15 22:05:36] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 0 ms to minimize.
[2023-03-15 22:05:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 722 ms
[2023-03-15 22:05:37] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:05:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-15 22:05:43] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:05:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2023-03-15 22:05:43] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 1 ms to minimize.
[2023-03-15 22:05:44] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 1 ms to minimize.
[2023-03-15 22:05:44] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 1 ms to minimize.
[2023-03-15 22:05:45] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 1 ms to minimize.
[2023-03-15 22:05:45] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 0 ms to minimize.
[2023-03-15 22:05:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2377 ms
[2023-03-15 22:05:46] [INFO ] Deduced a trap composed of 82 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2023-03-15 22:05:50] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2023-03-15 22:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-15 22:05:58] [INFO ] Deduced a trap composed of 58 places in 380 ms of which 1 ms to minimize.
[2023-03-15 22:05:59] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 1 ms to minimize.
[2023-03-15 22:05:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 990 ms
[2023-03-15 22:06:01] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
[2023-03-15 22:06:02] [INFO ] Deduced a trap composed of 2 places in 419 ms of which 0 ms to minimize.
[2023-03-15 22:06:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 22:06:02] [INFO ] After 225431ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:367
Fused 367 Parikh solutions to 343 different solutions.
Parikh walk visited 0 properties in 5943 ms.
Support contains 268 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.
Starting structural reductions in SAFETY mode, iteration 0 : 399/399 places, 1106/1106 transitions.
Applied a total of 0 rules in 21 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 22:06:08] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:06:08] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:06:08] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-15 22:06:08] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:06:08] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:06:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:06:10] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
[2023-03-15 22:06:10] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-15 22:06:10] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:06:10] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:06:11] [INFO ] Dead Transitions using invariants and state equation in 1225 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 6250 ms. (steps per millisecond=16 ) properties (out of 268) seen :93
Running SMT prover for 175 properties.
[2023-03-15 22:06:17] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:06:17] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:06:19] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 22:06:28] [INFO ] After 10962ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:175
[2023-03-15 22:06:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 22:06:38] [INFO ] After 5983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :175
[2023-03-15 22:06:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:06:46] [INFO ] After 8552ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :175
[2023-03-15 22:06:47] [INFO ] Deduced a trap composed of 12 places in 461 ms of which 1 ms to minimize.
[2023-03-15 22:06:47] [INFO ] Deduced a trap composed of 18 places in 453 ms of which 1 ms to minimize.
[2023-03-15 22:06:48] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 1 ms to minimize.
[2023-03-15 22:06:48] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 1 ms to minimize.
[2023-03-15 22:06:49] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2023-03-15 22:06:49] [INFO ] Deduced a trap composed of 19 places in 267 ms of which 1 ms to minimize.
[2023-03-15 22:06:49] [INFO ] Deduced a trap composed of 45 places in 456 ms of which 1 ms to minimize.
[2023-03-15 22:06:50] [INFO ] Deduced a trap composed of 63 places in 452 ms of which 1 ms to minimize.
[2023-03-15 22:06:50] [INFO ] Deduced a trap composed of 12 places in 443 ms of which 1 ms to minimize.
[2023-03-15 22:06:51] [INFO ] Deduced a trap composed of 12 places in 442 ms of which 1 ms to minimize.
[2023-03-15 22:06:51] [INFO ] Deduced a trap composed of 11 places in 434 ms of which 1 ms to minimize.
[2023-03-15 22:06:52] [INFO ] Deduced a trap composed of 28 places in 442 ms of which 1 ms to minimize.
[2023-03-15 22:06:52] [INFO ] Deduced a trap composed of 11 places in 438 ms of which 1 ms to minimize.
[2023-03-15 22:06:53] [INFO ] Deduced a trap composed of 46 places in 398 ms of which 1 ms to minimize.
[2023-03-15 22:06:53] [INFO ] Deduced a trap composed of 19 places in 392 ms of which 1 ms to minimize.
[2023-03-15 22:06:54] [INFO ] Deduced a trap composed of 44 places in 392 ms of which 1 ms to minimize.
[2023-03-15 22:06:54] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 1 ms to minimize.
[2023-03-15 22:06:55] [INFO ] Deduced a trap composed of 58 places in 429 ms of which 1 ms to minimize.
[2023-03-15 22:06:55] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 1 ms to minimize.
[2023-03-15 22:06:56] [INFO ] Deduced a trap composed of 64 places in 428 ms of which 1 ms to minimize.
[2023-03-15 22:06:56] [INFO ] Deduced a trap composed of 67 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:06:56] [INFO ] Deduced a trap composed of 67 places in 356 ms of which 1 ms to minimize.
[2023-03-15 22:06:57] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 1 ms to minimize.
[2023-03-15 22:06:57] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 1 ms to minimize.
[2023-03-15 22:06:58] [INFO ] Deduced a trap composed of 28 places in 326 ms of which 1 ms to minimize.
[2023-03-15 22:06:58] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 1 ms to minimize.
[2023-03-15 22:06:58] [INFO ] Deduced a trap composed of 28 places in 338 ms of which 0 ms to minimize.
[2023-03-15 22:06:59] [INFO ] Deduced a trap composed of 20 places in 431 ms of which 1 ms to minimize.
[2023-03-15 22:06:59] [INFO ] Deduced a trap composed of 41 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:07:00] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 1 ms to minimize.
[2023-03-15 22:07:00] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 1 ms to minimize.
[2023-03-15 22:07:00] [INFO ] Deduced a trap composed of 42 places in 283 ms of which 1 ms to minimize.
[2023-03-15 22:07:01] [INFO ] Deduced a trap composed of 48 places in 264 ms of which 1 ms to minimize.
[2023-03-15 22:07:01] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 14422 ms
[2023-03-15 22:07:01] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 0 ms to minimize.
[2023-03-15 22:07:02] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 1 ms to minimize.
[2023-03-15 22:07:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 718 ms
[2023-03-15 22:07:02] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 1 ms to minimize.
[2023-03-15 22:07:02] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 1 ms to minimize.
[2023-03-15 22:07:03] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 1 ms to minimize.
[2023-03-15 22:07:03] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 1 ms to minimize.
[2023-03-15 22:07:04] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2023-03-15 22:07:04] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2023-03-15 22:07:05] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:07:05] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 1 ms to minimize.
[2023-03-15 22:07:05] [INFO ] Deduced a trap composed of 38 places in 367 ms of which 1 ms to minimize.
[2023-03-15 22:07:06] [INFO ] Deduced a trap composed of 30 places in 379 ms of which 1 ms to minimize.
[2023-03-15 22:07:06] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 1 ms to minimize.
[2023-03-15 22:07:07] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 1 ms to minimize.
[2023-03-15 22:07:07] [INFO ] Deduced a trap composed of 46 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:07:07] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 1 ms to minimize.
[2023-03-15 22:07:08] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 1 ms to minimize.
[2023-03-15 22:07:08] [INFO ] Deduced a trap composed of 86 places in 283 ms of which 0 ms to minimize.
[2023-03-15 22:07:08] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 1 ms to minimize.
[2023-03-15 22:07:08] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6685 ms
[2023-03-15 22:07:09] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 1 ms to minimize.
[2023-03-15 22:07:09] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 1 ms to minimize.
[2023-03-15 22:07:09] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 1 ms to minimize.
[2023-03-15 22:07:10] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:07:10] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
[2023-03-15 22:07:10] [INFO ] Deduced a trap composed of 58 places in 299 ms of which 1 ms to minimize.
[2023-03-15 22:07:11] [INFO ] Deduced a trap composed of 89 places in 278 ms of which 1 ms to minimize.
[2023-03-15 22:07:11] [INFO ] Deduced a trap composed of 73 places in 276 ms of which 1 ms to minimize.
[2023-03-15 22:07:12] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2023-03-15 22:07:12] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 1 ms to minimize.
[2023-03-15 22:07:13] [INFO ] Deduced a trap composed of 18 places in 398 ms of which 1 ms to minimize.
[2023-03-15 22:07:13] [INFO ] Deduced a trap composed of 18 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:07:13] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 1 ms to minimize.
[2023-03-15 22:07:14] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 1 ms to minimize.
[2023-03-15 22:07:14] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 0 ms to minimize.
[2023-03-15 22:07:14] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 1 ms to minimize.
[2023-03-15 22:07:15] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 0 ms to minimize.
[2023-03-15 22:07:15] [INFO ] Deduced a trap composed of 82 places in 311 ms of which 1 ms to minimize.
[2023-03-15 22:07:15] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 0 ms to minimize.
[2023-03-15 22:07:16] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 0 ms to minimize.
[2023-03-15 22:07:16] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 1 ms to minimize.
[2023-03-15 22:07:17] [INFO ] Deduced a trap composed of 22 places in 328 ms of which 0 ms to minimize.
[2023-03-15 22:07:17] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 1 ms to minimize.
[2023-03-15 22:07:17] [INFO ] Deduced a trap composed of 38 places in 309 ms of which 0 ms to minimize.
[2023-03-15 22:07:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8967 ms
[2023-03-15 22:07:18] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2023-03-15 22:07:18] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2023-03-15 22:07:19] [INFO ] Deduced a trap composed of 36 places in 385 ms of which 1 ms to minimize.
[2023-03-15 22:07:19] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 1 ms to minimize.
[2023-03-15 22:07:20] [INFO ] Deduced a trap composed of 61 places in 380 ms of which 1 ms to minimize.
[2023-03-15 22:07:20] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 1 ms to minimize.
[2023-03-15 22:07:21] [INFO ] Deduced a trap composed of 27 places in 421 ms of which 1 ms to minimize.
[2023-03-15 22:07:21] [INFO ] Deduced a trap composed of 21 places in 404 ms of which 1 ms to minimize.
[2023-03-15 22:07:22] [INFO ] Deduced a trap composed of 39 places in 340 ms of which 1 ms to minimize.
[2023-03-15 22:07:22] [INFO ] Deduced a trap composed of 20 places in 406 ms of which 1 ms to minimize.
[2023-03-15 22:07:22] [INFO ] Deduced a trap composed of 20 places in 379 ms of which 1 ms to minimize.
[2023-03-15 22:07:23] [INFO ] Deduced a trap composed of 65 places in 327 ms of which 1 ms to minimize.
[2023-03-15 22:07:23] [INFO ] Deduced a trap composed of 44 places in 348 ms of which 1 ms to minimize.
[2023-03-15 22:07:24] [INFO ] Deduced a trap composed of 65 places in 341 ms of which 0 ms to minimize.
[2023-03-15 22:07:24] [INFO ] Deduced a trap composed of 63 places in 344 ms of which 1 ms to minimize.
[2023-03-15 22:07:24] [INFO ] Deduced a trap composed of 51 places in 326 ms of which 1 ms to minimize.
[2023-03-15 22:07:25] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 1 ms to minimize.
[2023-03-15 22:07:25] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7269 ms
[2023-03-15 22:07:25] [INFO ] Deduced a trap composed of 37 places in 369 ms of which 1 ms to minimize.
[2023-03-15 22:07:26] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 1 ms to minimize.
[2023-03-15 22:07:26] [INFO ] Deduced a trap composed of 34 places in 323 ms of which 1 ms to minimize.
[2023-03-15 22:07:26] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 1 ms to minimize.
[2023-03-15 22:07:27] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 1 ms to minimize.
[2023-03-15 22:07:27] [INFO ] Deduced a trap composed of 15 places in 357 ms of which 1 ms to minimize.
[2023-03-15 22:07:28] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 1 ms to minimize.
[2023-03-15 22:07:28] [INFO ] Deduced a trap composed of 52 places in 255 ms of which 1 ms to minimize.
[2023-03-15 22:07:28] [INFO ] Deduced a trap composed of 59 places in 257 ms of which 0 ms to minimize.
[2023-03-15 22:07:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3366 ms
[2023-03-15 22:07:29] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 0 ms to minimize.
[2023-03-15 22:07:29] [INFO ] Deduced a trap composed of 51 places in 318 ms of which 1 ms to minimize.
[2023-03-15 22:07:29] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 1 ms to minimize.
[2023-03-15 22:07:30] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 1 ms to minimize.
[2023-03-15 22:07:30] [INFO ] Deduced a trap composed of 15 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:07:30] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 1 ms to minimize.
[2023-03-15 22:07:31] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 0 ms to minimize.
[2023-03-15 22:07:31] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:07:31] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 0 ms to minimize.
[2023-03-15 22:07:32] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 1 ms to minimize.
[2023-03-15 22:07:32] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 1 ms to minimize.
[2023-03-15 22:07:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3572 ms
[2023-03-15 22:07:32] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 1 ms to minimize.
[2023-03-15 22:07:33] [INFO ] Deduced a trap composed of 50 places in 352 ms of which 1 ms to minimize.
[2023-03-15 22:07:33] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 1 ms to minimize.
[2023-03-15 22:07:33] [INFO ] Deduced a trap composed of 50 places in 279 ms of which 1 ms to minimize.
[2023-03-15 22:07:34] [INFO ] Deduced a trap composed of 50 places in 262 ms of which 1 ms to minimize.
[2023-03-15 22:07:34] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 1 ms to minimize.
[2023-03-15 22:07:34] [INFO ] Deduced a trap composed of 50 places in 258 ms of which 0 ms to minimize.
[2023-03-15 22:07:35] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 1 ms to minimize.
[2023-03-15 22:07:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2800 ms
[2023-03-15 22:07:35] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 1 ms to minimize.
[2023-03-15 22:07:35] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 1 ms to minimize.
[2023-03-15 22:07:36] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 1 ms to minimize.
[2023-03-15 22:07:36] [INFO ] Deduced a trap composed of 42 places in 242 ms of which 0 ms to minimize.
[2023-03-15 22:07:36] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 1 ms to minimize.
[2023-03-15 22:07:37] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 1 ms to minimize.
[2023-03-15 22:07:37] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 1 ms to minimize.
[2023-03-15 22:07:37] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 1 ms to minimize.
[2023-03-15 22:07:38] [INFO ] Deduced a trap composed of 39 places in 312 ms of which 1 ms to minimize.
[2023-03-15 22:07:38] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 0 ms to minimize.
[2023-03-15 22:07:38] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 1 ms to minimize.
[2023-03-15 22:07:39] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 1 ms to minimize.
[2023-03-15 22:07:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3980 ms
[2023-03-15 22:07:39] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 1 ms to minimize.
[2023-03-15 22:07:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2023-03-15 22:07:40] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 0 ms to minimize.
[2023-03-15 22:07:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-15 22:07:40] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 0 ms to minimize.
[2023-03-15 22:07:41] [INFO ] Deduced a trap composed of 34 places in 294 ms of which 1 ms to minimize.
[2023-03-15 22:07:41] [INFO ] Deduced a trap composed of 34 places in 298 ms of which 1 ms to minimize.
[2023-03-15 22:07:41] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 1 ms to minimize.
[2023-03-15 22:07:42] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 0 ms to minimize.
[2023-03-15 22:07:42] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 1 ms to minimize.
[2023-03-15 22:07:43] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 1 ms to minimize.
[2023-03-15 22:07:43] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 1 ms to minimize.
[2023-03-15 22:07:43] [INFO ] Deduced a trap composed of 52 places in 261 ms of which 1 ms to minimize.
[2023-03-15 22:07:43] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3305 ms
[2023-03-15 22:07:44] [INFO ] Deduced a trap composed of 50 places in 385 ms of which 1 ms to minimize.
[2023-03-15 22:07:44] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 1 ms to minimize.
[2023-03-15 22:07:45] [INFO ] Deduced a trap composed of 81 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:07:45] [INFO ] Deduced a trap composed of 30 places in 370 ms of which 1 ms to minimize.
[2023-03-15 22:07:45] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 0 ms to minimize.
[2023-03-15 22:07:46] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 1 ms to minimize.
[2023-03-15 22:07:46] [INFO ] Deduced a trap composed of 30 places in 390 ms of which 1 ms to minimize.
[2023-03-15 22:07:47] [INFO ] Deduced a trap composed of 38 places in 297 ms of which 1 ms to minimize.
[2023-03-15 22:07:47] [INFO ] Deduced a trap composed of 57 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:07:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3567 ms
[2023-03-15 22:07:48] [INFO ] Deduced a trap composed of 22 places in 418 ms of which 1 ms to minimize.
[2023-03-15 22:07:48] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 1 ms to minimize.
[2023-03-15 22:07:49] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 1 ms to minimize.
[2023-03-15 22:07:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1432 ms
[2023-03-15 22:07:49] [INFO ] Deduced a trap composed of 97 places in 297 ms of which 1 ms to minimize.
[2023-03-15 22:07:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2023-03-15 22:07:50] [INFO ] Deduced a trap composed of 11 places in 425 ms of which 1 ms to minimize.
[2023-03-15 22:07:50] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 1 ms to minimize.
[2023-03-15 22:07:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1028 ms
[2023-03-15 22:07:51] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 1 ms to minimize.
[2023-03-15 22:07:51] [INFO ] Deduced a trap composed of 26 places in 367 ms of which 1 ms to minimize.
[2023-03-15 22:07:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 883 ms
[2023-03-15 22:07:52] [INFO ] Deduced a trap composed of 18 places in 364 ms of which 1 ms to minimize.
[2023-03-15 22:07:53] [INFO ] Deduced a trap composed of 55 places in 210 ms of which 1 ms to minimize.
[2023-03-15 22:07:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1126 ms
[2023-03-15 22:07:53] [INFO ] Deduced a trap composed of 29 places in 316 ms of which 1 ms to minimize.
[2023-03-15 22:07:54] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 1 ms to minimize.
[2023-03-15 22:07:54] [INFO ] Deduced a trap composed of 45 places in 308 ms of which 1 ms to minimize.
[2023-03-15 22:07:54] [INFO ] Deduced a trap composed of 54 places in 304 ms of which 1 ms to minimize.
[2023-03-15 22:07:55] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 0 ms to minimize.
[2023-03-15 22:07:55] [INFO ] Deduced a trap composed of 53 places in 325 ms of which 1 ms to minimize.
[2023-03-15 22:07:55] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 1 ms to minimize.
[2023-03-15 22:07:56] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 0 ms to minimize.
[2023-03-15 22:07:56] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 0 ms to minimize.
[2023-03-15 22:07:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3290 ms
[2023-03-15 22:07:56] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2023-03-15 22:07:57] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 1 ms to minimize.
[2023-03-15 22:07:57] [INFO ] Deduced a trap composed of 46 places in 185 ms of which 1 ms to minimize.
[2023-03-15 22:07:57] [INFO ] Deduced a trap composed of 18 places in 369 ms of which 1 ms to minimize.
[2023-03-15 22:07:58] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 1 ms to minimize.
[2023-03-15 22:07:58] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 1 ms to minimize.
[2023-03-15 22:07:59] [INFO ] Deduced a trap composed of 54 places in 286 ms of which 1 ms to minimize.
[2023-03-15 22:07:59] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 1 ms to minimize.
[2023-03-15 22:07:59] [INFO ] Deduced a trap composed of 54 places in 286 ms of which 1 ms to minimize.
[2023-03-15 22:08:00] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:08:00] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 1 ms to minimize.
[2023-03-15 22:08:00] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 1 ms to minimize.
[2023-03-15 22:08:01] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 1 ms to minimize.
[2023-03-15 22:08:01] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 1 ms to minimize.
[2023-03-15 22:08:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4871 ms
[2023-03-15 22:08:02] [INFO ] Deduced a trap composed of 45 places in 384 ms of which 1 ms to minimize.
[2023-03-15 22:08:02] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2023-03-15 22:08:02] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:08:03] [INFO ] Deduced a trap composed of 10 places in 394 ms of which 1 ms to minimize.
[2023-03-15 22:08:03] [INFO ] Deduced a trap composed of 10 places in 385 ms of which 1 ms to minimize.
[2023-03-15 22:08:04] [INFO ] Deduced a trap composed of 40 places in 405 ms of which 1 ms to minimize.
[2023-03-15 22:08:04] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 1 ms to minimize.
[2023-03-15 22:08:05] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 1 ms to minimize.
[2023-03-15 22:08:05] [INFO ] Deduced a trap composed of 33 places in 340 ms of which 1 ms to minimize.
[2023-03-15 22:08:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3980 ms
[2023-03-15 22:08:06] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
[2023-03-15 22:08:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 696 ms
[2023-03-15 22:08:06] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 0 ms to minimize.
[2023-03-15 22:08:07] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 0 ms to minimize.
[2023-03-15 22:08:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 424 ms
[2023-03-15 22:08:07] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 1 ms to minimize.
[2023-03-15 22:08:07] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 0 ms to minimize.
[2023-03-15 22:08:08] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 0 ms to minimize.
[2023-03-15 22:08:08] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 1 ms to minimize.
[2023-03-15 22:08:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1370 ms
[2023-03-15 22:08:08] [INFO ] After 90656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :174
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-15 22:08:08] [INFO ] After 100013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :174
Interrupted random walk after 434043 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 367) 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 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 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 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 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 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 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 91 ms. (steps per millisecond=109 ) 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 81 ms. (steps per millisecond=123 ) properties (out of 367) 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 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) 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 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 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 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 86 ms. (steps per millisecond=116 ) 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 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 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 81 ms. (steps per millisecond=123 ) 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 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 82 ms. (steps per millisecond=121 ) properties (out of 367) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) 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 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 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 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 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 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 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 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 81 ms. (steps per millisecond=123 ) 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 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 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 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 81 ms. (steps per millisecond=123 ) 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 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 129 ms. (steps per millisecond=77 ) 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 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 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 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 79 ms. (steps per millisecond=126 ) properties (out of 367) seen :0
Interrupted probabilistic random walk after 7490584 steps, run timeout after 102001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 7490584 steps, saw 945501 distinct states, run finished after 102001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 367 properties.
[2023-03-15 22:10:25] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:10:25] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:10:29] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 22:10:51] [INFO ] After 18789ms SMT Verify possible using state equation in real domain returned unsat :0 sat :21 real:346
[2023-03-15 22:10:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:10:53] [INFO ] After 1491ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 22:10:53] [INFO ] After 28050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:367
[2023-03-15 22:10:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 22:11:20] [INFO ] After 16993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :367
[2023-03-15 22:11:39] [INFO ] After 19459ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :367
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 1 ms to minimize.
[2023-03-15 22:11:40] [INFO ] Deduced a trap composed of 26 places in 424 ms of which 1 ms to minimize.
[2023-03-15 22:11:41] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 1 ms to minimize.
[2023-03-15 22:11:41] [INFO ] Deduced a trap composed of 26 places in 421 ms of which 1 ms to minimize.
[2023-03-15 22:11:41] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 1 ms to minimize.
[2023-03-15 22:11:42] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 1 ms to minimize.
[2023-03-15 22:11:42] [INFO ] Deduced a trap composed of 27 places in 391 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 18 places in 412 ms of which 1 ms to minimize.
[2023-03-15 22:11:43] [INFO ] Deduced a trap composed of 34 places in 406 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 10 places in 373 ms of which 1 ms to minimize.
[2023-03-15 22:11:44] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 14 places in 394 ms of which 1 ms to minimize.
[2023-03-15 22:11:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5630 ms
[2023-03-15 22:11:45] [INFO ] Deduced a trap composed of 51 places in 397 ms of which 1 ms to minimize.
[2023-03-15 22:11:46] [INFO ] Deduced a trap composed of 53 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:11:46] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
[2023-03-15 22:11:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1403 ms
[2023-03-15 22:11:47] [INFO ] Deduced a trap composed of 12 places in 373 ms of which 1 ms to minimize.
[2023-03-15 22:11:47] [INFO ] Deduced a trap composed of 58 places in 370 ms of which 1 ms to minimize.
[2023-03-15 22:11:48] [INFO ] Deduced a trap composed of 80 places in 369 ms of which 1 ms to minimize.
[2023-03-15 22:11:48] [INFO ] Deduced a trap composed of 28 places in 373 ms of which 1 ms to minimize.
[2023-03-15 22:11:49] [INFO ] Deduced a trap composed of 58 places in 394 ms of which 1 ms to minimize.
[2023-03-15 22:11:49] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 1 ms to minimize.
[2023-03-15 22:11:50] [INFO ] Deduced a trap composed of 35 places in 370 ms of which 1 ms to minimize.
[2023-03-15 22:11:50] [INFO ] Deduced a trap composed of 42 places in 361 ms of which 1 ms to minimize.
[2023-03-15 22:11:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3491 ms
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 28 places in 357 ms of which 1 ms to minimize.
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 1 ms to minimize.
[2023-03-15 22:11:51] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 1 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 0 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 28 places in 322 ms of which 1 ms to minimize.
[2023-03-15 22:11:52] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 1 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 68 places in 331 ms of which 1 ms to minimize.
[2023-03-15 22:11:53] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 1 ms to minimize.
[2023-03-15 22:11:54] [INFO ] Deduced a trap composed of 20 places in 325 ms of which 1 ms to minimize.
[2023-03-15 22:11:54] [INFO ] Deduced a trap composed of 67 places in 318 ms of which 1 ms to minimize.
[2023-03-15 22:11:54] [INFO ] Deduced a trap composed of 20 places in 326 ms of which 1 ms to minimize.
[2023-03-15 22:11:55] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 1 ms to minimize.
[2023-03-15 22:11:55] [INFO ] Deduced a trap composed of 12 places in 328 ms of which 1 ms to minimize.
[2023-03-15 22:11:55] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 0 ms to minimize.
[2023-03-15 22:11:56] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 1 ms to minimize.
[2023-03-15 22:11:56] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 0 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 0 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 1 ms to minimize.
[2023-03-15 22:11:57] [INFO ] Deduced a trap composed of 21 places in 316 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 7472 ms
[2023-03-15 22:11:58] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 1 ms to minimize.
[2023-03-15 22:11:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-15 22:11:59] [INFO ] Deduced a trap composed of 44 places in 331 ms of which 1 ms to minimize.
[2023-03-15 22:11:59] [INFO ] Deduced a trap composed of 62 places in 321 ms of which 0 ms to minimize.
[2023-03-15 22:12:00] [INFO ] Deduced a trap composed of 86 places in 292 ms of which 0 ms to minimize.
[2023-03-15 22:12:00] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 1 ms to minimize.
[2023-03-15 22:12:00] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 1 ms to minimize.
[2023-03-15 22:12:01] [INFO ] Deduced a trap composed of 52 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:12:01] [INFO ] Deduced a trap composed of 36 places in 323 ms of which 1 ms to minimize.
[2023-03-15 22:12:01] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 1 ms to minimize.
[2023-03-15 22:12:02] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 0 ms to minimize.
[2023-03-15 22:12:02] [INFO ] Deduced a trap composed of 51 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:12:02] [INFO ] Deduced a trap composed of 51 places in 293 ms of which 1 ms to minimize.
[2023-03-15 22:12:03] [INFO ] Deduced a trap composed of 52 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:12:03] [INFO ] Deduced a trap composed of 73 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:12:03] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 1 ms to minimize.
[2023-03-15 22:12:04] [INFO ] Deduced a trap composed of 47 places in 325 ms of which 1 ms to minimize.
[2023-03-15 22:12:04] [INFO ] Deduced a trap composed of 46 places in 266 ms of which 1 ms to minimize.
[2023-03-15 22:12:04] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 1 ms to minimize.
[2023-03-15 22:12:05] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 1 ms to minimize.
[2023-03-15 22:12:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6351 ms
[2023-03-15 22:12:05] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 1 ms to minimize.
[2023-03-15 22:12:06] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 0 ms to minimize.
[2023-03-15 22:12:06] [INFO ] Deduced a trap composed of 29 places in 366 ms of which 1 ms to minimize.
[2023-03-15 22:12:07] [INFO ] Deduced a trap composed of 20 places in 398 ms of which 1 ms to minimize.
[2023-03-15 22:12:07] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 1 ms to minimize.
[2023-03-15 22:12:08] [INFO ] Deduced a trap composed of 22 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:12:08] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2023-03-15 22:12:08] [INFO ] Deduced a trap composed of 20 places in 371 ms of which 1 ms to minimize.
[2023-03-15 22:12:09] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 1 ms to minimize.
[2023-03-15 22:12:09] [INFO ] Deduced a trap composed of 30 places in 336 ms of which 1 ms to minimize.
[2023-03-15 22:12:10] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 1 ms to minimize.
[2023-03-15 22:12:10] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 1 ms to minimize.
[2023-03-15 22:12:10] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 0 ms to minimize.
[2023-03-15 22:12:11] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 0 ms to minimize.
[2023-03-15 22:12:11] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 1 ms to minimize.
[2023-03-15 22:12:11] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 6105 ms
[2023-03-15 22:12:11] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 1 ms to minimize.
[2023-03-15 22:12:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-15 22:12:12] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 1 ms to minimize.
[2023-03-15 22:12:12] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 0 ms to minimize.
[2023-03-15 22:12:12] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 1 ms to minimize.
[2023-03-15 22:12:13] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 1 ms to minimize.
[2023-03-15 22:12:13] [INFO ] Deduced a trap composed of 58 places in 280 ms of which 0 ms to minimize.
[2023-03-15 22:12:13] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 0 ms to minimize.
[2023-03-15 22:12:14] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 1 ms to minimize.
[2023-03-15 22:12:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2300 ms
[2023-03-15 22:12:14] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 1 ms to minimize.
[2023-03-15 22:12:14] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 1 ms to minimize.
[2023-03-15 22:12:15] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 1 ms to minimize.
[2023-03-15 22:12:15] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:12:15] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 1 ms to minimize.
[2023-03-15 22:12:16] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 1 ms to minimize.
[2023-03-15 22:12:16] [INFO ] Deduced a trap composed of 21 places in 370 ms of which 1 ms to minimize.
[2023-03-15 22:12:17] [INFO ] Deduced a trap composed of 66 places in 281 ms of which 0 ms to minimize.
[2023-03-15 22:12:17] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 0 ms to minimize.
[2023-03-15 22:12:17] [INFO ] Deduced a trap composed of 44 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:12:18] [INFO ] Deduced a trap composed of 61 places in 308 ms of which 0 ms to minimize.
[2023-03-15 22:12:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4083 ms
[2023-03-15 22:12:18] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 1 ms to minimize.
[2023-03-15 22:12:19] [INFO ] Deduced a trap composed of 43 places in 372 ms of which 0 ms to minimize.
[2023-03-15 22:12:19] [INFO ] Deduced a trap composed of 45 places in 207 ms of which 1 ms to minimize.
[2023-03-15 22:12:19] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 1 ms to minimize.
[2023-03-15 22:12:20] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 1 ms to minimize.
[2023-03-15 22:12:20] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 0 ms to minimize.
[2023-03-15 22:12:20] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2023-03-15 22:12:20] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 1 ms to minimize.
[2023-03-15 22:12:20] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 1 ms to minimize.
[2023-03-15 22:12:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2546 ms
[2023-03-15 22:12:21] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2023-03-15 22:12:21] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 1 ms to minimize.
[2023-03-15 22:12:21] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 0 ms to minimize.
[2023-03-15 22:12:21] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:12:21] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:12:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 814 ms
[2023-03-15 22:12:22] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 1 ms to minimize.
[2023-03-15 22:12:22] [INFO ] Deduced a trap composed of 10 places in 370 ms of which 1 ms to minimize.
[2023-03-15 22:12:23] [INFO ] Deduced a trap composed of 22 places in 320 ms of which 1 ms to minimize.
[2023-03-15 22:12:23] [INFO ] Deduced a trap composed of 26 places in 286 ms of which 1 ms to minimize.
[2023-03-15 22:12:23] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 1 ms to minimize.
[2023-03-15 22:12:24] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 0 ms to minimize.
[2023-03-15 22:12:24] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 0 ms to minimize.
[2023-03-15 22:12:24] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:12:24] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 0 ms to minimize.
[2023-03-15 22:12:24] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 1 ms to minimize.
[2023-03-15 22:12:24] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2023-03-15 22:12:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2826 ms
[2023-03-15 22:12:25] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 1 ms to minimize.
[2023-03-15 22:12:25] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 1 ms to minimize.
[2023-03-15 22:12:25] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 1 ms to minimize.
[2023-03-15 22:12:25] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 1 ms to minimize.
[2023-03-15 22:12:26] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2023-03-15 22:12:26] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 0 ms to minimize.
[2023-03-15 22:12:26] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 0 ms to minimize.
[2023-03-15 22:12:26] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 0 ms to minimize.
[2023-03-15 22:12:26] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 1 ms to minimize.
[2023-03-15 22:12:26] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2023-03-15 22:12:27] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 1 ms to minimize.
[2023-03-15 22:12:27] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 1 ms to minimize.
[2023-03-15 22:12:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2206 ms
[2023-03-15 22:12:27] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 0 ms to minimize.
[2023-03-15 22:12:27] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2023-03-15 22:12:27] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 1 ms to minimize.
[2023-03-15 22:12:28] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 0 ms to minimize.
[2023-03-15 22:12:28] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 0 ms to minimize.
[2023-03-15 22:12:29] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:12:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2021 ms
[2023-03-15 22:12:30] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:12:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2023-03-15 22:12:30] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 1 ms to minimize.
[2023-03-15 22:12:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2023-03-15 22:12:31] [INFO ] Deduced a trap composed of 26 places in 379 ms of which 0 ms to minimize.
[2023-03-15 22:12:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 496 ms
[2023-03-15 22:12:31] [INFO ] Deduced a trap composed of 42 places in 295 ms of which 1 ms to minimize.
[2023-03-15 22:12:31] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 1 ms to minimize.
[2023-03-15 22:12:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 730 ms
[2023-03-15 22:12:32] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 1 ms to minimize.
[2023-03-15 22:12:32] [INFO ] Deduced a trap composed of 56 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:12:33] [INFO ] Deduced a trap composed of 34 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:12:33] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:12:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1454 ms
[2023-03-15 22:12:33] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
[2023-03-15 22:12:34] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 1 ms to minimize.
[2023-03-15 22:12:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2023-03-15 22:12:34] [INFO ] Deduced a trap composed of 36 places in 434 ms of which 2 ms to minimize.
[2023-03-15 22:12:35] [INFO ] Deduced a trap composed of 59 places in 449 ms of which 1 ms to minimize.
[2023-03-15 22:12:35] [INFO ] Deduced a trap composed of 30 places in 446 ms of which 0 ms to minimize.
[2023-03-15 22:12:36] [INFO ] Deduced a trap composed of 10 places in 424 ms of which 1 ms to minimize.
[2023-03-15 22:12:36] [INFO ] Deduced a trap composed of 10 places in 429 ms of which 1 ms to minimize.
[2023-03-15 22:12:37] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 0 ms to minimize.
[2023-03-15 22:12:37] [INFO ] Deduced a trap composed of 13 places in 395 ms of which 0 ms to minimize.
[2023-03-15 22:12:38] [INFO ] Deduced a trap composed of 41 places in 412 ms of which 1 ms to minimize.
[2023-03-15 22:12:38] [INFO ] Deduced a trap composed of 45 places in 406 ms of which 0 ms to minimize.
[2023-03-15 22:12:39] [INFO ] Deduced a trap composed of 56 places in 379 ms of which 1 ms to minimize.
[2023-03-15 22:12:39] [INFO ] Deduced a trap composed of 24 places in 398 ms of which 1 ms to minimize.
[2023-03-15 22:12:40] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 1 ms to minimize.
[2023-03-15 22:12:40] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 1 ms to minimize.
[2023-03-15 22:12:41] [INFO ] Deduced a trap composed of 11 places in 382 ms of which 1 ms to minimize.
[2023-03-15 22:12:41] [INFO ] Deduced a trap composed of 11 places in 408 ms of which 1 ms to minimize.
[2023-03-15 22:12:41] [INFO ] Deduced a trap composed of 11 places in 393 ms of which 1 ms to minimize.
[2023-03-15 22:12:42] [INFO ] Deduced a trap composed of 61 places in 406 ms of which 0 ms to minimize.
[2023-03-15 22:12:42] [INFO ] Deduced a trap composed of 29 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:12:43] [INFO ] Deduced a trap composed of 23 places in 405 ms of which 1 ms to minimize.
[2023-03-15 22:12:43] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 1 ms to minimize.
[2023-03-15 22:12:44] [INFO ] Deduced a trap composed of 63 places in 409 ms of which 1 ms to minimize.
[2023-03-15 22:12:44] [INFO ] Deduced a trap composed of 37 places in 388 ms of which 1 ms to minimize.
[2023-03-15 22:12:45] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:12:45] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 1 ms to minimize.
[2023-03-15 22:12:45] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 1 ms to minimize.
[2023-03-15 22:12:46] [INFO ] Deduced a trap composed of 60 places in 314 ms of which 0 ms to minimize.
[2023-03-15 22:12:46] [INFO ] Deduced a trap composed of 54 places in 335 ms of which 1 ms to minimize.
[2023-03-15 22:12:47] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 1 ms to minimize.
[2023-03-15 22:12:47] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 12582 ms
[2023-03-15 22:12:47] [INFO ] Deduced a trap composed of 22 places in 355 ms of which 1 ms to minimize.
[2023-03-15 22:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2023-03-15 22:12:48] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 1 ms to minimize.
[2023-03-15 22:12:48] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2023-03-15 22:12:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 573 ms
[2023-03-15 22:12:48] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 1 ms to minimize.
[2023-03-15 22:12:48] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 0 ms to minimize.
[2023-03-15 22:12:49] [INFO ] Deduced a trap composed of 45 places in 364 ms of which 1 ms to minimize.
[2023-03-15 22:12:49] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
[2023-03-15 22:12:50] [INFO ] Deduced a trap composed of 67 places in 386 ms of which 1 ms to minimize.
[2023-03-15 22:12:50] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 1 ms to minimize.
[2023-03-15 22:12:50] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 1 ms to minimize.
[2023-03-15 22:12:51] [INFO ] Deduced a trap composed of 52 places in 263 ms of which 1 ms to minimize.
[2023-03-15 22:12:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3107 ms
[2023-03-15 22:12:51] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 1 ms to minimize.
[2023-03-15 22:12:52] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 1 ms to minimize.
[2023-03-15 22:12:52] [INFO ] Deduced a trap composed of 30 places in 310 ms of which 1 ms to minimize.
[2023-03-15 22:12:53] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 0 ms to minimize.
[2023-03-15 22:12:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1726 ms
[2023-03-15 22:12:53] [INFO ] Deduced a trap composed of 53 places in 249 ms of which 1 ms to minimize.
[2023-03-15 22:12:53] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 1 ms to minimize.
[2023-03-15 22:12:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 657 ms
[2023-03-15 22:12:54] [INFO ] Deduced a trap composed of 21 places in 377 ms of which 1 ms to minimize.
[2023-03-15 22:12:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 491 ms
[2023-03-15 22:12:55] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2023-03-15 22:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 22:12:55] [INFO ] Deduced a trap composed of 37 places in 334 ms of which 1 ms to minimize.
[2023-03-15 22:12:56] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 0 ms to minimize.
[2023-03-15 22:12:56] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 1 ms to minimize.
[2023-03-15 22:12:56] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-15 22:13:03] [INFO ] Deduced a trap composed of 30 places in 193 ms of which 0 ms to minimize.
[2023-03-15 22:13:04] [INFO ] Deduced a trap composed of 35 places in 413 ms of which 1 ms to minimize.
[2023-03-15 22:13:04] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 1 ms to minimize.
[2023-03-15 22:13:04] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 0 ms to minimize.
[2023-03-15 22:13:05] [INFO ] Deduced a trap composed of 54 places in 260 ms of which 1 ms to minimize.
[2023-03-15 22:13:05] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 1 ms to minimize.
[2023-03-15 22:13:05] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:13:06] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 1 ms to minimize.
[2023-03-15 22:13:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 10749 ms
[2023-03-15 22:13:06] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:13:06] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 1 ms to minimize.
[2023-03-15 22:13:07] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:13:07] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 0 ms to minimize.
[2023-03-15 22:13:07] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 1 ms to minimize.
[2023-03-15 22:13:08] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 0 ms to minimize.
[2023-03-15 22:13:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2027 ms
[2023-03-15 22:13:08] [INFO ] Deduced a trap composed of 60 places in 259 ms of which 0 ms to minimize.
[2023-03-15 22:13:08] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 1 ms to minimize.
[2023-03-15 22:13:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-15 22:13:09] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 1 ms to minimize.
[2023-03-15 22:13:10] [INFO ] Deduced a trap composed of 65 places in 290 ms of which 1 ms to minimize.
[2023-03-15 22:13:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 897 ms
[2023-03-15 22:13:10] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 1 ms to minimize.
[2023-03-15 22:13:11] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 1 ms to minimize.
[2023-03-15 22:13:11] [INFO ] Deduced a trap composed of 74 places in 321 ms of which 1 ms to minimize.
[2023-03-15 22:13:11] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 1 ms to minimize.
[2023-03-15 22:13:12] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 1 ms to minimize.
[2023-03-15 22:13:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2019 ms
[2023-03-15 22:13:12] [INFO ] Deduced a trap composed of 53 places in 353 ms of which 0 ms to minimize.
[2023-03-15 22:13:13] [INFO ] Deduced a trap composed of 79 places in 365 ms of which 1 ms to minimize.
[2023-03-15 22:13:13] [INFO ] Deduced a trap composed of 23 places in 352 ms of which 1 ms to minimize.
[2023-03-15 22:13:14] [INFO ] Deduced a trap composed of 31 places in 353 ms of which 1 ms to minimize.
[2023-03-15 22:13:14] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:13:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2060 ms
[2023-03-15 22:13:15] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2023-03-15 22:13:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2023-03-15 22:13:17] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2023-03-15 22:13:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-15 22:13:17] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 1 ms to minimize.
[2023-03-15 22:13:18] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2023-03-15 22:13:19] [INFO ] Deduced a trap composed of 14 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:13:19] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 1 ms to minimize.
[2023-03-15 22:13:20] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 0 ms to minimize.
[2023-03-15 22:13:20] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 1 ms to minimize.
[2023-03-15 22:13:20] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 1 ms to minimize.
[2023-03-15 22:13:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4139 ms
[2023-03-15 22:13:22] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 1 ms to minimize.
[2023-03-15 22:13:23] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 0 ms to minimize.
[2023-03-15 22:13:23] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 1 ms to minimize.
[2023-03-15 22:13:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1084 ms
[2023-03-15 22:13:24] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2023-03-15 22:13:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2023-03-15 22:13:25] [INFO ] Deduced a trap composed of 72 places in 334 ms of which 1 ms to minimize.
[2023-03-15 22:13:25] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 0 ms to minimize.
[2023-03-15 22:13:26] [INFO ] Deduced a trap composed of 63 places in 322 ms of which 1 ms to minimize.
[2023-03-15 22:13:26] [INFO ] Deduced a trap composed of 52 places in 326 ms of which 0 ms to minimize.
[2023-03-15 22:13:26] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 1 ms to minimize.
[2023-03-15 22:13:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1819 ms
[2023-03-15 22:13:27] [INFO ] Deduced a trap composed of 42 places in 381 ms of which 1 ms to minimize.
[2023-03-15 22:13:28] [INFO ] Deduced a trap composed of 26 places in 350 ms of which 0 ms to minimize.
[2023-03-15 22:13:28] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 0 ms to minimize.
[2023-03-15 22:13:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1295 ms
[2023-03-15 22:13:29] [INFO ] Deduced a trap composed of 15 places in 294 ms of which 1 ms to minimize.
[2023-03-15 22:13:29] [INFO ] Deduced a trap composed of 13 places in 345 ms of which 1 ms to minimize.
[2023-03-15 22:13:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 801 ms
[2023-03-15 22:13:30] [INFO ] Deduced a trap composed of 18 places in 380 ms of which 1 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 50 places in 332 ms of which 0 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 46 places in 254 ms of which 1 ms to minimize.
[2023-03-15 22:13:31] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 1 ms to minimize.
[2023-03-15 22:13:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1949 ms
[2023-03-15 22:13:33] [INFO ] Deduced a trap composed of 39 places in 296 ms of which 1 ms to minimize.
[2023-03-15 22:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 1 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 39 places in 260 ms of which 1 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 1 ms to minimize.
[2023-03-15 22:13:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1003 ms
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 0 ms to minimize.
[2023-03-15 22:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-15 22:13:37] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 1 ms to minimize.
[2023-03-15 22:13:38] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:13:38] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 1 ms to minimize.
[2023-03-15 22:13:38] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 1 ms to minimize.
[2023-03-15 22:13:39] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 0 ms to minimize.
[2023-03-15 22:13:39] [INFO ] Deduced a trap composed of 43 places in 349 ms of which 1 ms to minimize.
[2023-03-15 22:13:39] [INFO ] Deduced a trap composed of 67 places in 316 ms of which 1 ms to minimize.
[2023-03-15 22:13:40] [INFO ] Deduced a trap composed of 43 places in 319 ms of which 1 ms to minimize.
[2023-03-15 22:13:40] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 0 ms to minimize.
[2023-03-15 22:13:40] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 1 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 1 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 0 ms to minimize.
[2023-03-15 22:13:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3729 ms
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 1 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:13:42] [INFO ] Deduced a trap composed of 20 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:13:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1099 ms
[2023-03-15 22:13:44] [INFO ] Deduced a trap composed of 35 places in 311 ms of which 1 ms to minimize.
[2023-03-15 22:13:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1011 ms
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 1 ms to minimize.
[2023-03-15 22:13:45] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 1 ms to minimize.
[2023-03-15 22:13:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 773 ms
[2023-03-15 22:13:46] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 0 ms to minimize.
[2023-03-15 22:13:47] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 1 ms to minimize.
[2023-03-15 22:13:47] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 1 ms to minimize.
[2023-03-15 22:13:47] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 1 ms to minimize.
[2023-03-15 22:13:47] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2023-03-15 22:13:48] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 1 ms to minimize.
[2023-03-15 22:13:48] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 0 ms to minimize.
[2023-03-15 22:13:48] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 1 ms to minimize.
[2023-03-15 22:13:48] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 0 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2626 ms
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 1 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 0 ms to minimize.
[2023-03-15 22:13:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2023-03-15 22:13:50] [INFO ] Deduced a trap composed of 50 places in 173 ms of which 0 ms to minimize.
[2023-03-15 22:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-15 22:13:51] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 0 ms to minimize.
[2023-03-15 22:13:51] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 1 ms to minimize.
[2023-03-15 22:13:51] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 1 ms to minimize.
[2023-03-15 22:13:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 792 ms
[2023-03-15 22:13:52] [INFO ] Deduced a trap composed of 23 places in 220 ms of which 1 ms to minimize.
[2023-03-15 22:13:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-15 22:13:53] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 0 ms to minimize.
[2023-03-15 22:13:53] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 0 ms to minimize.
[2023-03-15 22:13:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 631 ms
[2023-03-15 22:13:55] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 1 ms to minimize.
[2023-03-15 22:13:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2023-03-15 22:13:56] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:13:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 447 ms
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 0 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 0 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2023-03-15 22:13:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1190 ms
[2023-03-15 22:14:00] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 0 ms to minimize.
[2023-03-15 22:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-15 22:14:01] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 0 ms to minimize.
[2023-03-15 22:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-15 22:14:03] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2023-03-15 22:14:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 1 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 1 ms to minimize.
[2023-03-15 22:14:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 571 ms
[2023-03-15 22:14:05] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-15 22:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 0 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 1 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 515 ms
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 0 ms to minimize.
[2023-03-15 22:14:07] [INFO ] Deduced a trap composed of 38 places in 257 ms of which 1 ms to minimize.
[2023-03-15 22:14:08] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2023-03-15 22:14:08] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 1 ms to minimize.
[2023-03-15 22:14:08] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 0 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1873 ms
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 1 ms to minimize.
[2023-03-15 22:14:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2023-03-15 22:14:09] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 52 places in 272 ms of which 1 ms to minimize.
[2023-03-15 22:14:10] [INFO ] Deduced a trap composed of 19 places in 335 ms of which 0 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 1 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 1 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 1 ms to minimize.
[2023-03-15 22:14:11] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 1 ms to minimize.
[2023-03-15 22:14:12] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 1 ms to minimize.
[2023-03-15 22:14:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2624 ms
[2023-03-15 22:14:16] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 0 ms to minimize.
[2023-03-15 22:14:16] [INFO ] Deduced a trap composed of 58 places in 255 ms of which 0 ms to minimize.
[2023-03-15 22:14:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2023-03-15 22:14:17] [INFO ] Deduced a trap composed of 52 places in 194 ms of which 1 ms to minimize.
[2023-03-15 22:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-15 22:14:22] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 0 ms to minimize.
[2023-03-15 22:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-15 22:14:22] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 1 ms to minimize.
[2023-03-15 22:14:22] [INFO ] Deduced a trap composed of 24 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:14:23] [INFO ] Deduced a trap composed of 49 places in 270 ms of which 1 ms to minimize.
[2023-03-15 22:14:23] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 0 ms to minimize.
[2023-03-15 22:14:24] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 1 ms to minimize.
[2023-03-15 22:14:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2456 ms
[2023-03-15 22:14:25] [INFO ] Deduced a trap composed of 82 places in 365 ms of which 1 ms to minimize.
[2023-03-15 22:14:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 499 ms
[2023-03-15 22:14:28] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 0 ms to minimize.
[2023-03-15 22:14:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 0 ms to minimize.
[2023-03-15 22:14:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 619 ms
[2023-03-15 22:14:38] [INFO ] After 198225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :366
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 22:14:38] [INFO ] After 225025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :366
Fused 367 Parikh solutions to 342 different solutions.
Parikh walk visited 0 properties in 5490 ms.
Support contains 268 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 33 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 18 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 22:14:43] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:14:43] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:14:44] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-15 22:14:44] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:14:44] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:14:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:14:45] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2023-03-15 22:14:45] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-15 22:14:45] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:14:45] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:14:46] [INFO ] Dead Transitions using invariants and state equation in 971 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 5936 ms. (steps per millisecond=16 ) properties (out of 268) seen :97
Running SMT prover for 171 properties.
[2023-03-15 22:14:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:14:52] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:14:55] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 22:15:06] [INFO ] After 13380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:171
[2023-03-15 22:15:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 22:15:18] [INFO ] After 8054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :171
[2023-03-15 22:15:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:15:27] [INFO ] After 9099ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :171
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 27 places in 430 ms of which 1 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 19 places in 414 ms of which 1 ms to minimize.
[2023-03-15 22:15:29] [INFO ] Deduced a trap composed of 12 places in 418 ms of which 1 ms to minimize.
[2023-03-15 22:15:29] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 1 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 52 places in 341 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 0 ms to minimize.
[2023-03-15 22:15:32] [INFO ] Deduced a trap composed of 12 places in 395 ms of which 1 ms to minimize.
[2023-03-15 22:15:32] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 65 places in 382 ms of which 1 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 44 places in 320 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 21 places in 346 ms of which 0 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 21 places in 370 ms of which 1 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:15:36] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 1 ms to minimize.
[2023-03-15 22:15:36] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 1 ms to minimize.
[2023-03-15 22:15:36] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 1 ms to minimize.
[2023-03-15 22:15:36] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 8703 ms
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 1 ms to minimize.
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 30 places in 326 ms of which 1 ms to minimize.
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 29 places in 335 ms of which 1 ms to minimize.
[2023-03-15 22:15:38] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2023-03-15 22:15:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1604 ms
[2023-03-15 22:15:38] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 0 ms to minimize.
[2023-03-15 22:15:39] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:15:39] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 1 ms to minimize.
[2023-03-15 22:15:39] [INFO ] Deduced a trap composed of 46 places in 300 ms of which 1 ms to minimize.
[2023-03-15 22:15:40] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 1 ms to minimize.
[2023-03-15 22:15:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1836 ms
[2023-03-15 22:15:40] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2023-03-15 22:15:41] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 1 ms to minimize.
[2023-03-15 22:15:41] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:15:41] [INFO ] Deduced a trap composed of 39 places in 282 ms of which 1 ms to minimize.
[2023-03-15 22:15:41] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 1 ms to minimize.
[2023-03-15 22:15:42] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 1 ms to minimize.
[2023-03-15 22:15:42] [INFO ] Deduced a trap composed of 20 places in 406 ms of which 1 ms to minimize.
[2023-03-15 22:15:43] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 0 ms to minimize.
[2023-03-15 22:15:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2777 ms
[2023-03-15 22:15:43] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 1 ms to minimize.
[2023-03-15 22:15:43] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 1 ms to minimize.
[2023-03-15 22:15:44] [INFO ] Deduced a trap composed of 36 places in 267 ms of which 1 ms to minimize.
[2023-03-15 22:15:44] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 0 ms to minimize.
[2023-03-15 22:15:44] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 0 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 1 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 1 ms to minimize.
[2023-03-15 22:15:45] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 1 ms to minimize.
[2023-03-15 22:15:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3205 ms
[2023-03-15 22:15:46] [INFO ] Deduced a trap composed of 60 places in 354 ms of which 1 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 0 ms to minimize.
[2023-03-15 22:15:47] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 1 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 53 places in 316 ms of which 0 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 79 places in 298 ms of which 1 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Deduced a trap composed of 35 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:15:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2321 ms
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 1 ms to minimize.
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 52 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:15:50] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 1 ms to minimize.
[2023-03-15 22:15:50] [INFO ] Deduced a trap composed of 45 places in 255 ms of which 1 ms to minimize.
[2023-03-15 22:15:50] [INFO ] Deduced a trap composed of 37 places in 315 ms of which 0 ms to minimize.
[2023-03-15 22:15:51] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 1 ms to minimize.
[2023-03-15 22:15:51] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 1 ms to minimize.
[2023-03-15 22:15:51] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 1 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 1 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 1 ms to minimize.
[2023-03-15 22:15:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3622 ms
[2023-03-15 22:15:52] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 1 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 0 ms to minimize.
[2023-03-15 22:15:53] [INFO ] Deduced a trap composed of 29 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 1 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 1 ms to minimize.
[2023-03-15 22:15:54] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 1 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 50 places in 319 ms of which 1 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 0 ms to minimize.
[2023-03-15 22:15:55] [INFO ] Deduced a trap composed of 20 places in 350 ms of which 1 ms to minimize.
[2023-03-15 22:15:56] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 42 places in 363 ms of which 1 ms to minimize.
[2023-03-15 22:15:57] [INFO ] Deduced a trap composed of 42 places in 429 ms of which 1 ms to minimize.
[2023-03-15 22:15:58] [INFO ] Deduced a trap composed of 18 places in 414 ms of which 1 ms to minimize.
[2023-03-15 22:15:58] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 1 ms to minimize.
[2023-03-15 22:15:58] [INFO ] Deduced a trap composed of 50 places in 398 ms of which 1 ms to minimize.
[2023-03-15 22:15:59] [INFO ] Deduced a trap composed of 50 places in 402 ms of which 1 ms to minimize.
[2023-03-15 22:15:59] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 1 ms to minimize.
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 0 ms to minimize.
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 49 places in 395 ms of which 1 ms to minimize.
[2023-03-15 22:16:01] [INFO ] Deduced a trap composed of 39 places in 417 ms of which 1 ms to minimize.
[2023-03-15 22:16:01] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 1 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 39 places in 350 ms of which 1 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 42 places in 393 ms of which 1 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 67 places in 368 ms of which 1 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 22 places in 372 ms of which 1 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 1 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 1 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 34 places in 318 ms of which 0 ms to minimize.
[2023-03-15 22:16:05] [INFO ] Deduced a trap composed of 34 places in 314 ms of which 1 ms to minimize.
[2023-03-15 22:16:05] [INFO ] Deduced a trap composed of 36 places in 309 ms of which 0 ms to minimize.
[2023-03-15 22:16:05] [INFO ] Deduced a trap composed of 18 places in 290 ms of which 1 ms to minimize.
[2023-03-15 22:16:06] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 1 ms to minimize.
[2023-03-15 22:16:06] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 1 ms to minimize.
[2023-03-15 22:16:06] [INFO ] Deduced a trap composed of 26 places in 221 ms of which 1 ms to minimize.
[2023-03-15 22:16:07] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 1 ms to minimize.
[2023-03-15 22:16:07] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2023-03-15 22:16:07] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 0 ms to minimize.
[2023-03-15 22:16:08] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2023-03-15 22:16:08] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 15684 ms
[2023-03-15 22:16:08] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 1 ms to minimize.
[2023-03-15 22:16:09] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 1 ms to minimize.
[2023-03-15 22:16:09] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 1 ms to minimize.
[2023-03-15 22:16:10] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 1 ms to minimize.
[2023-03-15 22:16:10] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 1 ms to minimize.
[2023-03-15 22:16:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1983 ms
[2023-03-15 22:16:10] [INFO ] Deduced a trap composed of 50 places in 282 ms of which 1 ms to minimize.
[2023-03-15 22:16:11] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 0 ms to minimize.
[2023-03-15 22:16:11] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 1 ms to minimize.
[2023-03-15 22:16:11] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 1 ms to minimize.
[2023-03-15 22:16:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1384 ms
[2023-03-15 22:16:12] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 1 ms to minimize.
[2023-03-15 22:16:13] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 0 ms to minimize.
[2023-03-15 22:16:13] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 1 ms to minimize.
[2023-03-15 22:16:13] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:16:14] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 0 ms to minimize.
[2023-03-15 22:16:14] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 1 ms to minimize.
[2023-03-15 22:16:15] [INFO ] Deduced a trap composed of 79 places in 384 ms of which 1 ms to minimize.
[2023-03-15 22:16:15] [INFO ] Deduced a trap composed of 70 places in 359 ms of which 1 ms to minimize.
[2023-03-15 22:16:16] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 1 ms to minimize.
[2023-03-15 22:16:16] [INFO ] Deduced a trap composed of 90 places in 342 ms of which 0 ms to minimize.
[2023-03-15 22:16:17] [INFO ] Deduced a trap composed of 70 places in 359 ms of which 1 ms to minimize.
[2023-03-15 22:16:17] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 1 ms to minimize.
[2023-03-15 22:16:17] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 1 ms to minimize.
[2023-03-15 22:16:18] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 1 ms to minimize.
[2023-03-15 22:16:18] [INFO ] Deduced a trap composed of 15 places in 338 ms of which 0 ms to minimize.
[2023-03-15 22:16:19] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 0 ms to minimize.
[2023-03-15 22:16:19] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 1 ms to minimize.
[2023-03-15 22:16:19] [INFO ] Deduced a trap composed of 14 places in 344 ms of which 1 ms to minimize.
[2023-03-15 22:16:20] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 0 ms to minimize.
[2023-03-15 22:16:20] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 1 ms to minimize.
[2023-03-15 22:16:21] [INFO ] Deduced a trap composed of 22 places in 322 ms of which 1 ms to minimize.
[2023-03-15 22:16:21] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:16:21] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 1 ms to minimize.
[2023-03-15 22:16:21] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 9493 ms
[2023-03-15 22:16:22] [INFO ] Deduced a trap composed of 18 places in 380 ms of which 1 ms to minimize.
[2023-03-15 22:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2023-03-15 22:16:23] [INFO ] Deduced a trap composed of 60 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:16:23] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:16:23] [INFO ] Deduced a trap composed of 61 places in 288 ms of which 1 ms to minimize.
[2023-03-15 22:16:24] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:16:24] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 1 ms to minimize.
[2023-03-15 22:16:25] [INFO ] Deduced a trap composed of 47 places in 289 ms of which 1 ms to minimize.
[2023-03-15 22:16:25] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 0 ms to minimize.
[2023-03-15 22:16:25] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 0 ms to minimize.
[2023-03-15 22:16:25] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 1 ms to minimize.
[2023-03-15 22:16:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2962 ms
[2023-03-15 22:16:26] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 0 ms to minimize.
[2023-03-15 22:16:26] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 1 ms to minimize.
[2023-03-15 22:16:26] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 1 ms to minimize.
[2023-03-15 22:16:27] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 1 ms to minimize.
[2023-03-15 22:16:27] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 0 ms to minimize.
[2023-03-15 22:16:28] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 0 ms to minimize.
[2023-03-15 22:16:28] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 1 ms to minimize.
[2023-03-15 22:16:28] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 1 ms to minimize.
[2023-03-15 22:16:28] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 1 ms to minimize.
[2023-03-15 22:16:29] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 0 ms to minimize.
[2023-03-15 22:16:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3140 ms
[2023-03-15 22:16:29] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 1 ms to minimize.
[2023-03-15 22:16:30] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 1 ms to minimize.
[2023-03-15 22:16:30] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 1 ms to minimize.
[2023-03-15 22:16:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 973 ms
[2023-03-15 22:16:30] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 1 ms to minimize.
[2023-03-15 22:16:31] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 1 ms to minimize.
[2023-03-15 22:16:31] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 1 ms to minimize.
[2023-03-15 22:16:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1180 ms
[2023-03-15 22:16:32] [INFO ] Deduced a trap composed of 62 places in 328 ms of which 1 ms to minimize.
[2023-03-15 22:16:32] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 1 ms to minimize.
[2023-03-15 22:16:32] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 0 ms to minimize.
[2023-03-15 22:16:33] [INFO ] Deduced a trap composed of 44 places in 286 ms of which 0 ms to minimize.
[2023-03-15 22:16:33] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 1 ms to minimize.
[2023-03-15 22:16:33] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 0 ms to minimize.
[2023-03-15 22:16:33] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 1 ms to minimize.
[2023-03-15 22:16:34] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 1 ms to minimize.
[2023-03-15 22:16:34] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 1 ms to minimize.
[2023-03-15 22:16:34] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 1 ms to minimize.
[2023-03-15 22:16:35] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 0 ms to minimize.
[2023-03-15 22:16:35] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 1 ms to minimize.
[2023-03-15 22:16:35] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2023-03-15 22:16:35] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2023-03-15 22:16:36] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4555 ms
[2023-03-15 22:16:36] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 1 ms to minimize.
[2023-03-15 22:16:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2023-03-15 22:16:36] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2023-03-15 22:16:37] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 1 ms to minimize.
[2023-03-15 22:16:37] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 1 ms to minimize.
[2023-03-15 22:16:37] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 0 ms to minimize.
[2023-03-15 22:16:37] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 0 ms to minimize.
[2023-03-15 22:16:38] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2023-03-15 22:16:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2462 ms
[2023-03-15 22:16:39] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2023-03-15 22:16:40] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 1 ms to minimize.
[2023-03-15 22:16:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 997 ms
[2023-03-15 22:16:41] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 0 ms to minimize.
[2023-03-15 22:16:41] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 1 ms to minimize.
[2023-03-15 22:16:41] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 0 ms to minimize.
[2023-03-15 22:16:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 881 ms
[2023-03-15 22:16:42] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 1 ms to minimize.
[2023-03-15 22:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-15 22:16:44] [INFO ] Deduced a trap composed of 11 places in 307 ms of which 1 ms to minimize.
[2023-03-15 22:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-15 22:16:44] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 1 ms to minimize.
[2023-03-15 22:16:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-15 22:16:45] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 0 ms to minimize.
[2023-03-15 22:16:45] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 1 ms to minimize.
[2023-03-15 22:16:46] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 1 ms to minimize.
[2023-03-15 22:16:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 22:16:46] [INFO ] After 100039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:171
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
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 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
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 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
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 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
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 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 665968 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :{}
Probabilistic random walk after 665968 steps, saw 89029 distinct states, run finished after 3001 ms. (steps per millisecond=221 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:16:49] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:16:49] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:16:49] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:16:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 22:16:49] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:16:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:16:50] [INFO ] After 85ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:16:50] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-15 22:16:50] [INFO ] After 752ms 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 38 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 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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 623288 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 623288 steps, saw 84453 distinct states, run finished after 3004 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:16:53] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:16:53] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:16:53] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:16:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 22:16:53] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:16:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:16:54] [INFO ] After 109ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:16:54] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 22:16:54] [INFO ] After 883ms 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 38 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 39 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 22:16:54] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:16:54] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:16:55] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-15 22:16:55] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:16:55] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:16:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:16:58] [INFO ] Implicit Places using invariants and state equation in 3490 ms returned []
Implicit Place search using SMT with State Equation took 4235 ms to find 0 implicit places.
[2023-03-15 22:16:58] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 22:16:58] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:16:58] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 22:16:59] [INFO ] Dead Transitions using invariants and state equation in 969 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 4 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 1 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.3 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 36 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
[2023-03-15 22:16:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 22:16:59] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:16:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 22:16:59] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:16:59] [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.
[2023-03-15 22:16:59] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:16:59] [INFO ] Flatten gal took : 16 ms
[2023-03-15 22:16:59] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:16:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5736397691573765571.gal : 4 ms
[2023-03-15 22:16:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1141016565631712561.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality5736397691573765571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1141016565631712561.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/ReachabilityCardinality1141016565631712561.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.012081,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.012636,3704,2,3,6,12,7,0,16,6,0
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 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 679600 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679600 steps, saw 90359 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:02] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:02] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:03] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 22:17:03] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:03] [INFO ] After 103ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:04] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-15 22:17:04] [INFO ] After 877ms 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.
Finished random walk after 7947 steps, including 2 resets, run visited all 1 properties in 25 ms. (steps per millisecond=317 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 349678 steps, run visited all 1 properties in 1471 ms. (steps per millisecond=237 )
Probabilistic random walk after 349678 steps, saw 48531 distinct states, run finished after 1471 ms. (steps per millisecond=237 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 2752 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=917 )
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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4238 steps, run visited all 1 properties in 22 ms. (steps per millisecond=192 )
Probabilistic random walk after 4238 steps, saw 2439 distinct states, run finished after 22 ms. (steps per millisecond=192 ) properties seen :1
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 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 221454 steps, run visited all 1 properties in 1117 ms. (steps per millisecond=198 )
Probabilistic random walk after 221454 steps, saw 32486 distinct states, run finished after 1118 ms. (steps per millisecond=198 ) properties seen :1
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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 725160 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725160 steps, saw 98019 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:09] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:10] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 22:17:10] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:10] [INFO ] After 135ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:11] [INFO ] Deduced a trap composed of 43 places in 329 ms of which 1 ms to minimize.
[2023-03-15 22:17:11] [INFO ] Deduced a trap composed of 46 places in 377 ms of which 1 ms to minimize.
[2023-03-15 22:17:12] [INFO ] Deduced a trap composed of 14 places in 357 ms of which 1 ms to minimize.
[2023-03-15 22:17:12] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 0 ms to minimize.
[2023-03-15 22:17:12] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 0 ms to minimize.
[2023-03-15 22:17:12] [INFO ] Deduced a trap composed of 46 places in 235 ms of which 2 ms to minimize.
[2023-03-15 22:17:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2122 ms
[2023-03-15 22:17:12] [INFO ] After 2289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-15 22:17:13] [INFO ] After 2911ms 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 21 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 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
Interrupted probabilistic random walk after 685320 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 685320 steps, saw 90842 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:16] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:16] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:16] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 22:17:16] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:16] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:16] [INFO ] After 106ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:17] [INFO ] Deduced a trap composed of 43 places in 314 ms of which 1 ms to minimize.
[2023-03-15 22:17:17] [INFO ] Deduced a trap composed of 46 places in 325 ms of which 0 ms to minimize.
[2023-03-15 22:17:17] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 1 ms to minimize.
[2023-03-15 22:17:18] [INFO ] Deduced a trap composed of 35 places in 344 ms of which 1 ms to minimize.
[2023-03-15 22:17:18] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 1 ms to minimize.
[2023-03-15 22:17:19] [INFO ] Deduced a trap composed of 46 places in 406 ms of which 1 ms to minimize.
[2023-03-15 22:17:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2378 ms
[2023-03-15 22:17:19] [INFO ] After 2527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-15 22:17:19] [INFO ] After 3029ms 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 31 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 31 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 22:17:19] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:19] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:17:20] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-03-15 22:17:20] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:20] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:17:20] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:22] [INFO ] Implicit Places using invariants and state equation in 2814 ms returned []
Implicit Place search using SMT with State Equation took 3646 ms to find 0 implicit places.
[2023-03-15 22:17:23] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-15 22:17:23] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:23] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:17:24] [INFO ] Dead Transitions using invariants and state equation in 1160 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 1 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.1 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 20 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
[2023-03-15 22:17:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 22:17:24] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 22:17:24] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:24] [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 2 ms.
[2023-03-15 22:17:24] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:24] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:17:24] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:17:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16507521995348873354.gal : 1 ms
[2023-03-15 22:17:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality626713727191260188.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality16507521995348873354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality626713727191260188.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/ReachabilityCardinality626713727191260188.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.002772,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.003364,3904,2,3,6,12,7,0,16,6,0
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 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642816 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642816 steps, saw 86989 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:27] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:27] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:27] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 22:17:28] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:28] [INFO ] After 142ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:28] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-15 22:17:28] [INFO ] After 875ms 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 28 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 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 681584 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 681584 steps, saw 90486 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:31] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:31] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:31] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 22:17:31] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:32] [INFO ] After 111ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:32] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-15 22:17:32] [INFO ] After 635ms 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 19 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 19 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 22:17:32] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:32] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:33] [INFO ] Implicit Places using invariants in 776 ms returned []
[2023-03-15 22:17:33] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:33] [INFO ] Computed 20 place invariants in 13 ms
[2023-03-15 22:17:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:36] [INFO ] Implicit Places using invariants and state equation in 2998 ms returned []
Implicit Place search using SMT with State Equation took 3776 ms to find 0 implicit places.
[2023-03-15 22:17:36] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-15 22:17:36] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:36] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:17:37] [INFO ] Dead Transitions using invariants and state equation in 1169 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 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 34 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
[2023-03-15 22:17:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 22:17:37] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 22:17:37] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:37] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 22:17:37] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:37] [INFO ] Flatten gal took : 2 ms
[2023-03-15 22:17:37] [INFO ] Flatten gal took : 2 ms
[2023-03-15 22:17:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15188889811762743633.gal : 1 ms
[2023-03-15 22:17:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15272818657194995106.prop : 3 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality15188889811762743633.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15272818657194995106.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...321
Loading property file /tmp/ReachabilityCardinality15272818657194995106.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.001591,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.001965,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 684064 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 684064 steps, saw 90735 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:40] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:40] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:40] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 22:17:40] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:40] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:41] [INFO ] After 112ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:41] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 22:17:41] [INFO ] After 709ms 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 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.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618440 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618440 steps, saw 83903 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:44] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:44] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:44] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 22:17:44] [INFO ] After 396ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:45] [INFO ] After 96ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:45] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 22:17:45] [INFO ] After 793ms 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 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.
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.
[2023-03-15 22:17:45] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:45] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:17:45] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-15 22:17:45] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:45] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:48] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3610 ms to find 0 implicit places.
[2023-03-15 22:17:48] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 22:17:48] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:48] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:49] [INFO ] Dead Transitions using invariants and state equation in 861 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 1 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 29 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
[2023-03-15 22:17:49] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 22:17:49] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:17:49] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:49] [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.
[2023-03-15 22:17:49] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:49] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:17:49] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:17:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2823888046976519415.gal : 1 ms
[2023-03-15 22:17:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9310920596246314793.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality2823888046976519415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9310920596246314793.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/ReachabilityCardinality9310920596246314793.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.001516,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.002746,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 4404 steps, run visited all 1 properties in 26 ms. (steps per millisecond=169 )
Probabilistic random walk after 4404 steps, saw 2543 distinct states, run finished after 27 ms. (steps per millisecond=163 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) 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 614400 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614400 steps, saw 83192 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:52] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:17:53] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 22:17:53] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:53] [INFO ] After 142ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:53] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 22:17:54] [INFO ] After 923ms 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 23 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 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 646024 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646024 steps, saw 87371 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:17:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:57] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:57] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:17:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 22:17:57] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:17:57] [INFO ] After 118ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:17:57] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-15 22:17:57] [INFO ] After 706ms 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 18 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 18 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-15 22:17:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:57] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:17:58] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-15 22:17:58] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:17:58] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:17:59] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:01] [INFO ] Implicit Places using invariants and state equation in 2831 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
[2023-03-15 22:18:01] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 22:18:01] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:01] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 22:18:02] [INFO ] Dead Transitions using invariants and state equation in 1191 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 28 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
[2023-03-15 22:18:02] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 22:18:02] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 22:18:02] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:02] [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.
[2023-03-15 22:18:02] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:18:02] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:18:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16352910151712395883.gal : 1 ms
[2023-03-15 22:18:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality929815437400710262.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality16352910151712395883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality929815437400710262.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/ReachabilityCardinality929815437400710262.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.001654,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.001935,3904,2,3,6,12,7,0,16,6,0
Finished random walk after 4953 steps, including 1 resets, run visited all 1 properties in 14 ms. (steps per millisecond=353 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 1976 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=658 )
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 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 616728 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 616728 steps, saw 83476 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:05] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:05] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:05] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 22:18:06] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:06] [INFO ] After 111ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:06] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 22:18:06] [INFO ] After 851ms 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 23 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 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 679024 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 679024 steps, saw 90297 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:09] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:09] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:10] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 22:18:10] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:10] [INFO ] After 68ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:10] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 22:18:10] [INFO ] After 538ms 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 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.
[2023-03-15 22:18:10] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:10] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:11] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-15 22:18:11] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:11] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:14] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 3498 ms to find 0 implicit places.
[2023-03-15 22:18:14] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 22:18:14] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:14] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:15] [INFO ] Dead Transitions using invariants and state equation in 1123 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.1 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 13 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
[2023-03-15 22:18:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 22:18:15] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 22:18:15] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:15] [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.
[2023-03-15 22:18:15] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:15] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:18:15] [INFO ] Flatten gal took : 0 ms
[2023-03-15 22:18:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16726410697826021252.gal : 0 ms
[2023-03-15 22:18:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10314975544601688745.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality16726410697826021252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10314975544601688745.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...321
Loading property file /tmp/ReachabilityCardinality10314975544601688745.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.001688,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.002085,3904,2,3,6,12,7,0,16,6,0
ITS tools runner thread asked to quit. Dying gracefully.
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
Interrupted probabilistic random walk after 680488 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 680488 steps, saw 90428 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:18] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:18] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:18] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 22:18:19] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:19] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:19] [INFO ] After 123ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:19] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-15 22:18:19] [INFO ] After 864ms 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 23 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 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 683456 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 683456 steps, saw 90705 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:22] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:22] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 22:18:22] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 22:18:22] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:22] [INFO ] After 76ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:23] [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 32 ms.
[2023-03-15 22:18:23] [INFO ] After 547ms 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.
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.
[2023-03-15 22:18:23] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:23] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:23] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-15 22:18:23] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:23] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:24] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:26] [INFO ] Implicit Places using invariants and state equation in 3006 ms returned []
Implicit Place search using SMT with State Equation took 3661 ms to find 0 implicit places.
[2023-03-15 22:18:26] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 22:18:26] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:26] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:27] [INFO ] Dead Transitions using invariants and state equation in 937 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 30 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
[2023-03-15 22:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-15 22:18:27] [INFO ] After 13ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:18:27] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:27] [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 2 ms.
[2023-03-15 22:18:27] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:27] [INFO ] Flatten gal took : 1 ms
[2023-03-15 22:18:27] [INFO ] Flatten gal took : 0 ms
[2023-03-15 22:18:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10164447276339262102.gal : 2 ms
[2023-03-15 22:18:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5462198802603903332.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality10164447276339262102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5462198802603903332.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/ReachabilityCardinality5462198802603903332.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.001669,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.001992,3900,2,3,6,12,7,0,16,6,0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 15062 steps, run visited all 1 properties in 105 ms. (steps per millisecond=143 )
Probabilistic random walk after 15062 steps, saw 7804 distinct states, run finished after 105 ms. (steps per millisecond=143 ) properties seen :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 644200 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 644200 steps, saw 87141 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:31] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:31] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:31] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 22:18:31] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:31] [INFO ] After 81ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:31] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 22:18:31] [INFO ] After 711ms 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 23 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.
Finished random walk after 3822 steps, including 1 resets, run visited all 1 properties in 20 ms. (steps per millisecond=191 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 589368 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589368 steps, saw 77346 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:34] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:35] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:35] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 22:18:35] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:35] [INFO ] After 104ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:35] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 22:18:35] [INFO ] After 732ms 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 22 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 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 681864 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 681864 steps, saw 90532 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:38] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:38] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:39] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-15 22:18:39] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:39] [INFO ] After 67ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:39] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 22:18:39] [INFO ] After 550ms 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 18 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.
[2023-03-15 22:18:39] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:39] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:40] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-15 22:18:40] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:40] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:40] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:42] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2764 ms to find 0 implicit places.
[2023-03-15 22:18:42] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 22:18:42] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:42] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 22:18:43] [INFO ] Dead Transitions using invariants and state equation in 990 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 20 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
[2023-03-15 22:18:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-15 22:18:43] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-15 22:18:43] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:43] [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.
[2023-03-15 22:18:43] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:43] [INFO ] Flatten gal took : 3 ms
[2023-03-15 22:18:43] [INFO ] Flatten gal took : 3 ms
[2023-03-15 22:18:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12084863631237306459.gal : 1 ms
[2023-03-15 22:18:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5547735315622888895.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4478335210993098269;'/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/ReachabilityCardinality12084863631237306459.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5547735315622888895.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/ReachabilityCardinality5547735315622888895.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.002521,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.002861,3904,2,3,6,12,7,0,16,6,0
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 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 598726 steps, run visited all 1 properties in 2687 ms. (steps per millisecond=222 )
Probabilistic random walk after 598726 steps, saw 80460 distinct states, run finished after 2688 ms. (steps per millisecond=222 ) properties seen :1
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 728568 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 728568 steps, saw 98829 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:18:49] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 22:18:49] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:18:49] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:18:49] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 22:18:49] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 22:18:50] [INFO ] After 118ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:18:50] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-15 22:18:50] [INFO ] After 893ms 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 21 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 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r288-smll-167863554400397"
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 '
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 ;