MCC'2023- Execution of r149-smll-167819435900298

About the Execution of LoLa+red for DoubleExponent-PT-010

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
483.203	1800000.00	2657683.00	2372.90	[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.r149-smll-167819435900298.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 lolaxred
Input is DoubleExponent-PT-010, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r149-smll-167819435900298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678373906086

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 14:58:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 14:58:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:58:29] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-09 14:58:29] [INFO ] Transformed 534 places.
[2023-03-09 14:58:29] [INFO ] Transformed 498 transitions.
[2023-03-09 14:58:29] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 334 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 16 ms.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 1113 ms. (steps per millisecond=8 ) properties (out of 523) seen :44
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 479) seen :0
Interrupted probabilistic random walk after 67249 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=1, 34=1, 35=1, 36=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 61=1, 62=1, 63=1, 150=1, 391=1, 437=1, 438=1, 439=1, 440=1, 441=1, 442=1, 443=1, 444=1, 445=1, 446=1, 447=1, 448=1, 449=1, 450=1, 451=1, 452=1, 453=1, 454=1, 455=1, 456=1, 457=1, 458=1, 459=1, 460=1, 461=1, 462=1, 463=1, 464=1, 465=1, 466=1, 467=1, 468=1, 469=1, 470=1, 471=1, 472=1, 473=1, 474=1, 475=1, 476=1, 477=1, 478=1}
Probabilistic random walk after 67249 steps, saw 33630 distinct states, run finished after 3007 ms. (steps per millisecond=22 ) properties seen :91
Running SMT prover for 388 properties.
// Phase 1: matrix 498 rows 534 cols
[2023-03-09 14:58:34] [INFO ] Computed 54 place invariants in 90 ms
[2023-03-09 14:58:44] [INFO ] After 9754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:388
[2023-03-09 14:58:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 21 ms returned sat
[2023-03-09 14:58:51] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 51 ms returned sat
[2023-03-09 14:59:09] [INFO ] After 11909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :387
[2023-03-09 14:59:09] [INFO ] After 11914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :387
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-09 14:59:09] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :387
Fused 388 Parikh solutions to 270 different solutions.
Parikh walk visited 0 properties in 30500 ms.
Support contains 388 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 534 transition count 468
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 504 transition count 468
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 60 place count 504 transition count 463
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 70 place count 499 transition count 463
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 21 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 130 place count 469 transition count 433
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 140 place count 464 transition count 433
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 464 transition count 427
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 152 place count 458 transition count 427
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 163 place count 458 transition count 427
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 457 transition count 426
Applied a total of 164 rules in 205 ms. Remains 457 /534 variables (removed 77) and now considering 426/498 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 457/534 places, 426/498 transitions.
Interrupted random walk after 500017 steps, including 64085 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 577 ms. (steps per millisecond=17 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 809 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 866 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 878 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 825 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 816 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 883 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 388) seen :0
Interrupted probabilistic random walk after 3970744 steps, run timeout after 150001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 32=1, 33=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 67=1, 68=1, 69=1}
Probabilistic random walk after 3970744 steps, saw 1985168 distinct states, run finished after 150002 ms. (steps per millisecond=26 ) properties seen :53
Running SMT prover for 335 properties.
// Phase 1: matrix 426 rows 457 cols
[2023-03-09 15:03:00] [INFO ] Computed 54 place invariants in 27 ms
[2023-03-09 15:03:07] [INFO ] After 6635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:03:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 15:03:12] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 67 ms returned sat
[2023-03-09 15:03:31] [INFO ] After 13404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 15:03:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 15:03:40] [INFO ] After 9081ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 15:03:40] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 10 ms to minimize.
[2023-03-09 15:03:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-09 15:03:40] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2023-03-09 15:03:41] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2023-03-09 15:03:41] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 2 ms to minimize.
[2023-03-09 15:03:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 821 ms
[2023-03-09 15:03:42] [INFO ] Deduced a trap composed of 144 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:03:42] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 1 ms to minimize.
[2023-03-09 15:03:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2023-03-09 15:03:42] [INFO ] Deduced a trap composed of 120 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:03:43] [INFO ] Deduced a trap composed of 157 places in 277 ms of which 2 ms to minimize.
[2023-03-09 15:03:43] [INFO ] Deduced a trap composed of 125 places in 213 ms of which 0 ms to minimize.
[2023-03-09 15:03:43] [INFO ] Deduced a trap composed of 178 places in 230 ms of which 0 ms to minimize.
[2023-03-09 15:03:44] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 1 ms to minimize.
[2023-03-09 15:03:44] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 1 ms to minimize.
[2023-03-09 15:03:44] [INFO ] Deduced a trap composed of 133 places in 211 ms of which 1 ms to minimize.
[2023-03-09 15:03:44] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 0 ms to minimize.
[2023-03-09 15:03:45] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:03:45] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 1 ms to minimize.
[2023-03-09 15:03:45] [INFO ] Deduced a trap composed of 159 places in 206 ms of which 0 ms to minimize.
[2023-03-09 15:03:45] [INFO ] Deduced a trap composed of 172 places in 219 ms of which 1 ms to minimize.
[2023-03-09 15:03:45] [INFO ] Deduced a trap composed of 182 places in 209 ms of which 1 ms to minimize.
[2023-03-09 15:03:46] [INFO ] Deduced a trap composed of 187 places in 218 ms of which 0 ms to minimize.
[2023-03-09 15:03:46] [INFO ] Deduced a trap composed of 145 places in 194 ms of which 0 ms to minimize.
[2023-03-09 15:03:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3783 ms
[2023-03-09 15:03:47] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 2 ms to minimize.
[2023-03-09 15:03:47] [INFO ] Deduced a trap composed of 47 places in 336 ms of which 1 ms to minimize.
[2023-03-09 15:03:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 684 ms
[2023-03-09 15:03:49] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:03:49] [INFO ] Deduced a trap composed of 55 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:03:50] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 1 ms to minimize.
[2023-03-09 15:03:50] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 1 ms to minimize.
[2023-03-09 15:03:50] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:03:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1217 ms
[2023-03-09 15:03:51] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:03:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-09 15:03:51] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2023-03-09 15:03:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-09 15:03:52] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 1 ms to minimize.
[2023-03-09 15:03:52] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2023-03-09 15:03:52] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:03:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1005 ms
[2023-03-09 15:03:53] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 2 ms to minimize.
[2023-03-09 15:03:53] [INFO ] Deduced a trap composed of 177 places in 209 ms of which 7 ms to minimize.
[2023-03-09 15:03:53] [INFO ] Deduced a trap composed of 122 places in 210 ms of which 1 ms to minimize.
[2023-03-09 15:03:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 772 ms
[2023-03-09 15:03:54] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 1 ms to minimize.
[2023-03-09 15:03:54] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2023-03-09 15:03:54] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 0 ms to minimize.
[2023-03-09 15:03:55] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2023-03-09 15:03:55] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 1 ms to minimize.
[2023-03-09 15:03:55] [INFO ] Deduced a trap composed of 129 places in 116 ms of which 1 ms to minimize.
[2023-03-09 15:03:55] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 0 ms to minimize.
[2023-03-09 15:03:55] [INFO ] Deduced a trap composed of 147 places in 128 ms of which 1 ms to minimize.
[2023-03-09 15:03:55] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 0 ms to minimize.
[2023-03-09 15:03:56] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 0 ms to minimize.
[2023-03-09 15:03:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1645 ms
[2023-03-09 15:03:56] [INFO ] Deduced a trap composed of 148 places in 217 ms of which 1 ms to minimize.
[2023-03-09 15:03:57] [INFO ] Deduced a trap composed of 140 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:03:57] [INFO ] Deduced a trap composed of 152 places in 199 ms of which 0 ms to minimize.
[2023-03-09 15:03:57] [INFO ] Deduced a trap composed of 210 places in 212 ms of which 1 ms to minimize.
[2023-03-09 15:03:57] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 3 ms to minimize.
[2023-03-09 15:03:58] [INFO ] Deduced a trap composed of 184 places in 218 ms of which 1 ms to minimize.
[2023-03-09 15:03:58] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 1 ms to minimize.
[2023-03-09 15:03:58] [INFO ] Deduced a trap composed of 156 places in 259 ms of which 1 ms to minimize.
[2023-03-09 15:03:59] [INFO ] Deduced a trap composed of 141 places in 362 ms of which 1 ms to minimize.
[2023-03-09 15:03:59] [INFO ] Deduced a trap composed of 176 places in 365 ms of which 1 ms to minimize.
[2023-03-09 15:04:00] [INFO ] Deduced a trap composed of 152 places in 339 ms of which 20 ms to minimize.
[2023-03-09 15:04:00] [INFO ] Deduced a trap composed of 176 places in 318 ms of which 1 ms to minimize.
[2023-03-09 15:04:00] [INFO ] Deduced a trap composed of 207 places in 214 ms of which 1 ms to minimize.
[2023-03-09 15:04:00] [INFO ] Deduced a trap composed of 183 places in 203 ms of which 0 ms to minimize.
[2023-03-09 15:04:01] [INFO ] Deduced a trap composed of 198 places in 195 ms of which 1 ms to minimize.
[2023-03-09 15:04:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4525 ms
[2023-03-09 15:04:03] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:04:03] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 0 ms to minimize.
[2023-03-09 15:04:03] [INFO ] Deduced a trap composed of 150 places in 177 ms of which 2 ms to minimize.
[2023-03-09 15:04:04] [INFO ] Deduced a trap composed of 174 places in 197 ms of which 3 ms to minimize.
[2023-03-09 15:04:04] [INFO ] Deduced a trap composed of 79 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:04:04] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 0 ms to minimize.
[2023-03-09 15:04:04] [INFO ] Deduced a trap composed of 198 places in 203 ms of which 3 ms to minimize.
[2023-03-09 15:04:04] [INFO ] Deduced a trap composed of 130 places in 200 ms of which 18 ms to minimize.
[2023-03-09 15:04:05] [INFO ] Deduced a trap composed of 124 places in 216 ms of which 2 ms to minimize.
[2023-03-09 15:04:05] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2184 ms
[2023-03-09 15:04:06] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 0 ms to minimize.
[2023-03-09 15:04:06] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 0 ms to minimize.
[2023-03-09 15:04:06] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 0 ms to minimize.
[2023-03-09 15:04:06] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 1 ms to minimize.
[2023-03-09 15:04:06] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 0 ms to minimize.
[2023-03-09 15:04:06] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 1 ms to minimize.
[2023-03-09 15:04:07] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 1 ms to minimize.
[2023-03-09 15:04:07] [INFO ] Deduced a trap composed of 124 places in 111 ms of which 0 ms to minimize.
[2023-03-09 15:04:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1203 ms
[2023-03-09 15:04:07] [INFO ] Deduced a trap composed of 122 places in 108 ms of which 0 ms to minimize.
[2023-03-09 15:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-09 15:04:09] [INFO ] Deduced a trap composed of 169 places in 174 ms of which 0 ms to minimize.
[2023-03-09 15:04:09] [INFO ] Deduced a trap composed of 174 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:04:09] [INFO ] Deduced a trap composed of 85 places in 204 ms of which 0 ms to minimize.
[2023-03-09 15:04:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 699 ms
[2023-03-09 15:04:11] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:04:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-09 15:04:11] [INFO ] Deduced a trap composed of 166 places in 174 ms of which 1 ms to minimize.
[2023-03-09 15:04:11] [INFO ] Deduced a trap composed of 142 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:04:12] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:04:12] [INFO ] Deduced a trap composed of 196 places in 207 ms of which 1 ms to minimize.
[2023-03-09 15:04:12] [INFO ] Deduced a trap composed of 114 places in 216 ms of which 1 ms to minimize.
[2023-03-09 15:04:12] [INFO ] Deduced a trap composed of 114 places in 203 ms of which 0 ms to minimize.
[2023-03-09 15:04:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1430 ms
[2023-03-09 15:04:13] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 0 ms to minimize.
[2023-03-09 15:04:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-09 15:04:15] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 0 ms to minimize.
[2023-03-09 15:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-09 15:04:16] [INFO ] Deduced a trap composed of 169 places in 195 ms of which 0 ms to minimize.
[2023-03-09 15:04:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-09 15:04:17] [INFO ] Deduced a trap composed of 186 places in 165 ms of which 1 ms to minimize.
[2023-03-09 15:04:17] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:04:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 645 ms
[2023-03-09 15:04:18] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 0 ms to minimize.
[2023-03-09 15:04:18] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 1 ms to minimize.
[2023-03-09 15:04:19] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 1 ms to minimize.
[2023-03-09 15:04:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2023-03-09 15:04:21] [INFO ] Deduced a trap composed of 177 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:04:21] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 1 ms to minimize.
[2023-03-09 15:04:21] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2023-03-09 15:04:21] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 1 ms to minimize.
[2023-03-09 15:04:22] [INFO ] Deduced a trap composed of 124 places in 209 ms of which 1 ms to minimize.
[2023-03-09 15:04:22] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:04:22] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:04:22] [INFO ] Deduced a trap composed of 100 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:04:22] [INFO ] Deduced a trap composed of 201 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:04:23] [INFO ] Deduced a trap composed of 182 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:04:23] [INFO ] Deduced a trap composed of 148 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:04:23] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-09 15:04:23] [INFO ] Deduced a trap composed of 96 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:04:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3434 ms
[2023-03-09 15:04:26] [INFO ] Deduced a trap composed of 102 places in 205 ms of which 1 ms to minimize.
[2023-03-09 15:04:26] [INFO ] Deduced a trap composed of 110 places in 229 ms of which 0 ms to minimize.
[2023-03-09 15:04:27] [INFO ] Deduced a trap composed of 185 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:04:27] [INFO ] Deduced a trap composed of 148 places in 192 ms of which 1 ms to minimize.
[2023-03-09 15:04:27] [INFO ] Deduced a trap composed of 184 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:04:27] [INFO ] Deduced a trap composed of 123 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:04:27] [INFO ] Deduced a trap composed of 111 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:04:28] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 1 ms to minimize.
[2023-03-09 15:04:28] [INFO ] Deduced a trap composed of 116 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:04:28] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 0 ms to minimize.
[2023-03-09 15:04:28] [INFO ] Deduced a trap composed of 191 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:04:29] [INFO ] Deduced a trap composed of 185 places in 206 ms of which 0 ms to minimize.
[2023-03-09 15:04:29] [INFO ] Deduced a trap composed of 200 places in 198 ms of which 1 ms to minimize.
[2023-03-09 15:04:29] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3000 ms
[2023-03-09 15:04:29] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-09 15:04:29] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2023-03-09 15:04:29] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2023-03-09 15:04:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 545 ms
[2023-03-09 15:04:30] [INFO ] After 59477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 13631 ms.
[2023-03-09 15:04:44] [INFO ] After 96459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 311 different solutions.
Parikh walk visited 0 properties in 30021 ms.
Support contains 335 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 426/426 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 457 transition count 414
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 445 transition count 414
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24 place count 445 transition count 412
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 443 transition count 412
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 46 place count 434 transition count 403
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 432 transition count 403
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 432 transition count 399
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 428 transition count 399
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 63 place count 428 transition count 399
Applied a total of 63 rules in 105 ms. Remains 428 /457 variables (removed 29) and now considering 399/426 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 428/457 places, 399/426 transitions.
Interrupted random walk after 543331 steps, including 69607 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 451 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 830 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 809 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 873 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 805 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 876 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 3861244 steps, run timeout after 147001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 3861244 steps, saw 1930452 distinct states, run finished after 147004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 399 rows 428 cols
[2023-03-09 15:08:30] [INFO ] Computed 54 place invariants in 32 ms
[2023-03-09 15:08:34] [INFO ] After 4203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:08:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-09 15:08:37] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-09 15:08:48] [INFO ] After 7695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 15:08:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:08:56] [INFO ] After 7845ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 15:08:58] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-09 15:08:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-09 15:08:59] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 0 ms to minimize.
[2023-03-09 15:08:59] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 0 ms to minimize.
[2023-03-09 15:08:59] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2023-03-09 15:08:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 590 ms
[2023-03-09 15:09:00] [INFO ] Deduced a trap composed of 151 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:09:00] [INFO ] Deduced a trap composed of 153 places in 205 ms of which 1 ms to minimize.
[2023-03-09 15:09:00] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 0 ms to minimize.
[2023-03-09 15:09:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 752 ms
[2023-03-09 15:09:01] [INFO ] Deduced a trap composed of 157 places in 207 ms of which 0 ms to minimize.
[2023-03-09 15:09:01] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 0 ms to minimize.
[2023-03-09 15:09:01] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 0 ms to minimize.
[2023-03-09 15:09:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 770 ms
[2023-03-09 15:09:01] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 0 ms to minimize.
[2023-03-09 15:09:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-09 15:09:02] [INFO ] Deduced a trap composed of 157 places in 206 ms of which 4 ms to minimize.
[2023-03-09 15:09:02] [INFO ] Deduced a trap composed of 161 places in 212 ms of which 1 ms to minimize.
[2023-03-09 15:09:02] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-09 15:09:02] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 0 ms to minimize.
[2023-03-09 15:09:03] [INFO ] Deduced a trap composed of 172 places in 215 ms of which 4 ms to minimize.
[2023-03-09 15:09:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1281 ms
[2023-03-09 15:09:03] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:09:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-09 15:09:04] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 0 ms to minimize.
[2023-03-09 15:09:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-03-09 15:09:04] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 0 ms to minimize.
[2023-03-09 15:09:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-09 15:09:05] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2023-03-09 15:09:05] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 1 ms to minimize.
[2023-03-09 15:09:06] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 1 ms to minimize.
[2023-03-09 15:09:06] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:09:06] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:09:06] [INFO ] Deduced a trap composed of 184 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:09:07] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 1 ms to minimize.
[2023-03-09 15:09:07] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:09:07] [INFO ] Deduced a trap composed of 149 places in 190 ms of which 1 ms to minimize.
[2023-03-09 15:09:07] [INFO ] Deduced a trap composed of 168 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:09:08] [INFO ] Deduced a trap composed of 162 places in 241 ms of which 1 ms to minimize.
[2023-03-09 15:09:08] [INFO ] Deduced a trap composed of 152 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:09:08] [INFO ] Deduced a trap composed of 173 places in 185 ms of which 0 ms to minimize.
[2023-03-09 15:09:08] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 0 ms to minimize.
[2023-03-09 15:09:08] [INFO ] Deduced a trap composed of 173 places in 169 ms of which 0 ms to minimize.
[2023-03-09 15:09:09] [INFO ] Deduced a trap composed of 173 places in 212 ms of which 0 ms to minimize.
[2023-03-09 15:09:09] [INFO ] Deduced a trap composed of 140 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:09:09] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 0 ms to minimize.
[2023-03-09 15:09:09] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 0 ms to minimize.
[2023-03-09 15:09:11] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 1 ms to minimize.
[2023-03-09 15:09:12] [INFO ] Deduced a trap composed of 155 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:09:13] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 0 ms to minimize.
[2023-03-09 15:09:13] [INFO ] Deduced a trap composed of 159 places in 195 ms of which 1 ms to minimize.
[2023-03-09 15:09:13] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:09:13] [INFO ] Deduced a trap composed of 180 places in 192 ms of which 0 ms to minimize.
[2023-03-09 15:09:14] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:09:14] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 0 ms to minimize.
[2023-03-09 15:09:14] [INFO ] Deduced a trap composed of 182 places in 185 ms of which 1 ms to minimize.
[2023-03-09 15:09:14] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:09:15] [INFO ] Deduced a trap composed of 159 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:09:15] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:09:15] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:09:15] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:09:15] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:09:16] [INFO ] Deduced a trap composed of 121 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:09:16] [INFO ] Deduced a trap composed of 169 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:09:16] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 1 ms to minimize.
[2023-03-09 15:09:16] [INFO ] Deduced a trap composed of 185 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:09:16] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:09:17] [INFO ] Deduced a trap composed of 172 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:09:17] [INFO ] Deduced a trap composed of 159 places in 196 ms of which 0 ms to minimize.
[2023-03-09 15:09:17] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:09:17] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:09:18] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 1 ms to minimize.
[2023-03-09 15:09:18] [INFO ] Deduced a trap composed of 180 places in 162 ms of which 0 ms to minimize.
[2023-03-09 15:09:18] [INFO ] Deduced a trap composed of 184 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:09:19] [INFO ] Deduced a trap composed of 159 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:09:19] [INFO ] Deduced a trap composed of 187 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:09:19] [INFO ] Deduced a trap composed of 157 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:09:19] [INFO ] Deduced a trap composed of 188 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:09:20] [INFO ] Deduced a trap composed of 187 places in 219 ms of which 1 ms to minimize.
[2023-03-09 15:09:20] [INFO ] Deduced a trap composed of 142 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:09:20] [INFO ] Deduced a trap composed of 182 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:09:20] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:09:21] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 1 ms to minimize.
[2023-03-09 15:09:21] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-09 15:09:21] [INFO ] Deduced a trap composed of 179 places in 240 ms of which 1 ms to minimize.
[2023-03-09 15:09:21] [INFO ] Deduced a trap composed of 154 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:09:22] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 1 ms to minimize.
[2023-03-09 15:09:22] [INFO ] Deduced a trap composed of 181 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:09:22] [INFO ] Deduced a trap composed of 169 places in 182 ms of which 0 ms to minimize.
[2023-03-09 15:09:22] [INFO ] Deduced a trap composed of 171 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:09:22] [INFO ] Deduced a trap composed of 143 places in 195 ms of which 0 ms to minimize.
[2023-03-09 15:09:23] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:09:23] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 0 ms to minimize.
[2023-03-09 15:09:23] [INFO ] Deduced a trap composed of 176 places in 177 ms of which 0 ms to minimize.
[2023-03-09 15:09:23] [INFO ] Deduced a trap composed of 143 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:09:24] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 0 ms to minimize.
[2023-03-09 15:09:24] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2023-03-09 15:09:24] [INFO ] Deduced a trap composed of 150 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:09:24] [INFO ] Deduced a trap composed of 173 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:09:24] [INFO ] Deduced a trap composed of 176 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:09:25] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:09:25] [INFO ] Deduced a trap composed of 180 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:09:25] [INFO ] Deduced a trap composed of 172 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:09:25] [INFO ] Deduced a trap composed of 195 places in 179 ms of which 0 ms to minimize.
[2023-03-09 15:09:25] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 0 ms to minimize.
[2023-03-09 15:09:26] [INFO ] Deduced a trap composed of 177 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:09:26] [INFO ] Deduced a trap composed of 184 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:09:26] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:09:26] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:09:26] [INFO ] Deduced a trap composed of 167 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:09:27] [INFO ] Deduced a trap composed of 176 places in 261 ms of which 1 ms to minimize.
[2023-03-09 15:09:27] [INFO ] Deduced a trap composed of 175 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:09:27] [INFO ] Deduced a trap composed of 182 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:09:27] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 2 ms to minimize.
[2023-03-09 15:09:28] [INFO ] Deduced a trap composed of 178 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:09:28] [INFO ] Deduced a trap composed of 170 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:09:28] [INFO ] Deduced a trap composed of 180 places in 171 ms of which 1 ms to minimize.
[2023-03-09 15:09:28] [INFO ] Deduced a trap composed of 177 places in 157 ms of which 0 ms to minimize.
[2023-03-09 15:09:29] [INFO ] Deduced a trap composed of 182 places in 213 ms of which 1 ms to minimize.
[2023-03-09 15:09:29] [INFO ] Deduced a trap composed of 152 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:09:29] [INFO ] Deduced a trap composed of 187 places in 200 ms of which 1 ms to minimize.
[2023-03-09 15:09:29] [INFO ] Deduced a trap composed of 191 places in 174 ms of which 0 ms to minimize.
[2023-03-09 15:09:30] [INFO ] Deduced a trap composed of 180 places in 201 ms of which 0 ms to minimize.
[2023-03-09 15:09:30] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 1 ms to minimize.
[2023-03-09 15:09:30] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 1 ms to minimize.
[2023-03-09 15:09:30] [INFO ] Deduced a trap composed of 205 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:09:31] [INFO ] Deduced a trap composed of 194 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:09:31] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:09:31] [INFO ] Deduced a trap composed of 199 places in 168 ms of which 0 ms to minimize.
[2023-03-09 15:09:31] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 1 ms to minimize.
[2023-03-09 15:09:31] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 3 ms to minimize.
[2023-03-09 15:09:32] [INFO ] Deduced a trap composed of 197 places in 167 ms of which 0 ms to minimize.
[2023-03-09 15:09:32] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:09:32] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:09:32] [INFO ] Deduced a trap composed of 180 places in 197 ms of which 2 ms to minimize.
[2023-03-09 15:09:33] [INFO ] Deduced a trap composed of 181 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:09:33] [INFO ] Deduced a trap composed of 130 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:09:33] [INFO ] Deduced a trap composed of 154 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:09:33] [INFO ] Deduced a trap composed of 185 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:09:34] [INFO ] Deduced a trap composed of 143 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:09:34] [INFO ] Deduced a trap composed of 194 places in 224 ms of which 0 ms to minimize.
[2023-03-09 15:09:34] [INFO ] Deduced a trap composed of 146 places in 185 ms of which 1 ms to minimize.
[2023-03-09 15:09:34] [INFO ] Deduced a trap composed of 190 places in 185 ms of which 0 ms to minimize.
[2023-03-09 15:09:34] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:09:35] [INFO ] Deduced a trap composed of 187 places in 191 ms of which 0 ms to minimize.
[2023-03-09 15:09:35] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 1 ms to minimize.
[2023-03-09 15:09:35] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:09:35] [INFO ] Deduced a trap composed of 211 places in 167 ms of which 0 ms to minimize.
[2023-03-09 15:09:35] [INFO ] Deduced a trap composed of 191 places in 158 ms of which 1 ms to minimize.
[2023-03-09 15:09:36] [INFO ] Deduced a trap composed of 195 places in 194 ms of which 0 ms to minimize.
[2023-03-09 15:09:36] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:09:36] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:09:37] [INFO ] Deduced a trap composed of 172 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:09:37] [INFO ] Deduced a trap composed of 155 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:09:37] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:09:37] [INFO ] Deduced a trap composed of 155 places in 174 ms of which 1 ms to minimize.
[2023-03-09 15:09:37] [INFO ] Deduced a trap composed of 192 places in 192 ms of which 1 ms to minimize.
[2023-03-09 15:09:38] [INFO ] Deduced a trap composed of 167 places in 198 ms of which 1 ms to minimize.
[2023-03-09 15:09:38] [INFO ] Deduced a trap composed of 188 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:09:38] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:09:38] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:09:39] [INFO ] Deduced a trap composed of 192 places in 244 ms of which 1 ms to minimize.
[2023-03-09 15:09:39] [INFO ] Deduced a trap composed of 170 places in 258 ms of which 1 ms to minimize.
[2023-03-09 15:09:39] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 0 ms to minimize.
[2023-03-09 15:09:40] [INFO ] Deduced a trap composed of 142 places in 163 ms of which 1 ms to minimize.
[2023-03-09 15:09:40] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:09:40] [INFO ] Deduced a trap composed of 159 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:09:40] [INFO ] Deduced a trap composed of 169 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:09:41] [INFO ] Deduced a trap composed of 180 places in 159 ms of which 0 ms to minimize.
[2023-03-09 15:09:41] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 0 ms to minimize.
[2023-03-09 15:09:41] [INFO ] Deduced a trap composed of 217 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:09:41] [INFO ] Deduced a trap composed of 192 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:09:42] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 0 ms to minimize.
[2023-03-09 15:09:42] [INFO ] Deduced a trap composed of 148 places in 166 ms of which 0 ms to minimize.
[2023-03-09 15:09:42] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 0 ms to minimize.
[2023-03-09 15:09:42] [INFO ] Deduced a trap composed of 157 places in 161 ms of which 0 ms to minimize.
[2023-03-09 15:09:42] [INFO ] Deduced a trap composed of 150 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:09:43] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 1 ms to minimize.
[2023-03-09 15:09:43] [INFO ] Deduced a trap composed of 143 places in 166 ms of which 0 ms to minimize.
[2023-03-09 15:09:43] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:09:43] [INFO ] Deduced a trap composed of 140 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:09:43] [INFO ] Deduced a trap composed of 173 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:09:44] [INFO ] Deduced a trap composed of 176 places in 172 ms of which 0 ms to minimize.
[2023-03-09 15:09:44] [INFO ] Deduced a trap composed of 184 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:09:44] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:09:44] [INFO ] Deduced a trap composed of 178 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:09:45] [INFO ] Deduced a trap composed of 157 places in 194 ms of which 1 ms to minimize.
[2023-03-09 15:09:45] [INFO ] Deduced a trap composed of 177 places in 197 ms of which 0 ms to minimize.
[2023-03-09 15:09:45] [INFO ] Deduced a trap composed of 155 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:09:45] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 1 ms to minimize.
[2023-03-09 15:09:46] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 1 ms to minimize.
[2023-03-09 15:09:46] [INFO ] Deduced a trap composed of 155 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:09:46] [INFO ] Deduced a trap composed of 173 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:09:46] [INFO ] Deduced a trap composed of 167 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:09:46] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:09:47] [INFO ] Deduced a trap composed of 180 places in 260 ms of which 1 ms to minimize.
[2023-03-09 15:09:47] [INFO ] Deduced a trap composed of 176 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:09:47] [INFO ] Deduced a trap composed of 142 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:09:48] [INFO ] Deduced a trap composed of 156 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:09:48] [INFO ] Deduced a trap composed of 168 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:09:48] [INFO ] Deduced a trap composed of 169 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:09:49] [INFO ] Deduced a trap composed of 158 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:09:49] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 1 ms to minimize.
[2023-03-09 15:09:49] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 0 ms to minimize.
[2023-03-09 15:09:49] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:09:50] [INFO ] Deduced a trap composed of 193 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:09:50] [INFO ] Deduced a trap composed of 208 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:09:50] [INFO ] Deduced a trap composed of 186 places in 176 ms of which 1 ms to minimize.
[2023-03-09 15:09:50] [INFO ] Deduced a trap composed of 178 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:09:51] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 0 ms to minimize.
[2023-03-09 15:09:51] [INFO ] Deduced a trap composed of 183 places in 177 ms of which 0 ms to minimize.
[2023-03-09 15:09:51] [INFO ] Deduced a trap composed of 169 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:09:51] [INFO ] Deduced a trap composed of 151 places in 163 ms of which 0 ms to minimize.
[2023-03-09 15:09:52] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 1 ms to minimize.
[2023-03-09 15:09:52] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 0 ms to minimize.
[2023-03-09 15:09:52] [INFO ] Deduced a trap composed of 196 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:09:52] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:09:52] [INFO ] Deduced a trap composed of 193 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:09:53] [INFO ] Deduced a trap composed of 178 places in 221 ms of which 0 ms to minimize.
[2023-03-09 15:09:53] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 1 ms to minimize.
[2023-03-09 15:09:53] [INFO ] Deduced a trap composed of 64 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:09:53] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 1 ms to minimize.
[2023-03-09 15:09:54] [INFO ] Deduced a trap composed of 81 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:09:54] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 1 ms to minimize.
[2023-03-09 15:09:54] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:09:55] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 1 ms to minimize.
[2023-03-09 15:09:55] [INFO ] Deduced a trap composed of 150 places in 274 ms of which 1 ms to minimize.
[2023-03-09 15:09:55] [INFO ] Deduced a trap composed of 176 places in 206 ms of which 0 ms to minimize.
[2023-03-09 15:09:55] [INFO ] Deduced a trap composed of 148 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:09:56] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 0 ms to minimize.
[2023-03-09 15:09:56] [INFO ] Deduced a trap composed of 147 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:09:56] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:09:56] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-09 15:09:57] [INFO ] Deduced a trap composed of 184 places in 163 ms of which 1 ms to minimize.
[2023-03-09 15:09:57] [INFO ] Deduced a trap composed of 174 places in 197 ms of which 0 ms to minimize.
[2023-03-09 15:09:57] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:09:57] [INFO ] Deduced a trap composed of 159 places in 185 ms of which 1 ms to minimize.
[2023-03-09 15:09:58] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:09:58] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 0 ms to minimize.
[2023-03-09 15:09:58] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:09:58] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:09:58] [INFO ] Deduced a trap composed of 169 places in 186 ms of which 0 ms to minimize.
[2023-03-09 15:09:59] [INFO ] Deduced a trap composed of 69 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:09:59] [INFO ] Deduced a trap composed of 142 places in 247 ms of which 0 ms to minimize.
[2023-03-09 15:09:59] [INFO ] Deduced a trap composed of 167 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:09:59] [INFO ] Deduced a trap composed of 181 places in 184 ms of which 0 ms to minimize.
[2023-03-09 15:10:00] [INFO ] Deduced a trap composed of 184 places in 194 ms of which 0 ms to minimize.
[2023-03-09 15:10:00] [INFO ] Deduced a trap composed of 179 places in 202 ms of which 1 ms to minimize.
[2023-03-09 15:10:00] [INFO ] Deduced a trap composed of 174 places in 185 ms of which 0 ms to minimize.
[2023-03-09 15:10:00] [INFO ] Deduced a trap composed of 168 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:10:01] [INFO ] Deduced a trap composed of 184 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:10:01] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:10:01] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 1 ms to minimize.
[2023-03-09 15:10:01] [INFO ] Deduced a trap composed of 191 places in 202 ms of which 0 ms to minimize.
[2023-03-09 15:10:01] [INFO ] Deduced a trap composed of 191 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:10:02] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:10:02] [INFO ] Deduced a trap composed of 193 places in 205 ms of which 0 ms to minimize.
[2023-03-09 15:10:02] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:10:02] [INFO ] Deduced a trap composed of 187 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:10:03] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 1 ms to minimize.
[2023-03-09 15:10:03] [INFO ] Deduced a trap composed of 202 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:10:03] [INFO ] Deduced a trap composed of 175 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:10:04] [INFO ] Deduced a trap composed of 175 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:10:04] [INFO ] Deduced a trap composed of 163 places in 245 ms of which 0 ms to minimize.
[2023-03-09 15:10:04] [INFO ] Deduced a trap composed of 173 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:10:05] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 1 ms to minimize.
[2023-03-09 15:10:05] [INFO ] Deduced a trap composed of 183 places in 197 ms of which 1 ms to minimize.
[2023-03-09 15:10:05] [INFO ] Deduced a trap composed of 194 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:10:05] [INFO ] Deduced a trap composed of 194 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:10:05] [INFO ] Deduced a trap composed of 189 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:10:06] [INFO ] Deduced a trap composed of 180 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:10:06] [INFO ] Deduced a trap composed of 186 places in 182 ms of which 0 ms to minimize.
[2023-03-09 15:10:06] [INFO ] Deduced a trap composed of 180 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:10:06] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:10:07] [INFO ] Deduced a trap composed of 182 places in 197 ms of which 1 ms to minimize.
[2023-03-09 15:10:07] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:10:07] [INFO ] Deduced a trap composed of 181 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:10:07] [INFO ] Deduced a trap composed of 176 places in 199 ms of which 1 ms to minimize.
[2023-03-09 15:10:08] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-09 15:10:08] [INFO ] Deduced a trap composed of 192 places in 205 ms of which 0 ms to minimize.
[2023-03-09 15:10:08] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:10:08] [INFO ] Deduced a trap composed of 172 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:10:08] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 0 ms to minimize.
[2023-03-09 15:10:09] [INFO ] Deduced a trap composed of 141 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:10:09] [INFO ] Deduced a trap composed of 175 places in 232 ms of which 1 ms to minimize.
[2023-03-09 15:10:09] [INFO ] Deduced a trap composed of 183 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:10:10] [INFO ] Deduced a trap composed of 181 places in 191 ms of which 0 ms to minimize.
[2023-03-09 15:10:10] [INFO ] Deduced a trap composed of 161 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:10:10] [INFO ] Deduced a trap composed of 174 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:10:11] [INFO ] Deduced a trap composed of 174 places in 201 ms of which 1 ms to minimize.
[2023-03-09 15:10:11] [INFO ] Deduced a trap composed of 173 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:10:11] [INFO ] Deduced a trap composed of 186 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:10:11] [INFO ] Deduced a trap composed of 179 places in 195 ms of which 0 ms to minimize.
[2023-03-09 15:10:12] [INFO ] Deduced a trap composed of 180 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:10:12] [INFO ] Deduced a trap composed of 184 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:10:12] [INFO ] Deduced a trap composed of 199 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:10:12] [INFO ] Deduced a trap composed of 195 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:10:13] [INFO ] Deduced a trap composed of 189 places in 229 ms of which 1 ms to minimize.
[2023-03-09 15:10:13] [INFO ] Deduced a trap composed of 174 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:10:13] [INFO ] Deduced a trap composed of 180 places in 195 ms of which 1 ms to minimize.
[2023-03-09 15:10:13] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 1 ms to minimize.
[2023-03-09 15:10:15] [INFO ] Deduced a trap composed of 99 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:10:16] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 1 ms to minimize.
[2023-03-09 15:10:16] [INFO ] Deduced a trap composed of 180 places in 254 ms of which 1 ms to minimize.
[2023-03-09 15:10:16] [INFO ] Deduced a trap composed of 196 places in 190 ms of which 1 ms to minimize.
[2023-03-09 15:10:16] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:10:17] [INFO ] Deduced a trap composed of 212 places in 267 ms of which 1 ms to minimize.
[2023-03-09 15:10:17] [INFO ] Deduced a trap composed of 188 places in 243 ms of which 0 ms to minimize.
[2023-03-09 15:10:18] [INFO ] Deduced a trap composed of 174 places in 165 ms of which 1 ms to minimize.
[2023-03-09 15:10:18] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:10:19] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 1 ms to minimize.
[2023-03-09 15:10:19] [INFO ] Deduced a trap composed of 174 places in 270 ms of which 0 ms to minimize.
[2023-03-09 15:10:19] [INFO ] Deduced a trap composed of 160 places in 247 ms of which 1 ms to minimize.
[2023-03-09 15:10:20] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 1 ms to minimize.
[2023-03-09 15:10:20] [INFO ] Deduced a trap composed of 187 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:10:20] [INFO ] Deduced a trap composed of 175 places in 196 ms of which 0 ms to minimize.
[2023-03-09 15:10:21] [INFO ] Deduced a trap composed of 171 places in 309 ms of which 1 ms to minimize.
[2023-03-09 15:10:21] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-09 15:10:21] [INFO ] Deduced a trap composed of 187 places in 208 ms of which 0 ms to minimize.
[2023-03-09 15:10:22] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 2 ms to minimize.
[2023-03-09 15:10:22] [INFO ] Deduced a trap composed of 173 places in 163 ms of which 1 ms to minimize.
[2023-03-09 15:10:22] [INFO ] Deduced a trap composed of 177 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:10:22] [INFO ] Deduced a trap composed of 182 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:10:23] [INFO ] Deduced a trap composed of 145 places in 283 ms of which 1 ms to minimize.
[2023-03-09 15:10:23] [INFO ] Deduced a trap composed of 193 places in 226 ms of which 0 ms to minimize.
[2023-03-09 15:10:23] [INFO ] Deduced a trap composed of 195 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:10:24] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 1 ms to minimize.
[2023-03-09 15:10:24] [INFO ] Deduced a trap composed of 174 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:10:24] [INFO ] Deduced a trap composed of 183 places in 186 ms of which 0 ms to minimize.
[2023-03-09 15:10:24] [INFO ] Deduced a trap composed of 177 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:10:24] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:10:25] [INFO ] Deduced a trap composed of 179 places in 172 ms of which 0 ms to minimize.
[2023-03-09 15:10:25] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 0 ms to minimize.
[2023-03-09 15:10:25] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:10:25] [INFO ] Deduced a trap composed of 175 places in 194 ms of which 1 ms to minimize.
[2023-03-09 15:10:26] [INFO ] Deduced a trap composed of 185 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:10:26] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 6 ms to minimize.
[2023-03-09 15:10:26] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 0 ms to minimize.
[2023-03-09 15:10:26] [INFO ] Deduced a trap composed of 183 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:10:26] [INFO ] Deduced a trap composed of 183 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:10:27] [INFO ] Deduced a trap composed of 193 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:10:27] [INFO ] Deduced a trap composed of 180 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:10:27] [INFO ] Deduced a trap composed of 112 places in 184 ms of which 0 ms to minimize.
[2023-03-09 15:10:27] [INFO ] Deduced a trap composed of 175 places in 176 ms of which 1 ms to minimize.
[2023-03-09 15:10:28] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:10:28] [INFO ] Deduced a trap composed of 149 places in 186 ms of which 0 ms to minimize.
[2023-03-09 15:10:28] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 0 ms to minimize.
[2023-03-09 15:10:28] [INFO ] Deduced a trap composed of 83 places in 194 ms of which 0 ms to minimize.
[2023-03-09 15:10:29] [INFO ] Deduced a trap composed of 169 places in 252 ms of which 0 ms to minimize.
[2023-03-09 15:10:29] [INFO ] Deduced a trap composed of 176 places in 228 ms of which 0 ms to minimize.
[2023-03-09 15:10:29] [INFO ] Deduced a trap composed of 190 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:10:29] [INFO ] Deduced a trap composed of 186 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:10:30] [INFO ] Deduced a trap composed of 177 places in 186 ms of which 0 ms to minimize.
[2023-03-09 15:10:30] [INFO ] Deduced a trap composed of 184 places in 206 ms of which 1 ms to minimize.
[2023-03-09 15:10:30] [INFO ] Deduced a trap composed of 169 places in 176 ms of which 0 ms to minimize.
[2023-03-09 15:10:30] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:10:31] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 0 ms to minimize.
[2023-03-09 15:10:31] [INFO ] Deduced a trap composed of 190 places in 160 ms of which 1 ms to minimize.
[2023-03-09 15:10:31] [INFO ] Deduced a trap composed of 175 places in 172 ms of which 1 ms to minimize.
[2023-03-09 15:10:31] [INFO ] Deduced a trap composed of 182 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:10:32] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:10:32] [INFO ] Deduced a trap composed of 180 places in 148 ms of which 0 ms to minimize.
[2023-03-09 15:10:32] [INFO ] Deduced a trap composed of 167 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:10:32] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:10:32] [INFO ] Deduced a trap composed of 187 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:10:33] [INFO ] Deduced a trap composed of 199 places in 172 ms of which 0 ms to minimize.
[2023-03-09 15:10:33] [INFO ] Deduced a trap composed of 191 places in 182 ms of which 0 ms to minimize.
[2023-03-09 15:10:33] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:10:33] [INFO ] Deduced a trap composed of 148 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:10:34] [INFO ] Deduced a trap composed of 147 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:10:34] [INFO ] Deduced a trap composed of 181 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:10:34] [INFO ] Deduced a trap composed of 177 places in 161 ms of which 0 ms to minimize.
[2023-03-09 15:10:34] [INFO ] Deduced a trap composed of 183 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:10:35] [INFO ] Deduced a trap composed of 179 places in 172 ms of which 0 ms to minimize.
[2023-03-09 15:10:35] [INFO ] Deduced a trap composed of 177 places in 170 ms of which 0 ms to minimize.
[2023-03-09 15:10:35] [INFO ] Deduced a trap composed of 190 places in 238 ms of which 1 ms to minimize.
[2023-03-09 15:10:35] [INFO ] Deduced a trap composed of 186 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:10:36] [INFO ] Deduced a trap composed of 191 places in 307 ms of which 1 ms to minimize.
[2023-03-09 15:10:36] [INFO ] Deduced a trap composed of 179 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:10:37] [INFO ] Deduced a trap composed of 195 places in 288 ms of which 1 ms to minimize.
[2023-03-09 15:10:37] [INFO ] Deduced a trap composed of 170 places in 288 ms of which 1 ms to minimize.
[2023-03-09 15:10:37] [INFO ] Deduced a trap composed of 173 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:10:38] [INFO ] Deduced a trap composed of 181 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:10:38] [INFO ] Deduced a trap composed of 185 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:10:38] [INFO ] Deduced a trap composed of 170 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:10:39] [INFO ] Deduced a trap composed of 179 places in 317 ms of which 1 ms to minimize.
[2023-03-09 15:10:39] [INFO ] Deduced a trap composed of 170 places in 320 ms of which 1 ms to minimize.
[2023-03-09 15:10:39] [INFO ] Deduced a trap composed of 166 places in 326 ms of which 1 ms to minimize.
[2023-03-09 15:10:40] [INFO ] Deduced a trap composed of 180 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:10:40] [INFO ] Deduced a trap composed of 165 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:10:40] [INFO ] Deduced a trap composed of 178 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:10:41] [INFO ] Deduced a trap composed of 172 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:10:41] [INFO ] Deduced a trap composed of 180 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:10:42] [INFO ] Deduced a trap composed of 190 places in 290 ms of which 2 ms to minimize.
[2023-03-09 15:10:42] [INFO ] Deduced a trap composed of 164 places in 301 ms of which 2 ms to minimize.
[2023-03-09 15:10:42] [INFO ] Deduced a trap composed of 156 places in 309 ms of which 1 ms to minimize.
[2023-03-09 15:10:43] [INFO ] Deduced a trap composed of 180 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:10:43] [INFO ] Deduced a trap composed of 155 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:10:43] [INFO ] Deduced a trap composed of 193 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:10:44] [INFO ] Deduced a trap composed of 189 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:10:44] [INFO ] Deduced a trap composed of 197 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:10:44] [INFO ] Deduced a trap composed of 183 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:10:45] [INFO ] Deduced a trap composed of 185 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:10:45] [INFO ] Deduced a trap composed of 194 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:10:46] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 0 ms to minimize.
[2023-03-09 15:10:47] [INFO ] Deduced a trap composed of 121 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:10:47] [INFO ] Deduced a trap composed of 177 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:10:47] [INFO ] Deduced a trap composed of 164 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:10:48] [INFO ] Deduced a trap composed of 179 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:10:49] [INFO ] Deduced a trap composed of 156 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:10:49] [INFO ] Deduced a trap composed of 148 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:10:49] [INFO ] Deduced a trap composed of 150 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:10:50] [INFO ] Deduced a trap composed of 154 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:10:50] [INFO ] Deduced a trap composed of 198 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:10:51] [INFO ] Deduced a trap composed of 175 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:10:51] [INFO ] Deduced a trap composed of 188 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:10:51] [INFO ] Deduced a trap composed of 178 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:10:52] [INFO ] Deduced a trap composed of 200 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:10:52] [INFO ] Deduced a trap composed of 189 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:10:52] [INFO ] Deduced a trap composed of 188 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:10:53] [INFO ] Deduced a trap composed of 193 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:10:53] [INFO ] Deduced a trap composed of 151 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:10:54] [INFO ] Deduced a trap composed of 126 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:10:54] [INFO ] Deduced a trap composed of 85 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:10:54] [INFO ] Deduced a trap composed of 163 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:10:55] [INFO ] Deduced a trap composed of 161 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:10:55] [INFO ] Deduced a trap composed of 158 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:10:55] [INFO ] Deduced a trap composed of 174 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:10:56] [INFO ] Deduced a trap composed of 168 places in 320 ms of which 1 ms to minimize.
[2023-03-09 15:10:56] [INFO ] Deduced a trap composed of 167 places in 316 ms of which 1 ms to minimize.
[2023-03-09 15:10:57] [INFO ] Deduced a trap composed of 180 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:10:57] [INFO ] Deduced a trap composed of 180 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:10:57] [INFO ] Deduced a trap composed of 166 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:10:58] [INFO ] Deduced a trap composed of 176 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:10:58] [INFO ] Deduced a trap composed of 163 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:10:58] [INFO ] Deduced a trap composed of 167 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:10:59] [INFO ] Deduced a trap composed of 178 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:10:59] [INFO ] Deduced a trap composed of 188 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:11:00] [INFO ] Deduced a trap composed of 180 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:11:00] [INFO ] Deduced a trap composed of 122 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:11:00] [INFO ] Deduced a trap composed of 166 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:11:01] [INFO ] Deduced a trap composed of 187 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:11:01] [INFO ] Deduced a trap composed of 188 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:11:01] [INFO ] Deduced a trap composed of 138 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:11:02] [INFO ] Deduced a trap composed of 176 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:11:02] [INFO ] Deduced a trap composed of 168 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:11:03] [INFO ] Deduced a trap composed of 178 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:11:03] [INFO ] Deduced a trap composed of 174 places in 264 ms of which 1 ms to minimize.
[2023-03-09 15:11:05] [INFO ] Deduced a trap composed of 192 places in 218 ms of which 0 ms to minimize.
[2023-03-09 15:11:05] [INFO ] Deduced a trap composed of 179 places in 224 ms of which 0 ms to minimize.
[2023-03-09 15:11:05] [INFO ] Deduced a trap composed of 173 places in 215 ms of which 1 ms to minimize.
[2023-03-09 15:11:06] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 1 ms to minimize.
[2023-03-09 15:11:06] [INFO ] Deduced a trap composed of 179 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:11:06] [INFO ] Deduced a trap composed of 181 places in 168 ms of which 0 ms to minimize.
[2023-03-09 15:11:06] [INFO ] Deduced a trap composed of 176 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:11:07] [INFO ] Deduced a trap composed of 185 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:11:07] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 1 ms to minimize.
[2023-03-09 15:11:07] [INFO ] Deduced a trap composed of 195 places in 188 ms of which 0 ms to minimize.
[2023-03-09 15:11:07] [INFO ] Deduced a trap composed of 175 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:11:07] [INFO ] Deduced a trap composed of 181 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:11:08] [INFO ] Deduced a trap composed of 191 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:11:08] [INFO ] Deduced a trap composed of 175 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:11:08] [INFO ] Deduced a trap composed of 191 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:11:08] [INFO ] Deduced a trap composed of 178 places in 161 ms of which 0 ms to minimize.
[2023-03-09 15:11:09] [INFO ] Deduced a trap composed of 181 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:11:09] [INFO ] Deduced a trap composed of 191 places in 191 ms of which 0 ms to minimize.
[2023-03-09 15:11:09] [INFO ] Deduced a trap composed of 194 places in 189 ms of which 1 ms to minimize.
[2023-03-09 15:11:09] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 1 ms to minimize.
[2023-03-09 15:11:09] [INFO ] Deduced a trap composed of 187 places in 183 ms of which 0 ms to minimize.
[2023-03-09 15:11:10] [INFO ] Deduced a trap composed of 198 places in 176 ms of which 0 ms to minimize.
[2023-03-09 15:11:10] [INFO ] Deduced a trap composed of 171 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:11:10] [INFO ] Deduced a trap composed of 198 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:11:10] [INFO ] Deduced a trap composed of 157 places in 174 ms of which 0 ms to minimize.
[2023-03-09 15:11:11] [INFO ] Deduced a trap composed of 197 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:11:11] [INFO ] Deduced a trap composed of 191 places in 174 ms of which 1 ms to minimize.
[2023-03-09 15:11:11] [INFO ] Deduced a trap composed of 84 places in 171 ms of which 0 ms to minimize.
[2023-03-09 15:11:11] [INFO ] Deduced a trap composed of 173 places in 170 ms of which 0 ms to minimize.
[2023-03-09 15:11:11] [INFO ] Deduced a trap composed of 176 places in 174 ms of which 0 ms to minimize.
[2023-03-09 15:11:12] [INFO ] Deduced a trap composed of 185 places in 156 ms of which 1 ms to minimize.
[2023-03-09 15:11:12] [INFO ] Deduced a trap composed of 207 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:11:12] [INFO ] Deduced a trap composed of 183 places in 155 ms of which 1 ms to minimize.
[2023-03-09 15:11:12] [INFO ] Deduced a trap composed of 195 places in 185 ms of which 0 ms to minimize.
[2023-03-09 15:11:12] [INFO ] Deduced a trap composed of 177 places in 157 ms of which 0 ms to minimize.
[2023-03-09 15:11:13] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:11:13] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:11:13] [INFO ] Deduced a trap composed of 172 places in 156 ms of which 0 ms to minimize.
[2023-03-09 15:11:13] [INFO ] Deduced a trap composed of 183 places in 163 ms of which 1 ms to minimize.
[2023-03-09 15:11:14] [INFO ] Deduced a trap composed of 185 places in 185 ms of which 0 ms to minimize.
[2023-03-09 15:11:14] [INFO ] Deduced a trap composed of 176 places in 161 ms of which 1 ms to minimize.
[2023-03-09 15:11:14] [INFO ] Deduced a trap composed of 200 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:11:14] [INFO ] Deduced a trap composed of 194 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:11:14] [INFO ] Deduced a trap composed of 198 places in 158 ms of which 0 ms to minimize.
[2023-03-09 15:11:15] [INFO ] Deduced a trap composed of 187 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:11:15] [INFO ] Deduced a trap composed of 186 places in 161 ms of which 1 ms to minimize.
[2023-03-09 15:11:15] [INFO ] Deduced a trap composed of 182 places in 187 ms of which 1 ms to minimize.
[2023-03-09 15:11:15] [INFO ] Deduced a trap composed of 179 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:11:16] [INFO ] Deduced a trap composed of 210 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:11:16] [INFO ] Deduced a trap composed of 189 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:11:16] [INFO ] Deduced a trap composed of 187 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:11:16] [INFO ] Deduced a trap composed of 197 places in 176 ms of which 1 ms to minimize.
[2023-03-09 15:11:16] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 0 ms to minimize.
[2023-03-09 15:11:17] [INFO ] Deduced a trap composed of 183 places in 263 ms of which 1 ms to minimize.
[2023-03-09 15:11:17] [INFO ] Deduced a trap composed of 150 places in 227 ms of which 1 ms to minimize.
[2023-03-09 15:11:17] [INFO ] Deduced a trap composed of 145 places in 256 ms of which 1 ms to minimize.
[2023-03-09 15:11:18] [INFO ] Deduced a trap composed of 142 places in 206 ms of which 1 ms to minimize.
[2023-03-09 15:11:18] [INFO ] Deduced a trap composed of 144 places in 197 ms of which 0 ms to minimize.
[2023-03-09 15:11:18] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 1 ms to minimize.
[2023-03-09 15:11:18] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:11:19] [INFO ] Deduced a trap composed of 206 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:11:19] [INFO ] Deduced a trap composed of 195 places in 188 ms of which 1 ms to minimize.
[2023-03-09 15:11:19] [INFO ] Deduced a trap composed of 182 places in 191 ms of which 0 ms to minimize.
[2023-03-09 15:11:19] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 0 ms to minimize.
[2023-03-09 15:11:19] [INFO ] Deduced a trap composed of 162 places in 164 ms of which 1 ms to minimize.
[2023-03-09 15:11:20] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:11:20] [INFO ] Deduced a trap composed of 179 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:11:20] [INFO ] Deduced a trap composed of 207 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:11:20] [INFO ] Deduced a trap composed of 218 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:11:21] [INFO ] Deduced a trap composed of 199 places in 174 ms of which 0 ms to minimize.
[2023-03-09 15:11:21] [INFO ] Deduced a trap composed of 185 places in 165 ms of which 0 ms to minimize.
[2023-03-09 15:11:21] [INFO ] Deduced a trap composed of 180 places in 164 ms of which 0 ms to minimize.
[2023-03-09 15:11:21] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 0 ms to minimize.
[2023-03-09 15:11:21] [INFO ] Deduced a trap composed of 187 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:11:22] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:11:22] [INFO ] Deduced a trap composed of 200 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:11:22] [INFO ] Deduced a trap composed of 179 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:11:22] [INFO ] Deduced a trap composed of 187 places in 176 ms of which 0 ms to minimize.
[2023-03-09 15:11:23] [INFO ] Deduced a trap composed of 206 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:11:23] [INFO ] Deduced a trap composed of 193 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:11:23] [INFO ] Deduced a trap composed of 186 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:11:23] [INFO ] Deduced a trap composed of 193 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:11:24] [INFO ] Deduced a trap composed of 204 places in 185 ms of which 0 ms to minimize.
[2023-03-09 15:11:24] [INFO ] Deduced a trap composed of 187 places in 183 ms of which 0 ms to minimize.
[2023-03-09 15:11:24] [INFO ] Deduced a trap composed of 161 places in 152 ms of which 1 ms to minimize.
[2023-03-09 15:11:24] [INFO ] Deduced a trap composed of 200 places in 178 ms of which 0 ms to minimize.
[2023-03-09 15:11:24] [INFO ] Deduced a trap composed of 188 places in 166 ms of which 0 ms to minimize.
[2023-03-09 15:11:25] [INFO ] Deduced a trap composed of 180 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:11:25] [INFO ] Deduced a trap composed of 172 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:11:25] [INFO ] Deduced a trap composed of 192 places in 162 ms of which 0 ms to minimize.
[2023-03-09 15:11:25] [INFO ] Deduced a trap composed of 176 places in 187 ms of which 0 ms to minimize.
[2023-03-09 15:11:26] [INFO ] Deduced a trap composed of 196 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:11:26] [INFO ] Deduced a trap composed of 195 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:11:26] [INFO ] Deduced a trap composed of 161 places in 177 ms of which 1 ms to minimize.
[2023-03-09 15:11:26] [INFO ] Deduced a trap composed of 192 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:11:26] [INFO ] Deduced a trap composed of 203 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:11:27] [INFO ] Deduced a trap composed of 206 places in 184 ms of which 0 ms to minimize.
[2023-03-09 15:11:27] [INFO ] Deduced a trap composed of 174 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:11:27] [INFO ] Deduced a trap composed of 172 places in 162 ms of which 1 ms to minimize.
[2023-03-09 15:11:27] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:11:28] [INFO ] Deduced a trap composed of 175 places in 178 ms of which 1 ms to minimize.
[2023-03-09 15:11:28] [INFO ] Deduced a trap composed of 190 places in 179 ms of which 0 ms to minimize.
[2023-03-09 15:11:28] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 1 ms to minimize.
[2023-03-09 15:11:28] [INFO ] Deduced a trap composed of 112 places in 174 ms of which 1 ms to minimize.
[2023-03-09 15:11:28] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:11:29] [INFO ] Deduced a trap composed of 185 places in 170 ms of which 0 ms to minimize.
[2023-03-09 15:11:29] [INFO ] Deduced a trap composed of 184 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:11:29] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 0 ms to minimize.
[2023-03-09 15:11:29] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:11:30] [INFO ] Deduced a trap composed of 190 places in 158 ms of which 1 ms to minimize.
[2023-03-09 15:11:30] [INFO ] Deduced a trap composed of 200 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:11:30] [INFO ] Deduced a trap composed of 193 places in 171 ms of which 0 ms to minimize.
[2023-03-09 15:11:30] [INFO ] Deduced a trap composed of 196 places in 185 ms of which 1 ms to minimize.
[2023-03-09 15:11:30] [INFO ] Deduced a trap composed of 174 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:11:31] [INFO ] Deduced a trap composed of 202 places in 190 ms of which 0 ms to minimize.
[2023-03-09 15:11:31] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 0 ms to minimize.
[2023-03-09 15:11:31] [INFO ] Deduced a trap composed of 203 places in 179 ms of which 0 ms to minimize.
[2023-03-09 15:11:31] [INFO ] Deduced a trap composed of 182 places in 176 ms of which 1 ms to minimize.
[2023-03-09 15:11:32] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-09 15:11:32] [INFO ] Deduced a trap composed of 182 places in 177 ms of which 0 ms to minimize.
[2023-03-09 15:11:32] [INFO ] Deduced a trap composed of 172 places in 173 ms of which 1 ms to minimize.
[2023-03-09 15:11:32] [INFO ] Deduced a trap composed of 195 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:11:33] [INFO ] Deduced a trap composed of 188 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:11:33] [INFO ] Deduced a trap composed of 202 places in 179 ms of which 1 ms to minimize.
[2023-03-09 15:11:33] [INFO ] Deduced a trap composed of 195 places in 166 ms of which 0 ms to minimize.
[2023-03-09 15:11:33] [INFO ] Deduced a trap composed of 181 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:11:34] [INFO ] Deduced a trap composed of 189 places in 172 ms of which 0 ms to minimize.
[2023-03-09 15:11:34] [INFO ] Deduced a trap composed of 192 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:11:34] [INFO ] Deduced a trap composed of 159 places in 181 ms of which 0 ms to minimize.
[2023-03-09 15:11:34] [INFO ] Deduced a trap composed of 195 places in 151 ms of which 0 ms to minimize.
[2023-03-09 15:11:34] [INFO ] Deduced a trap composed of 208 places in 160 ms of which 1 ms to minimize.
[2023-03-09 15:11:35] [INFO ] Deduced a trap composed of 189 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:11:35] [INFO ] Deduced a trap composed of 190 places in 160 ms of which 1 ms to minimize.
[2023-03-09 15:11:35] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 1 ms to minimize.
[2023-03-09 15:11:35] [INFO ] Deduced a trap composed of 201 places in 160 ms of which 1 ms to minimize.
[2023-03-09 15:11:36] [INFO ] Deduced a trap composed of 211 places in 197 ms of which 1 ms to minimize.
[2023-03-09 15:11:36] [INFO ] Deduced a trap composed of 200 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:11:36] [INFO ] Deduced a trap composed of 193 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:11:37] [INFO ] Deduced a trap composed of 216 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:11:37] [INFO ] Deduced a trap composed of 213 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:11:37] [INFO ] Deduced a trap composed of 207 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:11:38] [INFO ] Deduced a trap composed of 193 places in 291 ms of which 1 ms to minimize.
[2023-03-09 15:11:38] [INFO ] Deduced a trap composed of 175 places in 275 ms of which 1 ms to minimize.
[2023-03-09 15:11:38] [INFO ] Deduced a trap composed of 201 places in 156 ms of which 0 ms to minimize.
[2023-03-09 15:11:38] [INFO ] Deduced a trap composed of 207 places in 184 ms of which 0 ms to minimize.
[2023-03-09 15:11:39] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 0 ms to minimize.
[2023-03-09 15:11:40] [INFO ] Deduced a trap composed of 185 places in 159 ms of which 0 ms to minimize.
[2023-03-09 15:11:40] [INFO ] Deduced a trap composed of 185 places in 157 ms of which 1 ms to minimize.
[2023-03-09 15:11:40] [INFO ] Deduced a trap composed of 191 places in 291 ms of which 1 ms to minimize.
[2023-03-09 15:11:41] [INFO ] Deduced a trap composed of 152 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:11:41] [INFO ] Deduced a trap composed of 182 places in 177 ms of which 0 ms to minimize.
[2023-03-09 15:11:41] [INFO ] Deduced a trap composed of 180 places in 155 ms of which 0 ms to minimize.
[2023-03-09 15:11:41] [INFO ] Deduced a trap composed of 186 places in 256 ms of which 1 ms to minimize.
[2023-03-09 15:11:42] [INFO ] Deduced a trap composed of 184 places in 181 ms of which 1 ms to minimize.
[2023-03-09 15:11:42] [INFO ] Deduced a trap composed of 202 places in 283 ms of which 1 ms to minimize.
[2023-03-09 15:11:42] [INFO ] Deduced a trap composed of 199 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:11:43] [INFO ] Deduced a trap composed of 184 places in 191 ms of which 0 ms to minimize.
[2023-03-09 15:11:43] [INFO ] Deduced a trap composed of 193 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:11:43] [INFO ] Deduced a trap composed of 205 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:11:44] [INFO ] Deduced a trap composed of 202 places in 157 ms of which 0 ms to minimize.
[2023-03-09 15:11:44] [INFO ] Deduced a trap composed of 158 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:11:44] [INFO ] Deduced a trap composed of 193 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Deduced a trap composed of 201 places in 267 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Deduced a trap composed of 177 places in 274 ms of which 1 ms to minimize.
[2023-03-09 15:11:45] [INFO ] Deduced a trap composed of 184 places in 192 ms of which 0 ms to minimize.
[2023-03-09 15:11:46] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:11:46] [INFO ] Deduced a trap composed of 192 places in 275 ms of which 1 ms to minimize.
[2023-03-09 15:11:46] [INFO ] Deduced a trap composed of 207 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 194 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 161 places in 288 ms of which 1 ms to minimize.
[2023-03-09 15:11:47] [INFO ] Deduced a trap composed of 215 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:11:48] [INFO ] Deduced a trap composed of 211 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:11:48] [INFO ] Deduced a trap composed of 206 places in 260 ms of which 1 ms to minimize.
[2023-03-09 15:11:48] [INFO ] Deduced a trap composed of 163 places in 278 ms of which 1 ms to minimize.
[2023-03-09 15:11:50] [INFO ] Deduced a trap composed of 168 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:11:50] [INFO ] Deduced a trap composed of 156 places in 324 ms of which 1 ms to minimize.
[2023-03-09 15:11:51] [INFO ] Deduced a trap composed of 155 places in 320 ms of which 1 ms to minimize.
[2023-03-09 15:11:51] [INFO ] Deduced a trap composed of 184 places in 319 ms of which 1 ms to minimize.
[2023-03-09 15:11:52] [INFO ] Deduced a trap composed of 178 places in 311 ms of which 1 ms to minimize.
[2023-03-09 15:11:52] [INFO ] Deduced a trap composed of 155 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:11:53] [INFO ] Deduced a trap composed of 213 places in 317 ms of which 1 ms to minimize.
[2023-03-09 15:11:53] [INFO ] Deduced a trap composed of 201 places in 261 ms of which 1 ms to minimize.
[2023-03-09 15:11:53] [INFO ] Deduced a trap composed of 190 places in 321 ms of which 1 ms to minimize.
[2023-03-09 15:11:54] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:11:54] [INFO ] Deduced a trap composed of 196 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:11:55] [INFO ] Deduced a trap composed of 169 places in 318 ms of which 1 ms to minimize.
[2023-03-09 15:11:56] [INFO ] Deduced a trap composed of 159 places in 316 ms of which 1 ms to minimize.
[2023-03-09 15:11:56] [INFO ] Deduced a trap composed of 194 places in 318 ms of which 1 ms to minimize.
[2023-03-09 15:11:56] [INFO ] Deduced a trap composed of 218 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:11:57] [INFO ] Deduced a trap composed of 204 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:11:57] [INFO ] Deduced a trap composed of 144 places in 309 ms of which 1 ms to minimize.
[2023-03-09 15:11:58] [INFO ] Deduced a trap composed of 200 places in 323 ms of which 1 ms to minimize.
[2023-03-09 15:11:58] [INFO ] Deduced a trap composed of 198 places in 269 ms of which 1 ms to minimize.
[2023-03-09 15:11:58] [INFO ] Deduced a trap composed of 205 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 215 places in 323 ms of which 1 ms to minimize.
[2023-03-09 15:11:59] [INFO ] Deduced a trap composed of 199 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 200 places in 313 ms of which 1 ms to minimize.
[2023-03-09 15:12:00] [INFO ] Deduced a trap composed of 188 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 193 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 186 places in 295 ms of which 2 ms to minimize.
[2023-03-09 15:12:01] [INFO ] Deduced a trap composed of 175 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 182 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 212 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:12:02] [INFO ] Deduced a trap composed of 204 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:12:03] [INFO ] Deduced a trap composed of 204 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:12:03] [INFO ] Deduced a trap composed of 194 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:12:04] [INFO ] Deduced a trap composed of 206 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:12:04] [INFO ] Deduced a trap composed of 204 places in 310 ms of which 1 ms to minimize.
[2023-03-09 15:12:04] [INFO ] Deduced a trap composed of 195 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:12:05] [INFO ] Deduced a trap composed of 210 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:12:05] [INFO ] Deduced a trap composed of 205 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:12:05] [INFO ] Deduced a trap composed of 206 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:12:08] [INFO ] Deduced a trap composed of 194 places in 218 ms of which 0 ms to minimize.
[2023-03-09 15:12:08] [INFO ] Deduced a trap composed of 214 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:12:09] [INFO ] Deduced a trap composed of 197 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:12:09] [INFO ] Deduced a trap composed of 227 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:12:10] [INFO ] Deduced a trap composed of 161 places in 299 ms of which 0 ms to minimize.
[2023-03-09 15:12:11] [INFO ] Deduced a trap composed of 152 places in 320 ms of which 1 ms to minimize.
[2023-03-09 15:12:11] [INFO ] Deduced a trap composed of 166 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:12:11] [INFO ] Deduced a trap composed of 157 places in 310 ms of which 1 ms to minimize.
[2023-03-09 15:12:12] [INFO ] Deduced a trap composed of 172 places in 222 ms of which 1 ms to minimize.
[2023-03-09 15:12:12] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 1 ms to minimize.
[2023-03-09 15:12:14] [INFO ] Deduced a trap composed of 174 places in 142 ms of which 1 ms to minimize.
[2023-03-09 15:12:14] [INFO ] Deduced a trap composed of 184 places in 156 ms of which 1 ms to minimize.
[2023-03-09 15:12:14] [INFO ] Deduced a trap composed of 194 places in 170 ms of which 0 ms to minimize.
[2023-03-09 15:12:20] [INFO ] Deduced a trap composed of 2 places in 194 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 15:12:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 15:12:20] [INFO ] After 225221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:335
Fused 335 Parikh solutions to 310 different solutions.
Parikh walk visited 0 properties in 30100 ms.
Support contains 335 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 22 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 428/428 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 14 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2023-03-09 15:12:50] [INFO ] Invariant cache hit.
[2023-03-09 15:12:50] [INFO ] Implicit Places using invariants in 249 ms returned [20, 26, 221, 346, 419, 425]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 253 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 422/428 places, 399/399 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 422 transition count 396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 419 transition count 396
Applied a total of 6 rules in 29 ms. Remains 419 /422 variables (removed 3) and now considering 396/399 (removed 3) transitions.
// Phase 1: matrix 396 rows 419 cols
[2023-03-09 15:12:50] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-09 15:12:50] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-09 15:12:50] [INFO ] Invariant cache hit.
[2023-03-09 15:12:51] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:12:51] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/428 places, 396/399 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1715 ms. Remains : 419/428 places, 396/399 transitions.
Interrupted random walk after 518175 steps, including 74636 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 895 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 956 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 877 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 888 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 663 ms. (steps per millisecond=15 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 3734566 steps, run timeout after 141001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 3734566 steps, saw 1867124 distinct states, run finished after 141001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 335 properties.
[2023-03-09 15:16:00] [INFO ] Invariant cache hit.
[2023-03-09 15:16:06] [INFO ] After 6054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:16:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 25 ms returned sat
[2023-03-09 15:16:11] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-09 15:16:27] [INFO ] After 11377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 15:16:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:16:38] [INFO ] After 11904ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 15:16:40] [INFO ] Deduced a trap composed of 28 places in 263 ms of which 1 ms to minimize.
[2023-03-09 15:16:40] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 1 ms to minimize.
[2023-03-09 15:16:41] [INFO ] Deduced a trap composed of 25 places in 251 ms of which 1 ms to minimize.
[2023-03-09 15:16:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 942 ms
[2023-03-09 15:16:42] [INFO ] Deduced a trap composed of 112 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2023-03-09 15:16:45] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 1 ms to minimize.
[2023-03-09 15:16:45] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 1 ms to minimize.
[2023-03-09 15:16:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 551 ms
[2023-03-09 15:16:46] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 0 ms to minimize.
[2023-03-09 15:16:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-09 15:16:49] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 1 ms to minimize.
[2023-03-09 15:16:49] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 0 ms to minimize.
[2023-03-09 15:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2023-03-09 15:16:50] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 0 ms to minimize.
[2023-03-09 15:16:50] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 1 ms to minimize.
[2023-03-09 15:16:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 444 ms
[2023-03-09 15:16:50] [INFO ] Deduced a trap composed of 50 places in 149 ms of which 1 ms to minimize.
[2023-03-09 15:16:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 546 ms
[2023-03-09 15:16:52] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:16:52] [INFO ] Deduced a trap composed of 165 places in 322 ms of which 1 ms to minimize.
[2023-03-09 15:16:53] [INFO ] Deduced a trap composed of 174 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:16:53] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:16:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1582 ms
[2023-03-09 15:16:54] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:16:54] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 1 ms to minimize.
[2023-03-09 15:16:55] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 0 ms to minimize.
[2023-03-09 15:16:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 825 ms
[2023-03-09 15:16:57] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 1 ms to minimize.
[2023-03-09 15:16:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-09 15:16:57] [INFO ] Deduced a trap composed of 174 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:16:58] [INFO ] Deduced a trap composed of 169 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:16:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 722 ms
[2023-03-09 15:16:59] [INFO ] Deduced a trap composed of 171 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:16:59] [INFO ] Deduced a trap composed of 158 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:16:59] [INFO ] Deduced a trap composed of 155 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:17:00] [INFO ] Deduced a trap composed of 107 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:17:00] [INFO ] Deduced a trap composed of 160 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:17:00] [INFO ] Deduced a trap composed of 100 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:17:01] [INFO ] Deduced a trap composed of 149 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:17:01] [INFO ] Deduced a trap composed of 104 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:17:01] [INFO ] Deduced a trap composed of 119 places in 267 ms of which 1 ms to minimize.
[2023-03-09 15:17:02] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 1 ms to minimize.
[2023-03-09 15:17:02] [INFO ] Deduced a trap composed of 165 places in 263 ms of which 1 ms to minimize.
[2023-03-09 15:17:02] [INFO ] Deduced a trap composed of 173 places in 240 ms of which 0 ms to minimize.
[2023-03-09 15:17:03] [INFO ] Deduced a trap composed of 157 places in 249 ms of which 1 ms to minimize.
[2023-03-09 15:17:03] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 1 ms to minimize.
[2023-03-09 15:17:03] [INFO ] Deduced a trap composed of 156 places in 249 ms of which 0 ms to minimize.
[2023-03-09 15:17:04] [INFO ] Deduced a trap composed of 99 places in 257 ms of which 1 ms to minimize.
[2023-03-09 15:17:04] [INFO ] Deduced a trap composed of 159 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:17:04] [INFO ] Deduced a trap composed of 166 places in 256 ms of which 0 ms to minimize.
[2023-03-09 15:17:04] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 1 ms to minimize.
[2023-03-09 15:17:05] [INFO ] Deduced a trap composed of 159 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:17:05] [INFO ] Deduced a trap composed of 167 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:17:05] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 1 ms to minimize.
[2023-03-09 15:17:06] [INFO ] Deduced a trap composed of 174 places in 249 ms of which 0 ms to minimize.
[2023-03-09 15:17:06] [INFO ] Deduced a trap composed of 174 places in 261 ms of which 0 ms to minimize.
[2023-03-09 15:17:07] [INFO ] Deduced a trap composed of 162 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:17:07] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 0 ms to minimize.
[2023-03-09 15:17:07] [INFO ] Deduced a trap composed of 167 places in 260 ms of which 1 ms to minimize.
[2023-03-09 15:17:07] [INFO ] Deduced a trap composed of 165 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:17:08] [INFO ] Deduced a trap composed of 171 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:17:08] [INFO ] Deduced a trap composed of 136 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:17:08] [INFO ] Deduced a trap composed of 138 places in 283 ms of which 1 ms to minimize.
[2023-03-09 15:17:09] [INFO ] Deduced a trap composed of 129 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:17:09] [INFO ] Deduced a trap composed of 121 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:17:09] [INFO ] Deduced a trap composed of 100 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:17:10] [INFO ] Deduced a trap composed of 102 places in 307 ms of which 1 ms to minimize.
[2023-03-09 15:17:10] [INFO ] Deduced a trap composed of 106 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:17:10] [INFO ] Deduced a trap composed of 107 places in 285 ms of which 2 ms to minimize.
[2023-03-09 15:17:11] [INFO ] Deduced a trap composed of 166 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:17:11] [INFO ] Deduced a trap composed of 176 places in 269 ms of which 1 ms to minimize.
[2023-03-09 15:17:11] [INFO ] Deduced a trap composed of 149 places in 253 ms of which 1 ms to minimize.
[2023-03-09 15:17:12] [INFO ] Deduced a trap composed of 114 places in 288 ms of which 1 ms to minimize.
[2023-03-09 15:17:12] [INFO ] Deduced a trap composed of 173 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:17:12] [INFO ] Deduced a trap composed of 111 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:17:13] [INFO ] Deduced a trap composed of 178 places in 281 ms of which 0 ms to minimize.
[2023-03-09 15:17:13] [INFO ] Deduced a trap composed of 117 places in 203 ms of which 1 ms to minimize.
[2023-03-09 15:17:13] [INFO ] Deduced a trap composed of 183 places in 198 ms of which 0 ms to minimize.
[2023-03-09 15:17:13] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:17:14] [INFO ] Deduced a trap composed of 191 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:17:14] [INFO ] Deduced a trap composed of 175 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:17:14] [INFO ] Deduced a trap composed of 184 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:17:15] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 16192 ms
[2023-03-09 15:17:15] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-09 15:17:16] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 1 ms to minimize.
[2023-03-09 15:17:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-09 15:17:17] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 1 ms to minimize.
[2023-03-09 15:17:17] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 1 ms to minimize.
[2023-03-09 15:17:17] [INFO ] Deduced a trap composed of 117 places in 206 ms of which 0 ms to minimize.
[2023-03-09 15:17:18] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:17:18] [INFO ] Deduced a trap composed of 76 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:17:19] [INFO ] Deduced a trap composed of 172 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:17:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2121 ms
[2023-03-09 15:17:19] [INFO ] Deduced a trap composed of 68 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:17:19] [INFO ] Deduced a trap composed of 165 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:17:20] [INFO ] Deduced a trap composed of 163 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:17:20] [INFO ] Deduced a trap composed of 168 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:17:20] [INFO ] Deduced a trap composed of 128 places in 260 ms of which 1 ms to minimize.
[2023-03-09 15:17:21] [INFO ] Deduced a trap composed of 84 places in 279 ms of which 2 ms to minimize.
[2023-03-09 15:17:21] [INFO ] Deduced a trap composed of 93 places in 353 ms of which 1 ms to minimize.
[2023-03-09 15:17:21] [INFO ] Deduced a trap composed of 81 places in 340 ms of which 1 ms to minimize.
[2023-03-09 15:17:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2791 ms
[2023-03-09 15:17:25] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 1 ms to minimize.
[2023-03-09 15:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2023-03-09 15:17:25] [INFO ] Deduced a trap composed of 112 places in 360 ms of which 1 ms to minimize.
[2023-03-09 15:17:25] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2023-03-09 15:17:26] [INFO ] Deduced a trap composed of 190 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:17:26] [INFO ] Deduced a trap composed of 81 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:17:26] [INFO ] Deduced a trap composed of 153 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:17:27] [INFO ] Deduced a trap composed of 177 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:17:27] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 1 ms to minimize.
[2023-03-09 15:17:27] [INFO ] Deduced a trap composed of 82 places in 288 ms of which 1 ms to minimize.
[2023-03-09 15:17:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2448 ms
[2023-03-09 15:17:31] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2023-03-09 15:17:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-03-09 15:17:32] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 0 ms to minimize.
[2023-03-09 15:17:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 15:17:34] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 0 ms to minimize.
[2023-03-09 15:17:34] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 1 ms to minimize.
[2023-03-09 15:17:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2023-03-09 15:17:35] [INFO ] Deduced a trap composed of 170 places in 332 ms of which 1 ms to minimize.
[2023-03-09 15:17:35] [INFO ] Deduced a trap composed of 161 places in 317 ms of which 1 ms to minimize.
[2023-03-09 15:17:35] [INFO ] Deduced a trap composed of 165 places in 323 ms of which 1 ms to minimize.
[2023-03-09 15:17:36] [INFO ] Deduced a trap composed of 177 places in 318 ms of which 1 ms to minimize.
[2023-03-09 15:17:36] [INFO ] Deduced a trap composed of 187 places in 275 ms of which 0 ms to minimize.
[2023-03-09 15:17:36] [INFO ] Deduced a trap composed of 102 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:17:37] [INFO ] Deduced a trap composed of 91 places in 313 ms of which 0 ms to minimize.
[2023-03-09 15:17:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2609 ms
[2023-03-09 15:17:37] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2023-03-09 15:17:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-09 15:17:37] [INFO ] After 70574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 16830 ms.
[2023-03-09 15:17:54] [INFO ] After 107720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 314 different solutions.
Parikh walk visited 0 properties in 30430 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 16 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 12 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-03-09 15:18:24] [INFO ] Invariant cache hit.
[2023-03-09 15:18:25] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-09 15:18:25] [INFO ] Invariant cache hit.
[2023-03-09 15:18:25] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:18:26] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2023-03-09 15:18:26] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-09 15:18:26] [INFO ] Invariant cache hit.
[2023-03-09 15:18:26] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1997 ms. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14426 resets, run finished after 5550 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
[2023-03-09 15:18:32] [INFO ] Invariant cache hit.
[2023-03-09 15:18:32] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2023-03-09 15:18:32] [INFO ] [Real]Absence check using 7 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-09 15:18:34] [INFO ] After 1652ms SMT Verify possible using state equation in real domain returned unsat :0 sat :335
[2023-03-09 15:18:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:18:36] [INFO ] After 1722ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :335
[2023-03-09 15:18:36] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 1 ms to minimize.
[2023-03-09 15:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-09 15:18:37] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 1 ms to minimize.
[2023-03-09 15:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-09 15:18:39] [INFO ] Deduced a trap composed of 149 places in 329 ms of which 1 ms to minimize.
[2023-03-09 15:18:39] [INFO ] Deduced a trap composed of 153 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:18:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 718 ms
[2023-03-09 15:18:40] [INFO ] Deduced a trap composed of 114 places in 171 ms of which 1 ms to minimize.
[2023-03-09 15:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-09 15:18:40] [INFO ] Deduced a trap composed of 121 places in 210 ms of which 1 ms to minimize.
[2023-03-09 15:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-09 15:18:41] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 0 ms to minimize.
[2023-03-09 15:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2023-03-09 15:18:42] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:18:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-09 15:18:43] [INFO ] Deduced a trap composed of 147 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:18:43] [INFO ] Deduced a trap composed of 155 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:18:43] [INFO ] Deduced a trap composed of 120 places in 274 ms of which 0 ms to minimize.
[2023-03-09 15:18:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 887 ms
[2023-03-09 15:18:43] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 1 ms to minimize.
[2023-03-09 15:18:43] [INFO ] Deduced a trap composed of 74 places in 161 ms of which 1 ms to minimize.
[2023-03-09 15:18:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2023-03-09 15:18:45] [INFO ] Deduced a trap composed of 154 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:18:45] [INFO ] Deduced a trap composed of 148 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:18:45] [INFO ] Deduced a trap composed of 142 places in 288 ms of which 0 ms to minimize.
[2023-03-09 15:18:46] [INFO ] Deduced a trap composed of 152 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:18:46] [INFO ] Deduced a trap composed of 142 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:18:46] [INFO ] Deduced a trap composed of 166 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:18:47] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:18:47] [INFO ] Deduced a trap composed of 150 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:18:47] [INFO ] Deduced a trap composed of 152 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:18:48] [INFO ] Deduced a trap composed of 163 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:18:48] [INFO ] Deduced a trap composed of 165 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:18:49] [INFO ] Deduced a trap composed of 181 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:18:49] [INFO ] Deduced a trap composed of 128 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:18:49] [INFO ] Deduced a trap composed of 147 places in 291 ms of which 1 ms to minimize.
[2023-03-09 15:18:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4675 ms
[2023-03-09 15:18:52] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 0 ms to minimize.
[2023-03-09 15:18:52] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 1 ms to minimize.
[2023-03-09 15:18:52] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 0 ms to minimize.
[2023-03-09 15:18:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 627 ms
[2023-03-09 15:18:53] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 0 ms to minimize.
[2023-03-09 15:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2023-03-09 15:18:53] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 0 ms to minimize.
[2023-03-09 15:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-09 15:18:54] [INFO ] Deduced a trap composed of 124 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:18:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-09 15:18:55] [INFO ] Deduced a trap composed of 170 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:18:55] [INFO ] Deduced a trap composed of 151 places in 307 ms of which 1 ms to minimize.
[2023-03-09 15:18:56] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 1 ms to minimize.
[2023-03-09 15:18:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 924 ms
[2023-03-09 15:18:56] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 1 ms to minimize.
[2023-03-09 15:18:57] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 1 ms to minimize.
[2023-03-09 15:18:57] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 1 ms to minimize.
[2023-03-09 15:18:57] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 0 ms to minimize.
[2023-03-09 15:18:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 755 ms
[2023-03-09 15:18:57] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:18:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-09 15:18:59] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 1 ms to minimize.
[2023-03-09 15:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-09 15:18:59] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2023-03-09 15:19:00] [INFO ] Deduced a trap composed of 152 places in 313 ms of which 1 ms to minimize.
[2023-03-09 15:19:00] [INFO ] Deduced a trap composed of 140 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:19:00] [INFO ] Deduced a trap composed of 148 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:19:01] [INFO ] Deduced a trap composed of 154 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:19:01] [INFO ] Deduced a trap composed of 159 places in 368 ms of which 2 ms to minimize.
[2023-03-09 15:19:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2059 ms
[2023-03-09 15:19:02] [INFO ] Deduced a trap composed of 56 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:19:02] [INFO ] Deduced a trap composed of 118 places in 247 ms of which 1 ms to minimize.
[2023-03-09 15:19:02] [INFO ] Deduced a trap composed of 171 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:19:03] [INFO ] Deduced a trap composed of 162 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:19:03] [INFO ] Deduced a trap composed of 145 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:19:03] [INFO ] Deduced a trap composed of 140 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:19:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2034 ms
[2023-03-09 15:19:04] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 0 ms to minimize.
[2023-03-09 15:19:04] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 1 ms to minimize.
[2023-03-09 15:19:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2023-03-09 15:19:05] [INFO ] Deduced a trap composed of 138 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2023-03-09 15:19:05] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 1 ms to minimize.
[2023-03-09 15:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-09 15:19:06] [INFO ] Deduced a trap composed of 128 places in 283 ms of which 1 ms to minimize.
[2023-03-09 15:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-09 15:19:07] [INFO ] Deduced a trap composed of 168 places in 277 ms of which 0 ms to minimize.
[2023-03-09 15:19:07] [INFO ] Deduced a trap composed of 172 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:19:08] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:19:08] [INFO ] Deduced a trap composed of 152 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:19:08] [INFO ] Deduced a trap composed of 171 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:19:09] [INFO ] Deduced a trap composed of 170 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:19:09] [INFO ] Deduced a trap composed of 181 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:19:09] [INFO ] Deduced a trap composed of 190 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:19:10] [INFO ] Deduced a trap composed of 170 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:19:10] [INFO ] Deduced a trap composed of 188 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:19:10] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:19:10] [INFO ] Deduced a trap composed of 112 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:19:11] [INFO ] Deduced a trap composed of 122 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:19:11] [INFO ] Deduced a trap composed of 169 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:19:11] [INFO ] Deduced a trap composed of 175 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:19:12] [INFO ] Deduced a trap composed of 134 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:19:12] [INFO ] Deduced a trap composed of 126 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:19:12] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:19:13] [INFO ] Deduced a trap composed of 127 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:19:13] [INFO ] Deduced a trap composed of 161 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:19:13] [INFO ] Deduced a trap composed of 152 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:19:14] [INFO ] Deduced a trap composed of 179 places in 313 ms of which 1 ms to minimize.
[2023-03-09 15:19:14] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 1 ms to minimize.
[2023-03-09 15:19:14] [INFO ] Deduced a trap composed of 141 places in 235 ms of which 1 ms to minimize.
[2023-03-09 15:19:15] [INFO ] Deduced a trap composed of 157 places in 278 ms of which 1 ms to minimize.
[2023-03-09 15:19:15] [INFO ] Deduced a trap composed of 112 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:19:15] [INFO ] Deduced a trap composed of 154 places in 265 ms of which 1 ms to minimize.
[2023-03-09 15:19:16] [INFO ] Deduced a trap composed of 172 places in 275 ms of which 0 ms to minimize.
[2023-03-09 15:19:16] [INFO ] Deduced a trap composed of 177 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:19:16] [INFO ] Deduced a trap composed of 137 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:19:17] [INFO ] Deduced a trap composed of 183 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:19:17] [INFO ] Deduced a trap composed of 134 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:19:17] [INFO ] Deduced a trap composed of 121 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:19:17] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 10847 ms
[2023-03-09 15:19:18] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:19:18] [INFO ] Deduced a trap composed of 131 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 709 ms
[2023-03-09 15:19:21] [INFO ] Deduced a trap composed of 121 places in 280 ms of which 0 ms to minimize.
[2023-03-09 15:19:21] [INFO ] Deduced a trap composed of 123 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:19:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 707 ms
[2023-03-09 15:19:22] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 1 ms to minimize.
[2023-03-09 15:19:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-09 15:19:23] [INFO ] Deduced a trap composed of 174 places in 276 ms of which 0 ms to minimize.
[2023-03-09 15:19:23] [INFO ] Deduced a trap composed of 165 places in 275 ms of which 1 ms to minimize.
[2023-03-09 15:19:24] [INFO ] Deduced a trap composed of 161 places in 369 ms of which 1 ms to minimize.
[2023-03-09 15:19:24] [INFO ] Deduced a trap composed of 155 places in 311 ms of which 1 ms to minimize.
[2023-03-09 15:19:24] [INFO ] Deduced a trap composed of 164 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:19:25] [INFO ] Deduced a trap composed of 157 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:19:25] [INFO ] Deduced a trap composed of 158 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:19:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2495 ms
[2023-03-09 15:19:25] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 1 ms to minimize.
[2023-03-09 15:19:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-09 15:19:26] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 1 ms to minimize.
[2023-03-09 15:19:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-09 15:19:27] [INFO ] Deduced a trap composed of 121 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:19:28] [INFO ] Deduced a trap composed of 120 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:19:28] [INFO ] Deduced a trap composed of 80 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:19:28] [INFO ] Deduced a trap composed of 111 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:19:29] [INFO ] Deduced a trap composed of 119 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:19:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1733 ms
[2023-03-09 15:19:30] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 1 ms to minimize.
[2023-03-09 15:19:30] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 0 ms to minimize.
[2023-03-09 15:19:30] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 1 ms to minimize.
[2023-03-09 15:19:30] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 1 ms to minimize.
[2023-03-09 15:19:31] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 1 ms to minimize.
[2023-03-09 15:19:31] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 0 ms to minimize.
[2023-03-09 15:19:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1064 ms
[2023-03-09 15:19:35] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 1 ms to minimize.
[2023-03-09 15:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-09 15:19:37] [INFO ] After 63009ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:19:37] [INFO ] After 65323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:19:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 18 ms returned sat
[2023-03-09 15:19:38] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 19 ms returned sat
[2023-03-09 15:19:40] [INFO ] After 1573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 15:19:41] [INFO ] After 1811ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 15:19:44] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 0 ms to minimize.
[2023-03-09 15:19:44] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
[2023-03-09 15:19:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
[2023-03-09 15:19:44] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:19:45] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2023-03-09 15:19:45] [INFO ] Deduced a trap composed of 147 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:19:45] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 1 ms to minimize.
[2023-03-09 15:19:46] [INFO ] Deduced a trap composed of 157 places in 317 ms of which 1 ms to minimize.
[2023-03-09 15:19:46] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 1 ms to minimize.
[2023-03-09 15:19:46] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 0 ms to minimize.
[2023-03-09 15:19:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2428 ms
[2023-03-09 15:19:47] [INFO ] Deduced a trap composed of 130 places in 238 ms of which 0 ms to minimize.
[2023-03-09 15:19:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-09 15:19:48] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 0 ms to minimize.
[2023-03-09 15:19:48] [INFO ] Deduced a trap composed of 134 places in 247 ms of which 0 ms to minimize.
[2023-03-09 15:19:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
[2023-03-09 15:19:49] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2023-03-09 15:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-09 15:19:49] [INFO ] Deduced a trap composed of 174 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:19:50] [INFO ] Deduced a trap composed of 181 places in 321 ms of which 1 ms to minimize.
[2023-03-09 15:19:50] [INFO ] Deduced a trap composed of 170 places in 237 ms of which 1 ms to minimize.
[2023-03-09 15:19:50] [INFO ] Deduced a trap composed of 27 places in 221 ms of which 1 ms to minimize.
[2023-03-09 15:19:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1386 ms
[2023-03-09 15:19:51] [INFO ] Deduced a trap composed of 161 places in 326 ms of which 4 ms to minimize.
[2023-03-09 15:19:52] [INFO ] Deduced a trap composed of 113 places in 329 ms of which 1 ms to minimize.
[2023-03-09 15:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1020 ms
[2023-03-09 15:19:55] [INFO ] Deduced a trap composed of 119 places in 193 ms of which 1 ms to minimize.
[2023-03-09 15:19:56] [INFO ] Deduced a trap composed of 121 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:19:56] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 1 ms to minimize.
[2023-03-09 15:19:56] [INFO ] Deduced a trap composed of 121 places in 109 ms of which 0 ms to minimize.
[2023-03-09 15:19:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 898 ms
[2023-03-09 15:19:57] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 0 ms to minimize.
[2023-03-09 15:19:57] [INFO ] Deduced a trap composed of 161 places in 211 ms of which 1 ms to minimize.
[2023-03-09 15:19:58] [INFO ] Deduced a trap composed of 178 places in 266 ms of which 0 ms to minimize.
[2023-03-09 15:19:58] [INFO ] Deduced a trap composed of 141 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:19:58] [INFO ] Deduced a trap composed of 129 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:19:59] [INFO ] Deduced a trap composed of 133 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:19:59] [INFO ] Deduced a trap composed of 147 places in 323 ms of which 1 ms to minimize.
[2023-03-09 15:20:00] [INFO ] Deduced a trap composed of 133 places in 319 ms of which 1 ms to minimize.
[2023-03-09 15:20:00] [INFO ] Deduced a trap composed of 181 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:20:00] [INFO ] Deduced a trap composed of 172 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:20:01] [INFO ] Deduced a trap composed of 178 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:20:01] [INFO ] Deduced a trap composed of 157 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:20:01] [INFO ] Deduced a trap composed of 128 places in 257 ms of which 1 ms to minimize.
[2023-03-09 15:20:02] [INFO ] Deduced a trap composed of 110 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:20:02] [INFO ] Deduced a trap composed of 173 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:20:02] [INFO ] Deduced a trap composed of 197 places in 319 ms of which 2 ms to minimize.
[2023-03-09 15:20:03] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2023-03-09 15:20:03] [INFO ] Deduced a trap composed of 127 places in 208 ms of which 0 ms to minimize.
[2023-03-09 15:20:03] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 0 ms to minimize.
[2023-03-09 15:20:03] [INFO ] Deduced a trap composed of 149 places in 210 ms of which 0 ms to minimize.
[2023-03-09 15:20:04] [INFO ] Deduced a trap composed of 189 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:20:04] [INFO ] Deduced a trap composed of 167 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:20:05] [INFO ] Deduced a trap composed of 172 places in 278 ms of which 1 ms to minimize.
[2023-03-09 15:20:05] [INFO ] Deduced a trap composed of 151 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:20:05] [INFO ] Deduced a trap composed of 140 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:20:05] [INFO ] Deduced a trap composed of 130 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:20:06] [INFO ] Deduced a trap composed of 168 places in 343 ms of which 0 ms to minimize.
[2023-03-09 15:20:06] [INFO ] Deduced a trap composed of 138 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:20:07] [INFO ] Deduced a trap composed of 175 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:20:07] [INFO ] Deduced a trap composed of 182 places in 313 ms of which 1 ms to minimize.
[2023-03-09 15:20:07] [INFO ] Deduced a trap composed of 157 places in 323 ms of which 1 ms to minimize.
[2023-03-09 15:20:08] [INFO ] Deduced a trap composed of 171 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:20:08] [INFO ] Deduced a trap composed of 64 places in 242 ms of which 1 ms to minimize.
[2023-03-09 15:20:08] [INFO ] Deduced a trap composed of 56 places in 324 ms of which 1 ms to minimize.
[2023-03-09 15:20:09] [INFO ] Deduced a trap composed of 171 places in 321 ms of which 1 ms to minimize.
[2023-03-09 15:20:09] [INFO ] Deduced a trap composed of 159 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:20:09] [INFO ] Deduced a trap composed of 134 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:20:10] [INFO ] Deduced a trap composed of 156 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:20:10] [INFO ] Deduced a trap composed of 132 places in 256 ms of which 1 ms to minimize.
[2023-03-09 15:20:10] [INFO ] Deduced a trap composed of 131 places in 269 ms of which 1 ms to minimize.
[2023-03-09 15:20:11] [INFO ] Deduced a trap composed of 166 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:20:11] [INFO ] Deduced a trap composed of 130 places in 196 ms of which 1 ms to minimize.
[2023-03-09 15:20:11] [INFO ] Deduced a trap composed of 130 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:20:11] [INFO ] Deduced a trap composed of 130 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:20:12] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 0 ms to minimize.
[2023-03-09 15:20:12] [INFO ] Deduced a trap composed of 128 places in 173 ms of which 0 ms to minimize.
[2023-03-09 15:20:12] [INFO ] Deduced a trap composed of 131 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:20:12] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 0 ms to minimize.
[2023-03-09 15:20:13] [INFO ] Deduced a trap composed of 135 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:20:13] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 1 ms to minimize.
[2023-03-09 15:20:13] [INFO ] Deduced a trap composed of 173 places in 318 ms of which 1 ms to minimize.
[2023-03-09 15:20:14] [INFO ] Deduced a trap composed of 168 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:20:14] [INFO ] Deduced a trap composed of 123 places in 325 ms of which 1 ms to minimize.
[2023-03-09 15:20:14] [INFO ] Deduced a trap composed of 179 places in 302 ms of which 2 ms to minimize.
[2023-03-09 15:20:15] [INFO ] Deduced a trap composed of 162 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:20:15] [INFO ] Deduced a trap composed of 139 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:20:15] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 0 ms to minimize.
[2023-03-09 15:20:16] [INFO ] Deduced a trap composed of 163 places in 262 ms of which 1 ms to minimize.
[2023-03-09 15:20:16] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 0 ms to minimize.
[2023-03-09 15:20:16] [INFO ] Deduced a trap composed of 182 places in 250 ms of which 0 ms to minimize.
[2023-03-09 15:20:16] [INFO ] Deduced a trap composed of 169 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:20:17] [INFO ] Deduced a trap composed of 167 places in 268 ms of which 1 ms to minimize.
[2023-03-09 15:20:17] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 0 ms to minimize.
[2023-03-09 15:20:17] [INFO ] Deduced a trap composed of 174 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:20:18] [INFO ] Deduced a trap composed of 100 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:20:18] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 1 ms to minimize.
[2023-03-09 15:20:18] [INFO ] Deduced a trap composed of 175 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:20:19] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:20:19] [INFO ] Deduced a trap composed of 188 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:20:19] [INFO ] Deduced a trap composed of 62 places in 263 ms of which 1 ms to minimize.
[2023-03-09 15:20:20] [INFO ] Deduced a trap composed of 113 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:20:20] [INFO ] Deduced a trap composed of 90 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:20:20] [INFO ] Deduced a trap composed of 173 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:20:21] [INFO ] Deduced a trap composed of 194 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:20:21] [INFO ] Deduced a trap composed of 162 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:20:21] [INFO ] Deduced a trap composed of 84 places in 266 ms of which 0 ms to minimize.
[2023-03-09 15:20:21] [INFO ] Deduced a trap composed of 113 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:20:22] [INFO ] Deduced a trap composed of 112 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:20:22] [INFO ] Deduced a trap composed of 182 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:20:22] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 25411 ms
[2023-03-09 15:20:23] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2023-03-09 15:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-09 15:20:25] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 0 ms to minimize.
[2023-03-09 15:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-09 15:20:26] [INFO ] Deduced a trap composed of 107 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:20:27] [INFO ] Deduced a trap composed of 103 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:20:27] [INFO ] Deduced a trap composed of 103 places in 264 ms of which 1 ms to minimize.
[2023-03-09 15:20:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1017 ms
[2023-03-09 15:20:29] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 1 ms to minimize.
[2023-03-09 15:20:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-09 15:20:31] [INFO ] Deduced a trap composed of 112 places in 210 ms of which 1 ms to minimize.
[2023-03-09 15:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2023-03-09 15:20:32] [INFO ] Deduced a trap composed of 174 places in 343 ms of which 1 ms to minimize.
[2023-03-09 15:20:32] [INFO ] Deduced a trap composed of 167 places in 323 ms of which 1 ms to minimize.
[2023-03-09 15:20:32] [INFO ] Deduced a trap composed of 155 places in 332 ms of which 1 ms to minimize.
[2023-03-09 15:20:33] [INFO ] Deduced a trap composed of 155 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:20:33] [INFO ] Deduced a trap composed of 180 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:20:33] [INFO ] Deduced a trap composed of 163 places in 341 ms of which 2 ms to minimize.
[2023-03-09 15:20:34] [INFO ] Deduced a trap composed of 169 places in 338 ms of which 1 ms to minimize.
[2023-03-09 15:20:34] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:20:35] [INFO ] Deduced a trap composed of 129 places in 305 ms of which 2 ms to minimize.
[2023-03-09 15:20:35] [INFO ] Deduced a trap composed of 183 places in 322 ms of which 1 ms to minimize.
[2023-03-09 15:20:35] [INFO ] Deduced a trap composed of 170 places in 333 ms of which 1 ms to minimize.
[2023-03-09 15:20:36] [INFO ] Deduced a trap composed of 176 places in 327 ms of which 1 ms to minimize.
[2023-03-09 15:20:36] [INFO ] Deduced a trap composed of 184 places in 324 ms of which 1 ms to minimize.
[2023-03-09 15:20:36] [INFO ] Deduced a trap composed of 170 places in 325 ms of which 1 ms to minimize.
[2023-03-09 15:20:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5327 ms
[2023-03-09 15:20:40] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:20:40] [INFO ] Deduced a trap composed of 159 places in 283 ms of which 0 ms to minimize.
[2023-03-09 15:20:41] [INFO ] Deduced a trap composed of 169 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:20:41] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 0 ms to minimize.
[2023-03-09 15:20:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1286 ms
[2023-03-09 15:20:42] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2023-03-09 15:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-03-09 15:20:44] [INFO ] Deduced a trap composed of 147 places in 223 ms of which 0 ms to minimize.
[2023-03-09 15:20:45] [INFO ] Deduced a trap composed of 145 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:20:45] [INFO ] Deduced a trap composed of 130 places in 264 ms of which 0 ms to minimize.
[2023-03-09 15:20:45] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 1 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 163 places in 262 ms of which 1 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 141 places in 267 ms of which 1 ms to minimize.
[2023-03-09 15:20:46] [INFO ] Deduced a trap composed of 159 places in 311 ms of which 1 ms to minimize.
[2023-03-09 15:20:47] [INFO ] Deduced a trap composed of 185 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:20:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2650 ms
[2023-03-09 15:20:47] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2023-03-09 15:20:48] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 1 ms to minimize.
[2023-03-09 15:20:48] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2023-03-09 15:20:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2023-03-09 15:20:49] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 1 ms to minimize.
[2023-03-09 15:20:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-09 15:20:52] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 1 ms to minimize.
[2023-03-09 15:20:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1187 ms
[2023-03-09 15:20:55] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 0 ms to minimize.
[2023-03-09 15:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-09 15:20:56] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 1 ms to minimize.
[2023-03-09 15:20:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-09 15:20:57] [INFO ] Deduced a trap composed of 152 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:20:57] [INFO ] Deduced a trap composed of 160 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:20:58] [INFO ] Deduced a trap composed of 170 places in 264 ms of which 1 ms to minimize.
[2023-03-09 15:20:58] [INFO ] Deduced a trap composed of 86 places in 267 ms of which 1 ms to minimize.
[2023-03-09 15:20:58] [INFO ] Deduced a trap composed of 93 places in 242 ms of which 0 ms to minimize.
[2023-03-09 15:20:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1666 ms
[2023-03-09 15:21:00] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 1 ms to minimize.
[2023-03-09 15:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-03-09 15:21:02] [INFO ] After 81854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 12254 ms.
[2023-03-09 15:21:14] [INFO ] After 96344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Interrupted random walk after 543820 steps, including 78562 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 927 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 914 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 362 ms. (steps per millisecond=27 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 4075402 steps, run timeout after 141001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 4075402 steps, saw 2037504 distinct states, run finished after 141003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 335 properties.
[2023-03-09 15:24:23] [INFO ] Invariant cache hit.
[2023-03-09 15:24:28] [INFO ] After 5740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:24:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2023-03-09 15:24:32] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 20 ms returned sat
[2023-03-09 15:24:46] [INFO ] After 9498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 15:24:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:24:56] [INFO ] After 10307ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 15:24:57] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 1 ms to minimize.
[2023-03-09 15:24:58] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 1 ms to minimize.
[2023-03-09 15:24:58] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2023-03-09 15:24:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 779 ms
[2023-03-09 15:24:59] [INFO ] Deduced a trap composed of 112 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:24:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2023-03-09 15:25:01] [INFO ] Deduced a trap composed of 40 places in 195 ms of which 1 ms to minimize.
[2023-03-09 15:25:02] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:25:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2023-03-09 15:25:02] [INFO ] Deduced a trap composed of 27 places in 202 ms of which 1 ms to minimize.
[2023-03-09 15:25:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2023-03-09 15:25:05] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:25:06] [INFO ] Deduced a trap composed of 167 places in 291 ms of which 0 ms to minimize.
[2023-03-09 15:25:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 675 ms
[2023-03-09 15:25:06] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 1 ms to minimize.
[2023-03-09 15:25:06] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 0 ms to minimize.
[2023-03-09 15:25:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 415 ms
[2023-03-09 15:25:07] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2023-03-09 15:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2023-03-09 15:25:08] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 0 ms to minimize.
[2023-03-09 15:25:09] [INFO ] Deduced a trap composed of 165 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:25:09] [INFO ] Deduced a trap composed of 174 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:25:09] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2023-03-09 15:25:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1457 ms
[2023-03-09 15:25:10] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:25:11] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 1 ms to minimize.
[2023-03-09 15:25:11] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:25:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 771 ms
[2023-03-09 15:25:13] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 1 ms to minimize.
[2023-03-09 15:25:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-09 15:25:13] [INFO ] Deduced a trap composed of 174 places in 291 ms of which 1 ms to minimize.
[2023-03-09 15:25:14] [INFO ] Deduced a trap composed of 169 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:25:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 713 ms
[2023-03-09 15:25:15] [INFO ] Deduced a trap composed of 171 places in 288 ms of which 1 ms to minimize.
[2023-03-09 15:25:15] [INFO ] Deduced a trap composed of 158 places in 293 ms of which 2 ms to minimize.
[2023-03-09 15:25:15] [INFO ] Deduced a trap composed of 155 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:25:16] [INFO ] Deduced a trap composed of 107 places in 248 ms of which 0 ms to minimize.
[2023-03-09 15:25:16] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2023-03-09 15:25:16] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:25:16] [INFO ] Deduced a trap composed of 149 places in 165 ms of which 1 ms to minimize.
[2023-03-09 15:25:16] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 0 ms to minimize.
[2023-03-09 15:25:16] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 1 ms to minimize.
[2023-03-09 15:25:17] [INFO ] Deduced a trap composed of 162 places in 150 ms of which 0 ms to minimize.
[2023-03-09 15:25:17] [INFO ] Deduced a trap composed of 165 places in 220 ms of which 1 ms to minimize.
[2023-03-09 15:25:17] [INFO ] Deduced a trap composed of 173 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:25:17] [INFO ] Deduced a trap composed of 157 places in 167 ms of which 0 ms to minimize.
[2023-03-09 15:25:18] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 1 ms to minimize.
[2023-03-09 15:25:18] [INFO ] Deduced a trap composed of 156 places in 163 ms of which 0 ms to minimize.
[2023-03-09 15:25:18] [INFO ] Deduced a trap composed of 99 places in 309 ms of which 1 ms to minimize.
[2023-03-09 15:25:19] [INFO ] Deduced a trap composed of 159 places in 320 ms of which 1 ms to minimize.
[2023-03-09 15:25:19] [INFO ] Deduced a trap composed of 166 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:25:19] [INFO ] Deduced a trap composed of 156 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:25:20] [INFO ] Deduced a trap composed of 159 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:25:20] [INFO ] Deduced a trap composed of 167 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:25:20] [INFO ] Deduced a trap composed of 160 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:25:21] [INFO ] Deduced a trap composed of 174 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:25:21] [INFO ] Deduced a trap composed of 174 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:25:22] [INFO ] Deduced a trap composed of 162 places in 278 ms of which 1 ms to minimize.
[2023-03-09 15:25:22] [INFO ] Deduced a trap composed of 162 places in 250 ms of which 1 ms to minimize.
[2023-03-09 15:25:22] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 0 ms to minimize.
[2023-03-09 15:25:22] [INFO ] Deduced a trap composed of 165 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:25:23] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 1 ms to minimize.
[2023-03-09 15:25:23] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 1 ms to minimize.
[2023-03-09 15:25:23] [INFO ] Deduced a trap composed of 138 places in 264 ms of which 1 ms to minimize.
[2023-03-09 15:25:23] [INFO ] Deduced a trap composed of 129 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:25:24] [INFO ] Deduced a trap composed of 121 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:25:24] [INFO ] Deduced a trap composed of 100 places in 258 ms of which 1 ms to minimize.
[2023-03-09 15:25:24] [INFO ] Deduced a trap composed of 102 places in 254 ms of which 1 ms to minimize.
[2023-03-09 15:25:25] [INFO ] Deduced a trap composed of 106 places in 224 ms of which 0 ms to minimize.
[2023-03-09 15:25:25] [INFO ] Deduced a trap composed of 107 places in 274 ms of which 1 ms to minimize.
[2023-03-09 15:25:25] [INFO ] Deduced a trap composed of 166 places in 288 ms of which 0 ms to minimize.
[2023-03-09 15:25:26] [INFO ] Deduced a trap composed of 176 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:25:26] [INFO ] Deduced a trap composed of 149 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:25:26] [INFO ] Deduced a trap composed of 114 places in 287 ms of which 1 ms to minimize.
[2023-03-09 15:25:27] [INFO ] Deduced a trap composed of 173 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:25:27] [INFO ] Deduced a trap composed of 111 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:25:27] [INFO ] Deduced a trap composed of 178 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:25:28] [INFO ] Deduced a trap composed of 117 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:25:28] [INFO ] Deduced a trap composed of 183 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:25:28] [INFO ] Deduced a trap composed of 165 places in 267 ms of which 1 ms to minimize.
[2023-03-09 15:25:29] [INFO ] Deduced a trap composed of 191 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:25:29] [INFO ] Deduced a trap composed of 175 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:25:29] [INFO ] Deduced a trap composed of 184 places in 230 ms of which 1 ms to minimize.
[2023-03-09 15:25:29] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 14954 ms
[2023-03-09 15:25:30] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 1 ms to minimize.
[2023-03-09 15:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 339 ms
[2023-03-09 15:25:31] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 1 ms to minimize.
[2023-03-09 15:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-09 15:25:31] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 0 ms to minimize.
[2023-03-09 15:25:32] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2023-03-09 15:25:32] [INFO ] Deduced a trap composed of 117 places in 175 ms of which 1 ms to minimize.
[2023-03-09 15:25:32] [INFO ] Deduced a trap composed of 169 places in 153 ms of which 1 ms to minimize.
[2023-03-09 15:25:33] [INFO ] Deduced a trap composed of 76 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:25:33] [INFO ] Deduced a trap composed of 172 places in 248 ms of which 1 ms to minimize.
[2023-03-09 15:25:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1703 ms
[2023-03-09 15:25:33] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 165 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 163 places in 300 ms of which 0 ms to minimize.
[2023-03-09 15:25:34] [INFO ] Deduced a trap composed of 168 places in 299 ms of which 1 ms to minimize.
[2023-03-09 15:25:35] [INFO ] Deduced a trap composed of 128 places in 311 ms of which 2 ms to minimize.
[2023-03-09 15:25:35] [INFO ] Deduced a trap composed of 84 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:25:35] [INFO ] Deduced a trap composed of 93 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:25:36] [INFO ] Deduced a trap composed of 81 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:25:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2825 ms
[2023-03-09 15:25:39] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 0 ms to minimize.
[2023-03-09 15:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-09 15:25:39] [INFO ] Deduced a trap composed of 112 places in 278 ms of which 1 ms to minimize.
[2023-03-09 15:25:39] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 0 ms to minimize.
[2023-03-09 15:25:40] [INFO ] Deduced a trap composed of 190 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:25:40] [INFO ] Deduced a trap composed of 81 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:25:40] [INFO ] Deduced a trap composed of 153 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:25:41] [INFO ] Deduced a trap composed of 177 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:25:41] [INFO ] Deduced a trap composed of 174 places in 319 ms of which 1 ms to minimize.
[2023-03-09 15:25:41] [INFO ] Deduced a trap composed of 82 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:25:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2516 ms
[2023-03-09 15:25:45] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 0 ms to minimize.
[2023-03-09 15:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-09 15:25:46] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 0 ms to minimize.
[2023-03-09 15:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-09 15:25:48] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 0 ms to minimize.
[2023-03-09 15:25:48] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 1 ms to minimize.
[2023-03-09 15:25:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 338 ms
[2023-03-09 15:25:49] [INFO ] Deduced a trap composed of 170 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:25:49] [INFO ] Deduced a trap composed of 161 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:25:49] [INFO ] Deduced a trap composed of 165 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:25:50] [INFO ] Deduced a trap composed of 177 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:25:50] [INFO ] Deduced a trap composed of 187 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:25:50] [INFO ] Deduced a trap composed of 102 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:25:51] [INFO ] Deduced a trap composed of 91 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:25:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2520 ms
[2023-03-09 15:25:51] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-09 15:25:51] [INFO ] After 65612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 15701 ms.
[2023-03-09 15:26:07] [INFO ] After 98614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 314 different solutions.
Parikh walk visited 0 properties in 30439 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 11 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 10 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-03-09 15:26:38] [INFO ] Invariant cache hit.
[2023-03-09 15:26:38] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-09 15:26:38] [INFO ] Invariant cache hit.
[2023-03-09 15:26:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:26:39] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
[2023-03-09 15:26:39] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-09 15:26:39] [INFO ] Invariant cache hit.
[2023-03-09 15:26:39] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1862 ms. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14481 resets, run finished after 5504 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
[2023-03-09 15:26:45] [INFO ] Invariant cache hit.
[2023-03-09 15:26:45] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2023-03-09 15:26:45] [INFO ] [Real]Absence check using 7 positive and 41 generalized place invariants in 28 ms returned sat
[2023-03-09 15:26:48] [INFO ] After 1949ms SMT Verify possible using state equation in real domain returned unsat :0 sat :335
[2023-03-09 15:26:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-09 15:26:49] [INFO ] After 1590ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :335
[2023-03-09 15:26:50] [INFO ] Deduced a trap composed of 15 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-09 15:26:51] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 1 ms to minimize.
[2023-03-09 15:26:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-09 15:26:52] [INFO ] Deduced a trap composed of 149 places in 349 ms of which 1 ms to minimize.
[2023-03-09 15:26:53] [INFO ] Deduced a trap composed of 153 places in 347 ms of which 1 ms to minimize.
[2023-03-09 15:26:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 787 ms
[2023-03-09 15:26:53] [INFO ] Deduced a trap composed of 114 places in 235 ms of which 1 ms to minimize.
[2023-03-09 15:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-09 15:26:54] [INFO ] Deduced a trap composed of 121 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-09 15:26:54] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 1 ms to minimize.
[2023-03-09 15:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-09 15:26:55] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2023-03-09 15:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-09 15:26:55] [INFO ] Deduced a trap composed of 147 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:26:56] [INFO ] Deduced a trap composed of 155 places in 176 ms of which 1 ms to minimize.
[2023-03-09 15:26:56] [INFO ] Deduced a trap composed of 120 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:26:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 836 ms
[2023-03-09 15:26:56] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 0 ms to minimize.
[2023-03-09 15:26:56] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 1 ms to minimize.
[2023-03-09 15:26:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2023-03-09 15:26:58] [INFO ] Deduced a trap composed of 154 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:26:58] [INFO ] Deduced a trap composed of 148 places in 325 ms of which 1 ms to minimize.
[2023-03-09 15:26:59] [INFO ] Deduced a trap composed of 142 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:26:59] [INFO ] Deduced a trap composed of 152 places in 316 ms of which 1 ms to minimize.
[2023-03-09 15:26:59] [INFO ] Deduced a trap composed of 142 places in 327 ms of which 1 ms to minimize.
[2023-03-09 15:27:00] [INFO ] Deduced a trap composed of 166 places in 309 ms of which 1 ms to minimize.
[2023-03-09 15:27:00] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 1 ms to minimize.
[2023-03-09 15:27:01] [INFO ] Deduced a trap composed of 150 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:27:01] [INFO ] Deduced a trap composed of 152 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:27:01] [INFO ] Deduced a trap composed of 163 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:27:02] [INFO ] Deduced a trap composed of 165 places in 326 ms of which 2 ms to minimize.
[2023-03-09 15:27:02] [INFO ] Deduced a trap composed of 181 places in 272 ms of which 0 ms to minimize.
[2023-03-09 15:27:02] [INFO ] Deduced a trap composed of 128 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:27:03] [INFO ] Deduced a trap composed of 147 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:27:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4945 ms
[2023-03-09 15:27:04] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 0 ms to minimize.
[2023-03-09 15:27:05] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 1 ms to minimize.
[2023-03-09 15:27:05] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 1 ms to minimize.
[2023-03-09 15:27:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 459 ms
[2023-03-09 15:27:05] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 1 ms to minimize.
[2023-03-09 15:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-09 15:27:05] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2023-03-09 15:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-09 15:27:07] [INFO ] Deduced a trap composed of 124 places in 321 ms of which 1 ms to minimize.
[2023-03-09 15:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2023-03-09 15:27:07] [INFO ] Deduced a trap composed of 170 places in 316 ms of which 1 ms to minimize.
[2023-03-09 15:27:08] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 1 ms to minimize.
[2023-03-09 15:27:08] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2023-03-09 15:27:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 832 ms
[2023-03-09 15:27:08] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 0 ms to minimize.
[2023-03-09 15:27:09] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 1 ms to minimize.
[2023-03-09 15:27:09] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 1 ms to minimize.
[2023-03-09 15:27:09] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 0 ms to minimize.
[2023-03-09 15:27:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 662 ms
[2023-03-09 15:27:09] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 1 ms to minimize.
[2023-03-09 15:27:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-09 15:27:10] [INFO ] Deduced a trap composed of 139 places in 332 ms of which 1 ms to minimize.
[2023-03-09 15:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-09 15:27:11] [INFO ] Deduced a trap composed of 166 places in 335 ms of which 1 ms to minimize.
[2023-03-09 15:27:12] [INFO ] Deduced a trap composed of 152 places in 325 ms of which 1 ms to minimize.
[2023-03-09 15:27:12] [INFO ] Deduced a trap composed of 140 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:27:12] [INFO ] Deduced a trap composed of 148 places in 338 ms of which 1 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Deduced a trap composed of 154 places in 342 ms of which 1 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Deduced a trap composed of 159 places in 333 ms of which 1 ms to minimize.
[2023-03-09 15:27:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2284 ms
[2023-03-09 15:27:14] [INFO ] Deduced a trap composed of 56 places in 307 ms of which 1 ms to minimize.
[2023-03-09 15:27:14] [INFO ] Deduced a trap composed of 118 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:27:15] [INFO ] Deduced a trap composed of 171 places in 310 ms of which 1 ms to minimize.
[2023-03-09 15:27:15] [INFO ] Deduced a trap composed of 162 places in 275 ms of which 1 ms to minimize.
[2023-03-09 15:27:15] [INFO ] Deduced a trap composed of 145 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:27:16] [INFO ] Deduced a trap composed of 140 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:27:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2115 ms
[2023-03-09 15:27:16] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 1 ms to minimize.
[2023-03-09 15:27:16] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 0 ms to minimize.
[2023-03-09 15:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2023-03-09 15:27:17] [INFO ] Deduced a trap composed of 138 places in 231 ms of which 1 ms to minimize.
[2023-03-09 15:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-09 15:27:17] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 0 ms to minimize.
[2023-03-09 15:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-03-09 15:27:18] [INFO ] Deduced a trap composed of 128 places in 169 ms of which 1 ms to minimize.
[2023-03-09 15:27:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-09 15:27:18] [INFO ] Deduced a trap composed of 168 places in 148 ms of which 1 ms to minimize.
[2023-03-09 15:27:19] [INFO ] Deduced a trap composed of 172 places in 154 ms of which 0 ms to minimize.
[2023-03-09 15:27:19] [INFO ] Deduced a trap composed of 166 places in 162 ms of which 1 ms to minimize.
[2023-03-09 15:27:19] [INFO ] Deduced a trap composed of 152 places in 156 ms of which 0 ms to minimize.
[2023-03-09 15:27:19] [INFO ] Deduced a trap composed of 171 places in 253 ms of which 0 ms to minimize.
[2023-03-09 15:27:20] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 0 ms to minimize.
[2023-03-09 15:27:20] [INFO ] Deduced a trap composed of 181 places in 224 ms of which 0 ms to minimize.
[2023-03-09 15:27:20] [INFO ] Deduced a trap composed of 190 places in 192 ms of which 1 ms to minimize.
[2023-03-09 15:27:20] [INFO ] Deduced a trap composed of 170 places in 189 ms of which 0 ms to minimize.
[2023-03-09 15:27:21] [INFO ] Deduced a trap composed of 188 places in 238 ms of which 1 ms to minimize.
[2023-03-09 15:27:21] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 0 ms to minimize.
[2023-03-09 15:27:21] [INFO ] Deduced a trap composed of 112 places in 284 ms of which 1 ms to minimize.
[2023-03-09 15:27:22] [INFO ] Deduced a trap composed of 122 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:27:22] [INFO ] Deduced a trap composed of 169 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:27:22] [INFO ] Deduced a trap composed of 175 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:27:23] [INFO ] Deduced a trap composed of 134 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:27:23] [INFO ] Deduced a trap composed of 126 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:27:23] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:27:24] [INFO ] Deduced a trap composed of 127 places in 316 ms of which 1 ms to minimize.
[2023-03-09 15:27:24] [INFO ] Deduced a trap composed of 161 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:27:24] [INFO ] Deduced a trap composed of 152 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:27:25] [INFO ] Deduced a trap composed of 179 places in 286 ms of which 1 ms to minimize.
[2023-03-09 15:27:25] [INFO ] Deduced a trap composed of 136 places in 244 ms of which 1 ms to minimize.
[2023-03-09 15:27:25] [INFO ] Deduced a trap composed of 141 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:27:26] [INFO ] Deduced a trap composed of 157 places in 295 ms of which 1 ms to minimize.
[2023-03-09 15:27:26] [INFO ] Deduced a trap composed of 112 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:27:26] [INFO ] Deduced a trap composed of 154 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:27:27] [INFO ] Deduced a trap composed of 172 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:27:27] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 1 ms to minimize.
[2023-03-09 15:27:27] [INFO ] Deduced a trap composed of 137 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:27:27] [INFO ] Deduced a trap composed of 183 places in 273 ms of which 1 ms to minimize.
[2023-03-09 15:27:28] [INFO ] Deduced a trap composed of 134 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:27:28] [INFO ] Deduced a trap composed of 121 places in 272 ms of which 1 ms to minimize.
[2023-03-09 15:27:28] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9796 ms
[2023-03-09 15:27:29] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 0 ms to minimize.
[2023-03-09 15:27:29] [INFO ] Deduced a trap composed of 131 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:27:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 739 ms
[2023-03-09 15:27:31] [INFO ] Deduced a trap composed of 121 places in 207 ms of which 1 ms to minimize.
[2023-03-09 15:27:32] [INFO ] Deduced a trap composed of 123 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:27:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 649 ms
[2023-03-09 15:27:32] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 1 ms to minimize.
[2023-03-09 15:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-09 15:27:33] [INFO ] Deduced a trap composed of 174 places in 334 ms of which 1 ms to minimize.
[2023-03-09 15:27:34] [INFO ] Deduced a trap composed of 165 places in 304 ms of which 1 ms to minimize.
[2023-03-09 15:27:34] [INFO ] Deduced a trap composed of 161 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:27:34] [INFO ] Deduced a trap composed of 155 places in 310 ms of which 1 ms to minimize.
[2023-03-09 15:27:35] [INFO ] Deduced a trap composed of 164 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:27:35] [INFO ] Deduced a trap composed of 157 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:27:35] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 0 ms to minimize.
[2023-03-09 15:27:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2423 ms
[2023-03-09 15:27:36] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 0 ms to minimize.
[2023-03-09 15:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-09 15:27:36] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 0 ms to minimize.
[2023-03-09 15:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-09 15:27:37] [INFO ] Deduced a trap composed of 121 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:27:38] [INFO ] Deduced a trap composed of 120 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:27:38] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 1 ms to minimize.
[2023-03-09 15:27:38] [INFO ] Deduced a trap composed of 111 places in 274 ms of which 1 ms to minimize.
[2023-03-09 15:27:38] [INFO ] Deduced a trap composed of 119 places in 269 ms of which 1 ms to minimize.
[2023-03-09 15:27:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1639 ms
[2023-03-09 15:27:40] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 0 ms to minimize.
[2023-03-09 15:27:40] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 0 ms to minimize.
[2023-03-09 15:27:40] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 1 ms to minimize.
[2023-03-09 15:27:40] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 1 ms to minimize.
[2023-03-09 15:27:40] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 0 ms to minimize.
[2023-03-09 15:27:41] [INFO ] Deduced a trap composed of 110 places in 93 ms of which 0 ms to minimize.
[2023-03-09 15:27:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 943 ms
[2023-03-09 15:27:45] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 0 ms to minimize.
[2023-03-09 15:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-09 15:27:46] [INFO ] After 58543ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:27:46] [INFO ] After 61273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-09 15:27:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2023-03-09 15:27:47] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 24 ms returned sat
[2023-03-09 15:27:48] [INFO ] After 1289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-09 15:27:50] [INFO ] After 1380ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-09 15:27:52] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 1 ms to minimize.
[2023-03-09 15:27:52] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 1 ms to minimize.
[2023-03-09 15:27:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 730 ms
[2023-03-09 15:27:53] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 1 ms to minimize.
[2023-03-09 15:27:53] [INFO ] Deduced a trap composed of 13 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:27:53] [INFO ] Deduced a trap composed of 147 places in 211 ms of which 0 ms to minimize.
[2023-03-09 15:27:53] [INFO ] Deduced a trap composed of 161 places in 229 ms of which 2 ms to minimize.
[2023-03-09 15:27:54] [INFO ] Deduced a trap composed of 157 places in 281 ms of which 1 ms to minimize.
[2023-03-09 15:27:54] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:27:54] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 1 ms to minimize.
[2023-03-09 15:27:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2306 ms
[2023-03-09 15:27:55] [INFO ] Deduced a trap composed of 130 places in 228 ms of which 1 ms to minimize.
[2023-03-09 15:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-03-09 15:27:55] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 8 ms to minimize.
[2023-03-09 15:27:56] [INFO ] Deduced a trap composed of 134 places in 180 ms of which 1 ms to minimize.
[2023-03-09 15:27:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2023-03-09 15:27:57] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 1 ms to minimize.
[2023-03-09 15:27:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2023-03-09 15:27:57] [INFO ] Deduced a trap composed of 174 places in 162 ms of which 1 ms to minimize.
[2023-03-09 15:27:57] [INFO ] Deduced a trap composed of 181 places in 158 ms of which 1 ms to minimize.
[2023-03-09 15:27:58] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2023-03-09 15:27:58] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 1 ms to minimize.
[2023-03-09 15:27:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1135 ms
[2023-03-09 15:27:59] [INFO ] Deduced a trap composed of 161 places in 263 ms of which 1 ms to minimize.
[2023-03-09 15:27:59] [INFO ] Deduced a trap composed of 113 places in 245 ms of which 1 ms to minimize.
[2023-03-09 15:27:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 889 ms
[2023-03-09 15:28:03] [INFO ] Deduced a trap composed of 119 places in 204 ms of which 0 ms to minimize.
[2023-03-09 15:28:03] [INFO ] Deduced a trap composed of 121 places in 194 ms of which 1 ms to minimize.
[2023-03-09 15:28:03] [INFO ] Deduced a trap composed of 117 places in 186 ms of which 1 ms to minimize.
[2023-03-09 15:28:04] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 0 ms to minimize.
[2023-03-09 15:28:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1021 ms
[2023-03-09 15:28:05] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 1 ms to minimize.
[2023-03-09 15:28:05] [INFO ] Deduced a trap composed of 161 places in 275 ms of which 1 ms to minimize.
[2023-03-09 15:28:06] [INFO ] Deduced a trap composed of 178 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:28:06] [INFO ] Deduced a trap composed of 141 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:28:06] [INFO ] Deduced a trap composed of 129 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:28:07] [INFO ] Deduced a trap composed of 133 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:28:07] [INFO ] Deduced a trap composed of 147 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:28:08] [INFO ] Deduced a trap composed of 133 places in 263 ms of which 0 ms to minimize.
[2023-03-09 15:28:08] [INFO ] Deduced a trap composed of 181 places in 278 ms of which 0 ms to minimize.
[2023-03-09 15:28:08] [INFO ] Deduced a trap composed of 172 places in 253 ms of which 1 ms to minimize.
[2023-03-09 15:28:09] [INFO ] Deduced a trap composed of 178 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:28:09] [INFO ] Deduced a trap composed of 157 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:28:09] [INFO ] Deduced a trap composed of 128 places in 271 ms of which 1 ms to minimize.
[2023-03-09 15:28:10] [INFO ] Deduced a trap composed of 110 places in 279 ms of which 0 ms to minimize.
[2023-03-09 15:28:10] [INFO ] Deduced a trap composed of 173 places in 293 ms of which 1 ms to minimize.
[2023-03-09 15:28:10] [INFO ] Deduced a trap composed of 197 places in 260 ms of which 1 ms to minimize.
[2023-03-09 15:28:11] [INFO ] Deduced a trap composed of 166 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:28:11] [INFO ] Deduced a trap composed of 127 places in 279 ms of which 1 ms to minimize.
[2023-03-09 15:28:11] [INFO ] Deduced a trap composed of 163 places in 311 ms of which 3 ms to minimize.
[2023-03-09 15:28:12] [INFO ] Deduced a trap composed of 149 places in 285 ms of which 1 ms to minimize.
[2023-03-09 15:28:12] [INFO ] Deduced a trap composed of 189 places in 280 ms of which 1 ms to minimize.
[2023-03-09 15:28:12] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 1 ms to minimize.
[2023-03-09 15:28:13] [INFO ] Deduced a trap composed of 172 places in 283 ms of which 1 ms to minimize.
[2023-03-09 15:28:13] [INFO ] Deduced a trap composed of 151 places in 290 ms of which 0 ms to minimize.
[2023-03-09 15:28:13] [INFO ] Deduced a trap composed of 140 places in 262 ms of which 1 ms to minimize.
[2023-03-09 15:28:14] [INFO ] Deduced a trap composed of 130 places in 261 ms of which 1 ms to minimize.
[2023-03-09 15:28:14] [INFO ] Deduced a trap composed of 168 places in 251 ms of which 1 ms to minimize.
[2023-03-09 15:28:14] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 0 ms to minimize.
[2023-03-09 15:28:14] [INFO ] Deduced a trap composed of 175 places in 270 ms of which 1 ms to minimize.
[2023-03-09 15:28:15] [INFO ] Deduced a trap composed of 182 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:28:15] [INFO ] Deduced a trap composed of 157 places in 245 ms of which 0 ms to minimize.
[2023-03-09 15:28:15] [INFO ] Deduced a trap composed of 171 places in 282 ms of which 1 ms to minimize.
[2023-03-09 15:28:16] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 0 ms to minimize.
[2023-03-09 15:28:16] [INFO ] Deduced a trap composed of 56 places in 294 ms of which 1 ms to minimize.
[2023-03-09 15:28:16] [INFO ] Deduced a trap composed of 171 places in 292 ms of which 1 ms to minimize.
[2023-03-09 15:28:17] [INFO ] Deduced a trap composed of 159 places in 322 ms of which 1 ms to minimize.
[2023-03-09 15:28:17] [INFO ] Deduced a trap composed of 134 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:28:17] [INFO ] Deduced a trap composed of 156 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:28:18] [INFO ] Deduced a trap composed of 132 places in 290 ms of which 1 ms to minimize.
[2023-03-09 15:28:18] [INFO ] Deduced a trap composed of 131 places in 297 ms of which 1 ms to minimize.
[2023-03-09 15:28:18] [INFO ] Deduced a trap composed of 166 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:28:19] [INFO ] Deduced a trap composed of 130 places in 302 ms of which 1 ms to minimize.
[2023-03-09 15:28:19] [INFO ] Deduced a trap composed of 130 places in 292 ms of which 0 ms to minimize.
[2023-03-09 15:28:19] [INFO ] Deduced a trap composed of 130 places in 303 ms of which 1 ms to minimize.
[2023-03-09 15:28:20] [INFO ] Deduced a trap composed of 141 places in 311 ms of which 0 ms to minimize.
[2023-03-09 15:28:20] [INFO ] Deduced a trap composed of 128 places in 312 ms of which 0 ms to minimize.
[2023-03-09 15:28:21] [INFO ] Deduced a trap composed of 131 places in 305 ms of which 1 ms to minimize.
[2023-03-09 15:28:21] [INFO ] Deduced a trap composed of 166 places in 307 ms of which 1 ms to minimize.
[2023-03-09 15:28:21] [INFO ] Deduced a trap composed of 135 places in 306 ms of which 1 ms to minimize.
[2023-03-09 15:28:22] [INFO ] Deduced a trap composed of 164 places in 314 ms of which 1 ms to minimize.
[2023-03-09 15:28:22] [INFO ] Deduced a trap composed of 173 places in 298 ms of which 1 ms to minimize.
[2023-03-09 15:28:22] [INFO ] Deduced a trap composed of 168 places in 300 ms of which 1 ms to minimize.
[2023-03-09 15:28:23] [INFO ] Deduced a trap composed of 123 places in 312 ms of which 1 ms to minimize.
[2023-03-09 15:28:23] [INFO ] Deduced a trap composed of 179 places in 289 ms of which 1 ms to minimize.
[2023-03-09 15:28:23] [INFO ] Deduced a trap composed of 162 places in 315 ms of which 1 ms to minimize.
[2023-03-09 15:28:24] [INFO ] Deduced a trap composed of 139 places in 301 ms of which 1 ms to minimize.
[2023-03-09 15:28:24] [INFO ] Deduced a trap composed of 163 places in 276 ms of which 1 ms to minimize.
[2023-03-09 15:28:24] [INFO ] Deduced a trap composed of 163 places in 296 ms of which 1 ms to minimize.
[2023-03-09 15:28:25] [INFO ] Deduced a trap composed of 119 places in 267 ms of which 1 ms to minimize.
[2023-03-09 15:28:25] [INFO ] Deduced a trap composed of 182 places in 277 ms of which 1 ms to minimize.
[2023-03-09 15:28:25] [INFO ] Deduced a trap composed of 169 places in 295 ms of which 0 ms to minimize.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15750344 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16168244 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="DoubleExponent-PT-010"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DoubleExponent-PT-010, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r149-smll-167819435900298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;