MCC'2023- Execution of r160-smll-167819446000298

About the Execution of 2022-gold for DoubleExponent-PT-010

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1951.604	1800000.00	2900712.00	2804.60	[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.r160-smll-167819446000298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DoubleExponent-PT-010, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-167819446000298
=====================================================================

--------------------
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 1678441567777

Running Version 202205111006
[2023-03-10 09:46:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-10 09:46:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:46:10] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-03-10 09:46:10] [INFO ] Transformed 534 places.
[2023-03-10 09:46:10] [INFO ] Transformed 498 transitions.
[2023-03-10 09:46:10] [INFO ] Parsed PT model containing 534 places and 498 transitions in 419 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 28 ms.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 1118 ms. (steps per millisecond=8 ) properties (out of 523) seen :44
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 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 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 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 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 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 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 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 16 ms. (steps per millisecond=6 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=8 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 101 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 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 2 resets, run finished after 20 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 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 8 ms. (steps per millisecond=12 ) 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 8 ms. (steps per millisecond=12 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 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 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 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 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 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 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 101 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 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 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 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 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 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 11 ms. (steps per millisecond=9 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 2 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 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 12 ms. (steps per millisecond=8 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 100 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=8 ) 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 12 ms. (steps per millisecond=8 ) properties (out of 479) seen :0
Interrupted probabilistic random walk after 53202 steps, run timeout after 3001 ms. (steps per millisecond=17 ) 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 53202 steps, saw 26607 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :91
Running SMT prover for 388 properties.
// Phase 1: matrix 498 rows 534 cols
[2023-03-10 09:46:15] [INFO ] Computed 54 place invariants in 102 ms
[2023-03-10 09:46:22] [INFO ] After 7180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:388
[2023-03-10 09:46:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-10 09:46:27] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 39 ms returned sat
[2023-03-10 09:46:44] [INFO ] After 13128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :388
[2023-03-10 09:46:45] [INFO ] Deduced a trap composed of 43 places in 353 ms of which 10 ms to minimize.
[2023-03-10 09:46:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 441 ms
[2023-03-10 09:46:45] [INFO ] Deduced a trap composed of 159 places in 255 ms of which 2 ms to minimize.
[2023-03-10 09:46:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2023-03-10 09:46:46] [INFO ] Deduced a trap composed of 174 places in 296 ms of which 2 ms to minimize.
[2023-03-10 09:46:46] [INFO ] Deduced a trap composed of 55 places in 379 ms of which 2 ms to minimize.
[2023-03-10 09:46:47] [INFO ] Deduced a trap composed of 41 places in 769 ms of which 1 ms to minimize.
[2023-03-10 09:46:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 09:46:47] [INFO ] After 25194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:388
Fused 388 Parikh solutions to 374 different solutions.
Parikh walk visited 0 properties in 30383 ms.
Support contains 388 out of 534 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 10 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 12 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 13 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 201 ms. Remains 457 /534 variables (removed 77) and now considering 426/498 (removed 72) transitions.
Finished structural reductions, in 1 iterations. Remains : 457/534 places, 426/498 transitions.
Interrupted random walk after 423812 steps, including 54283 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 703 ms. (steps per millisecond=14 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 656 ms. (steps per millisecond=15 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 798 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 535 ms. (steps per millisecond=18 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 554 ms. (steps per millisecond=18 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 817 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 510 ms. (steps per millisecond=19 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 388) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 388) seen :0
Interrupted probabilistic random walk after 3653748 steps, run timeout after 162001 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, 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 3653748 steps, saw 1826713 distinct states, run finished after 162001 ms. (steps per millisecond=22 ) properties seen :53
Running SMT prover for 335 properties.
// Phase 1: matrix 426 rows 457 cols
[2023-03-10 09:50:54] [INFO ] Computed 54 place invariants in 44 ms
[2023-03-10 09:50:59] [INFO ] After 4973ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-10 09:51:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 09:51:02] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 44 ms returned sat
[2023-03-10 09:51:14] [INFO ] After 8072ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-10 09:51:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 09:51:22] [INFO ] After 8499ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-10 09:51:23] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 2 ms to minimize.
[2023-03-10 09:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-10 09:51:23] [INFO ] Deduced a trap composed of 33 places in 324 ms of which 1 ms to minimize.
[2023-03-10 09:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-10 09:51:24] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 2 ms to minimize.
[2023-03-10 09:51:24] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2023-03-10 09:51:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 553 ms
[2023-03-10 09:51:25] [INFO ] Deduced a trap composed of 144 places in 210 ms of which 0 ms to minimize.
[2023-03-10 09:51:25] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 2 ms to minimize.
[2023-03-10 09:51:26] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 1 ms to minimize.
[2023-03-10 09:51:26] [INFO ] Deduced a trap composed of 24 places in 303 ms of which 1 ms to minimize.
[2023-03-10 09:51:26] [INFO ] Deduced a trap composed of 146 places in 162 ms of which 1 ms to minimize.
[2023-03-10 09:51:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1553 ms
[2023-03-10 09:51:28] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
[2023-03-10 09:51:28] [INFO ] Deduced a trap composed of 153 places in 190 ms of which 1 ms to minimize.
[2023-03-10 09:51:28] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2023-03-10 09:51:28] [INFO ] Deduced a trap composed of 187 places in 230 ms of which 1 ms to minimize.
[2023-03-10 09:51:29] [INFO ] Deduced a trap composed of 150 places in 222 ms of which 1 ms to minimize.
[2023-03-10 09:51:29] [INFO ] Deduced a trap composed of 53 places in 232 ms of which 1 ms to minimize.
[2023-03-10 09:51:29] [INFO ] Deduced a trap composed of 158 places in 213 ms of which 1 ms to minimize.
[2023-03-10 09:51:30] [INFO ] Deduced a trap composed of 177 places in 219 ms of which 1 ms to minimize.
[2023-03-10 09:51:30] [INFO ] Deduced a trap composed of 171 places in 216 ms of which 1 ms to minimize.
[2023-03-10 09:51:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2489 ms
[2023-03-10 09:51:31] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 1 ms to minimize.
[2023-03-10 09:51:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-10 09:51:32] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 1 ms to minimize.
[2023-03-10 09:51:32] [INFO ] Deduced a trap composed of 174 places in 231 ms of which 1 ms to minimize.
[2023-03-10 09:51:33] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2023-03-10 09:51:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 687 ms
[2023-03-10 09:51:33] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 1 ms to minimize.
[2023-03-10 09:51:33] [INFO ] Deduced a trap composed of 149 places in 179 ms of which 0 ms to minimize.
[2023-03-10 09:51:33] [INFO ] Deduced a trap composed of 201 places in 197 ms of which 1 ms to minimize.
[2023-03-10 09:51:34] [INFO ] Deduced a trap composed of 172 places in 185 ms of which 1 ms to minimize.
[2023-03-10 09:51:34] [INFO ] Deduced a trap composed of 186 places in 211 ms of which 2 ms to minimize.
[2023-03-10 09:51:34] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 1 ms to minimize.
[2023-03-10 09:51:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1427 ms
[2023-03-10 09:51:35] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2023-03-10 09:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-10 09:51:35] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2023-03-10 09:51:35] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 1 ms to minimize.
[2023-03-10 09:51:36] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 0 ms to minimize.
[2023-03-10 09:51:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 457 ms
[2023-03-10 09:51:36] [INFO ] Deduced a trap composed of 133 places in 218 ms of which 1 ms to minimize.
[2023-03-10 09:51:36] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 1 ms to minimize.
[2023-03-10 09:51:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 528 ms
[2023-03-10 09:51:36] [INFO ] Deduced a trap composed of 137 places in 219 ms of which 1 ms to minimize.
[2023-03-10 09:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-10 09:51:37] [INFO ] Deduced a trap composed of 142 places in 298 ms of which 1 ms to minimize.
[2023-03-10 09:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-10 09:51:40] [INFO ] Deduced a trap composed of 181 places in 211 ms of which 1 ms to minimize.
[2023-03-10 09:51:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-10 09:51:40] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 0 ms to minimize.
[2023-03-10 09:51:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-10 09:51:41] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2023-03-10 09:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-10 09:51:41] [INFO ] Deduced a trap composed of 138 places in 210 ms of which 1 ms to minimize.
[2023-03-10 09:51:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-10 09:51:42] [INFO ] Deduced a trap composed of 187 places in 217 ms of which 1 ms to minimize.
[2023-03-10 09:51:42] [INFO ] Deduced a trap composed of 161 places in 229 ms of which 1 ms to minimize.
[2023-03-10 09:51:42] [INFO ] Deduced a trap composed of 171 places in 215 ms of which 1 ms to minimize.
[2023-03-10 09:51:43] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-10 09:51:44] [INFO ] Deduced a trap composed of 61 places in 199 ms of which 1 ms to minimize.
[2023-03-10 09:51:44] [INFO ] Deduced a trap composed of 197 places in 219 ms of which 1 ms to minimize.
[2023-03-10 09:51:44] [INFO ] Deduced a trap composed of 180 places in 204 ms of which 1 ms to minimize.
[2023-03-10 09:51:45] [INFO ] Deduced a trap composed of 161 places in 206 ms of which 0 ms to minimize.
[2023-03-10 09:51:45] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 0 ms to minimize.
[2023-03-10 09:51:45] [INFO ] Deduced a trap composed of 171 places in 221 ms of which 1 ms to minimize.
[2023-03-10 09:51:45] [INFO ] Deduced a trap composed of 152 places in 216 ms of which 1 ms to minimize.
[2023-03-10 09:51:46] [INFO ] Deduced a trap composed of 175 places in 221 ms of which 14 ms to minimize.
[2023-03-10 09:51:46] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 1 ms to minimize.
[2023-03-10 09:51:46] [INFO ] Deduced a trap composed of 182 places in 214 ms of which 0 ms to minimize.
[2023-03-10 09:51:46] [INFO ] Deduced a trap composed of 65 places in 215 ms of which 1 ms to minimize.
[2023-03-10 09:51:47] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 1 ms to minimize.
[2023-03-10 09:51:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5614 ms
[2023-03-10 09:51:48] [INFO ] Deduced a trap composed of 174 places in 193 ms of which 0 ms to minimize.
[2023-03-10 09:51:48] [INFO ] Deduced a trap composed of 182 places in 222 ms of which 1 ms to minimize.
[2023-03-10 09:51:48] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 1 ms to minimize.
[2023-03-10 09:51:49] [INFO ] Deduced a trap composed of 181 places in 277 ms of which 1 ms to minimize.
[2023-03-10 09:51:49] [INFO ] Deduced a trap composed of 145 places in 282 ms of which 8 ms to minimize.
[2023-03-10 09:51:49] [INFO ] Deduced a trap composed of 145 places in 205 ms of which 1 ms to minimize.
[2023-03-10 09:51:50] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 17 ms to minimize.
[2023-03-10 09:51:50] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 1 ms to minimize.
[2023-03-10 09:51:50] [INFO ] Deduced a trap composed of 167 places in 201 ms of which 1 ms to minimize.
[2023-03-10 09:51:50] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-10 09:51:51] [INFO ] Deduced a trap composed of 116 places in 211 ms of which 1 ms to minimize.
[2023-03-10 09:51:51] [INFO ] Deduced a trap composed of 148 places in 200 ms of which 0 ms to minimize.
[2023-03-10 09:51:51] [INFO ] Deduced a trap composed of 142 places in 209 ms of which 1 ms to minimize.
[2023-03-10 09:51:51] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 1 ms to minimize.
[2023-03-10 09:51:51] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 1 ms to minimize.
[2023-03-10 09:51:52] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 1 ms to minimize.
[2023-03-10 09:51:52] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 1 ms to minimize.
[2023-03-10 09:51:52] [INFO ] Deduced a trap composed of 122 places in 213 ms of which 0 ms to minimize.
[2023-03-10 09:51:52] [INFO ] Deduced a trap composed of 169 places in 221 ms of which 1 ms to minimize.
[2023-03-10 09:51:53] [INFO ] Deduced a trap composed of 173 places in 295 ms of which 3 ms to minimize.
[2023-03-10 09:51:53] [INFO ] Deduced a trap composed of 183 places in 267 ms of which 1 ms to minimize.
[2023-03-10 09:51:54] [INFO ] Deduced a trap composed of 142 places in 233 ms of which 0 ms to minimize.
[2023-03-10 09:51:54] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 1 ms to minimize.
[2023-03-10 09:51:54] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 1 ms to minimize.
[2023-03-10 09:51:54] [INFO ] Deduced a trap composed of 135 places in 213 ms of which 1 ms to minimize.
[2023-03-10 09:51:55] [INFO ] Deduced a trap composed of 173 places in 225 ms of which 1 ms to minimize.
[2023-03-10 09:51:55] [INFO ] Deduced a trap composed of 153 places in 207 ms of which 1 ms to minimize.
[2023-03-10 09:51:55] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 0 ms to minimize.
[2023-03-10 09:51:56] [INFO ] Deduced a trap composed of 181 places in 204 ms of which 0 ms to minimize.
[2023-03-10 09:51:56] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 1 ms to minimize.
[2023-03-10 09:51:56] [INFO ] Deduced a trap composed of 167 places in 211 ms of which 1 ms to minimize.
[2023-03-10 09:51:56] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 1 ms to minimize.
[2023-03-10 09:51:56] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 1 ms to minimize.
[2023-03-10 09:51:57] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 0 ms to minimize.
[2023-03-10 09:51:57] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-10 09:51:57] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 0 ms to minimize.
[2023-03-10 09:51:58] [INFO ] Deduced a trap composed of 135 places in 207 ms of which 0 ms to minimize.
[2023-03-10 09:51:58] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 10003 ms
[2023-03-10 09:51:59] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 1 ms to minimize.
[2023-03-10 09:51:59] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 0 ms to minimize.
[2023-03-10 09:52:00] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 1 ms to minimize.
[2023-03-10 09:52:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 921 ms
[2023-03-10 09:52:00] [INFO ] Deduced a trap composed of 118 places in 99 ms of which 0 ms to minimize.
[2023-03-10 09:52:01] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 0 ms to minimize.
[2023-03-10 09:52:01] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 0 ms to minimize.
[2023-03-10 09:52:01] [INFO ] Deduced a trap composed of 124 places in 220 ms of which 1 ms to minimize.
[2023-03-10 09:52:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 749 ms
[2023-03-10 09:52:02] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 1 ms to minimize.
[2023-03-10 09:52:02] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 1 ms to minimize.
[2023-03-10 09:52:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2023-03-10 09:52:03] [INFO ] Deduced a trap composed of 184 places in 213 ms of which 0 ms to minimize.
[2023-03-10 09:52:03] [INFO ] Deduced a trap composed of 138 places in 217 ms of which 0 ms to minimize.
[2023-03-10 09:52:04] [INFO ] Deduced a trap composed of 133 places in 222 ms of which 0 ms to minimize.
[2023-03-10 09:52:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 787 ms
[2023-03-10 09:52:05] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 0 ms to minimize.
[2023-03-10 09:52:05] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 1 ms to minimize.
[2023-03-10 09:52:05] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 1 ms to minimize.
[2023-03-10 09:52:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2023-03-10 09:52:07] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 0 ms to minimize.
[2023-03-10 09:52:07] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 1 ms to minimize.
[2023-03-10 09:52:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-03-10 09:52:08] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 0 ms to minimize.
[2023-03-10 09:52:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-10 09:52:08] [INFO ] Deduced a trap composed of 115 places in 277 ms of which 1 ms to minimize.
[2023-03-10 09:52:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-10 09:52:08] [INFO ] Deduced a trap composed of 116 places in 219 ms of which 1 ms to minimize.
[2023-03-10 09:52:09] [INFO ] Deduced a trap composed of 103 places in 201 ms of which 0 ms to minimize.
[2023-03-10 09:52:09] [INFO ] Deduced a trap composed of 181 places in 222 ms of which 0 ms to minimize.
[2023-03-10 09:52:09] [INFO ] Deduced a trap composed of 178 places in 194 ms of which 1 ms to minimize.
[2023-03-10 09:52:09] [INFO ] Deduced a trap composed of 185 places in 227 ms of which 1 ms to minimize.
[2023-03-10 09:52:10] [INFO ] Deduced a trap composed of 206 places in 218 ms of which 0 ms to minimize.
[2023-03-10 09:52:10] [INFO ] Deduced a trap composed of 193 places in 209 ms of which 0 ms to minimize.
[2023-03-10 09:52:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1724 ms
[2023-03-10 09:52:16] [INFO ] After 62121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 15826 ms.
[2023-03-10 09:52:32] [INFO ] After 92582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 322 different solutions.
Parikh walk visited 0 properties in 30466 ms.
Support contains 335 out of 457 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 10 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 10 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 3 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 1 iterations. Remains : 428/457 places, 399/426 transitions.
Interrupted random walk after 436618 steps, including 56006 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 707 ms. (steps per millisecond=14 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 538 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 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 840 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 728 ms. (steps per millisecond=13 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 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 841 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 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 866 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 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 827 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 659 ms. (steps per millisecond=15 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 875 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 3979720 steps, run timeout after 162001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 3979720 steps, saw 1989664 distinct states, run finished after 162006 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 399 rows 428 cols
[2023-03-10 09:56:38] [INFO ] Computed 54 place invariants in 34 ms
[2023-03-10 09:56:43] [INFO ] After 4326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-10 09:56:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 09:56:46] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 33 ms returned sat
[2023-03-10 09:56:57] [INFO ] After 7972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-10 09:56:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:57:05] [INFO ] After 8257ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-10 09:57:06] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2023-03-10 09:57:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-10 09:57:07] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2023-03-10 09:57:07] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 0 ms to minimize.
[2023-03-10 09:57:07] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2023-03-10 09:57:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 502 ms
[2023-03-10 09:57:07] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 1 ms to minimize.
[2023-03-10 09:57:08] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 0 ms to minimize.
[2023-03-10 09:57:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2023-03-10 09:57:09] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2023-03-10 09:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-10 09:57:10] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 0 ms to minimize.
[2023-03-10 09:57:10] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 1 ms to minimize.
[2023-03-10 09:57:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-03-10 09:57:11] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 0 ms to minimize.
[2023-03-10 09:57:11] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 0 ms to minimize.
[2023-03-10 09:57:11] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2023-03-10 09:57:11] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 0 ms to minimize.
[2023-03-10 09:57:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 592 ms
[2023-03-10 09:57:11] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 0 ms to minimize.
[2023-03-10 09:57:12] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 1 ms to minimize.
[2023-03-10 09:57:12] [INFO ] Deduced a trap composed of 55 places in 148 ms of which 1 ms to minimize.
[2023-03-10 09:57:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 663 ms
[2023-03-10 09:57:25] [INFO ] After 28140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 10099 ms.
[2023-03-10 09:57:35] [INFO ] After 52684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 312 different solutions.
Parikh walk visited 0 properties in 30129 ms.
Support contains 335 out of 428 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 1 iterations. Remains : 428/428 places, 399/399 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 428/428 places, 399/399 transitions.
Applied a total of 0 rules in 13 ms. Remains 428 /428 variables (removed 0) and now considering 399/399 (removed 0) transitions.
// Phase 1: matrix 399 rows 428 cols
[2023-03-10 09:58:06] [INFO ] Computed 54 place invariants in 28 ms
[2023-03-10 09:58:06] [INFO ] Implicit Places using invariants in 304 ms returned [20, 26, 221, 346, 419, 425]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 309 ms to find 6 implicit places.
Starting structural reductions in SAFETY 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 37 ms. Remains 419 /422 variables (removed 3) and now considering 396/399 (removed 3) transitions.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 09:58:06] [INFO ] Computed 48 place invariants in 34 ms
[2023-03-10 09:58:06] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 09:58:06] [INFO ] Computed 48 place invariants in 44 ms
[2023-03-10 09:58:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 09:58:08] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/428 places, 396/399 transitions.
Finished structural reductions, in 2 iterations. Remains : 419/428 places, 396/399 transitions.
Interrupted random walk after 448798 steps, including 64566 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 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 915 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 383 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 447 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 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 889 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 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 904 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 886 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 877 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 955 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 938 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 896 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 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 914 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 932 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 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 908 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 3725918 steps, run timeout after 150001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 3725918 steps, saw 1862795 distinct states, run finished after 150001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:01:28] [INFO ] Computed 48 place invariants in 20 ms
[2023-03-10 10:01:34] [INFO ] After 5635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-10 10:01:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2023-03-10 10:01:37] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-10 10:01:48] [INFO ] After 8081ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-10 10:01:48] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:01:56] [INFO ] After 8083ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-10 10:01:57] [INFO ] Deduced a trap composed of 150 places in 212 ms of which 1 ms to minimize.
[2023-03-10 10:01:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-10 10:01:57] [INFO ] Deduced a trap composed of 28 places in 154 ms of which 1 ms to minimize.
[2023-03-10 10:01:58] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2023-03-10 10:01:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2023-03-10 10:01:58] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2023-03-10 10:01:58] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 1 ms to minimize.
[2023-03-10 10:01:58] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 1 ms to minimize.
[2023-03-10 10:01:59] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 0 ms to minimize.
[2023-03-10 10:01:59] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:01:59] [INFO ] Deduced a trap composed of 145 places in 205 ms of which 1 ms to minimize.
[2023-03-10 10:01:59] [INFO ] Deduced a trap composed of 135 places in 209 ms of which 1 ms to minimize.
[2023-03-10 10:02:00] [INFO ] Deduced a trap composed of 143 places in 205 ms of which 1 ms to minimize.
[2023-03-10 10:02:00] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 1 ms to minimize.
[2023-03-10 10:02:00] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 1 ms to minimize.
[2023-03-10 10:02:00] [INFO ] Deduced a trap composed of 118 places in 193 ms of which 1 ms to minimize.
[2023-03-10 10:02:01] [INFO ] Deduced a trap composed of 143 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:02:01] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:02:01] [INFO ] Deduced a trap composed of 144 places in 187 ms of which 1 ms to minimize.
[2023-03-10 10:02:01] [INFO ] Deduced a trap composed of 176 places in 202 ms of which 1 ms to minimize.
[2023-03-10 10:02:02] [INFO ] Deduced a trap composed of 152 places in 189 ms of which 0 ms to minimize.
[2023-03-10 10:02:02] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:02:02] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:02:02] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 0 ms to minimize.
[2023-03-10 10:02:03] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 1 ms to minimize.
[2023-03-10 10:02:03] [INFO ] Deduced a trap composed of 158 places in 262 ms of which 1 ms to minimize.
[2023-03-10 10:02:03] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 0 ms to minimize.
[2023-03-10 10:02:03] [INFO ] Deduced a trap composed of 152 places in 202 ms of which 1 ms to minimize.
[2023-03-10 10:02:04] [INFO ] Deduced a trap composed of 134 places in 219 ms of which 0 ms to minimize.
[2023-03-10 10:02:04] [INFO ] Deduced a trap composed of 130 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:02:04] [INFO ] Deduced a trap composed of 125 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:02:04] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 1 ms to minimize.
[2023-03-10 10:02:05] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:02:05] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 1 ms to minimize.
[2023-03-10 10:02:05] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 0 ms to minimize.
[2023-03-10 10:02:05] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:02:05] [INFO ] Deduced a trap composed of 130 places in 184 ms of which 0 ms to minimize.
[2023-03-10 10:02:06] [INFO ] Deduced a trap composed of 118 places in 193 ms of which 0 ms to minimize.
[2023-03-10 10:02:06] [INFO ] Deduced a trap composed of 125 places in 189 ms of which 0 ms to minimize.
[2023-03-10 10:02:06] [INFO ] Deduced a trap composed of 131 places in 187 ms of which 1 ms to minimize.
[2023-03-10 10:02:06] [INFO ] Deduced a trap composed of 135 places in 182 ms of which 0 ms to minimize.
[2023-03-10 10:02:06] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:02:07] [INFO ] Deduced a trap composed of 166 places in 182 ms of which 0 ms to minimize.
[2023-03-10 10:02:07] [INFO ] Deduced a trap composed of 125 places in 196 ms of which 10 ms to minimize.
[2023-03-10 10:02:07] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:02:07] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 1 ms to minimize.
[2023-03-10 10:02:08] [INFO ] Deduced a trap composed of 124 places in 202 ms of which 1 ms to minimize.
[2023-03-10 10:02:08] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:02:08] [INFO ] Deduced a trap composed of 116 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:02:08] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 0 ms to minimize.
[2023-03-10 10:02:08] [INFO ] Deduced a trap composed of 136 places in 209 ms of which 1 ms to minimize.
[2023-03-10 10:02:09] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 0 ms to minimize.
[2023-03-10 10:02:09] [INFO ] Deduced a trap composed of 135 places in 197 ms of which 0 ms to minimize.
[2023-03-10 10:02:09] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 1 ms to minimize.
[2023-03-10 10:02:09] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 1 ms to minimize.
[2023-03-10 10:02:09] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 0 ms to minimize.
[2023-03-10 10:02:10] [INFO ] Deduced a trap composed of 132 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:02:10] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 0 ms to minimize.
[2023-03-10 10:02:10] [INFO ] Deduced a trap composed of 165 places in 183 ms of which 0 ms to minimize.
[2023-03-10 10:02:10] [INFO ] Deduced a trap composed of 130 places in 188 ms of which 0 ms to minimize.
[2023-03-10 10:02:11] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 0 ms to minimize.
[2023-03-10 10:02:11] [INFO ] Deduced a trap composed of 135 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:02:11] [INFO ] Deduced a trap composed of 134 places in 188 ms of which 0 ms to minimize.
[2023-03-10 10:02:11] [INFO ] Deduced a trap composed of 175 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:02:11] [INFO ] Deduced a trap composed of 186 places in 180 ms of which 1 ms to minimize.
[2023-03-10 10:02:12] [INFO ] Deduced a trap composed of 147 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:02:12] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 0 ms to minimize.
[2023-03-10 10:02:12] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 1 ms to minimize.
[2023-03-10 10:02:12] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:02:12] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 0 ms to minimize.
[2023-03-10 10:02:13] [INFO ] Deduced a trap composed of 163 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:02:13] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-10 10:02:13] [INFO ] Deduced a trap composed of 123 places in 211 ms of which 1 ms to minimize.
[2023-03-10 10:02:13] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 1 ms to minimize.
[2023-03-10 10:02:14] [INFO ] Deduced a trap composed of 177 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:02:14] [INFO ] Deduced a trap composed of 161 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:02:14] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 0 ms to minimize.
[2023-03-10 10:02:14] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:02:15] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 1 ms to minimize.
[2023-03-10 10:02:15] [INFO ] Deduced a trap composed of 170 places in 189 ms of which 1 ms to minimize.
[2023-03-10 10:02:15] [INFO ] Deduced a trap composed of 129 places in 180 ms of which 1 ms to minimize.
[2023-03-10 10:02:15] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 1 ms to minimize.
[2023-03-10 10:02:15] [INFO ] Deduced a trap composed of 152 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:02:16] [INFO ] Deduced a trap composed of 165 places in 177 ms of which 1 ms to minimize.
[2023-03-10 10:02:16] [INFO ] Deduced a trap composed of 174 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:02:16] [INFO ] Deduced a trap composed of 176 places in 187 ms of which 1 ms to minimize.
[2023-03-10 10:02:16] [INFO ] Deduced a trap composed of 177 places in 179 ms of which 0 ms to minimize.
[2023-03-10 10:02:17] [INFO ] Deduced a trap composed of 177 places in 211 ms of which 1 ms to minimize.
[2023-03-10 10:02:17] [INFO ] Deduced a trap composed of 157 places in 200 ms of which 0 ms to minimize.
[2023-03-10 10:02:17] [INFO ] Deduced a trap composed of 160 places in 301 ms of which 1 ms to minimize.
[2023-03-10 10:02:18] [INFO ] Deduced a trap composed of 179 places in 312 ms of which 1 ms to minimize.
[2023-03-10 10:02:18] [INFO ] Deduced a trap composed of 184 places in 314 ms of which 3 ms to minimize.
[2023-03-10 10:02:18] [INFO ] Deduced a trap composed of 197 places in 329 ms of which 1 ms to minimize.
[2023-03-10 10:02:19] [INFO ] Deduced a trap composed of 148 places in 326 ms of which 1 ms to minimize.
[2023-03-10 10:02:19] [INFO ] Deduced a trap composed of 133 places in 309 ms of which 1 ms to minimize.
[2023-03-10 10:02:19] [INFO ] Deduced a trap composed of 167 places in 310 ms of which 1 ms to minimize.
[2023-03-10 10:02:20] [INFO ] Deduced a trap composed of 136 places in 336 ms of which 1 ms to minimize.
[2023-03-10 10:02:20] [INFO ] Deduced a trap composed of 185 places in 337 ms of which 1 ms to minimize.
[2023-03-10 10:02:21] [INFO ] Deduced a trap composed of 168 places in 326 ms of which 1 ms to minimize.
[2023-03-10 10:02:21] [INFO ] Deduced a trap composed of 173 places in 322 ms of which 1 ms to minimize.
[2023-03-10 10:02:21] [INFO ] Deduced a trap composed of 183 places in 310 ms of which 1 ms to minimize.
[2023-03-10 10:02:22] [INFO ] Deduced a trap composed of 166 places in 335 ms of which 1 ms to minimize.
[2023-03-10 10:02:22] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2023-03-10 10:02:22] [INFO ] Deduced a trap composed of 187 places in 321 ms of which 1 ms to minimize.
[2023-03-10 10:02:23] [INFO ] Deduced a trap composed of 177 places in 292 ms of which 1 ms to minimize.
[2023-03-10 10:02:23] [INFO ] Deduced a trap composed of 166 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:02:23] [INFO ] Deduced a trap composed of 137 places in 317 ms of which 1 ms to minimize.
[2023-03-10 10:02:24] [INFO ] Deduced a trap composed of 168 places in 310 ms of which 2 ms to minimize.
[2023-03-10 10:02:24] [INFO ] Deduced a trap composed of 164 places in 320 ms of which 1 ms to minimize.
[2023-03-10 10:02:24] [INFO ] Deduced a trap composed of 183 places in 303 ms of which 1 ms to minimize.
[2023-03-10 10:02:25] [INFO ] Deduced a trap composed of 175 places in 330 ms of which 1 ms to minimize.
[2023-03-10 10:02:25] [INFO ] Deduced a trap composed of 164 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:02:26] [INFO ] Deduced a trap composed of 149 places in 324 ms of which 1 ms to minimize.
[2023-03-10 10:02:26] [INFO ] Deduced a trap composed of 168 places in 334 ms of which 1 ms to minimize.
[2023-03-10 10:02:26] [INFO ] Deduced a trap composed of 182 places in 310 ms of which 3 ms to minimize.
[2023-03-10 10:02:27] [INFO ] Deduced a trap composed of 150 places in 284 ms of which 7 ms to minimize.
[2023-03-10 10:02:27] [INFO ] Deduced a trap composed of 133 places in 292 ms of which 1 ms to minimize.
[2023-03-10 10:02:27] [INFO ] Deduced a trap composed of 143 places in 321 ms of which 1 ms to minimize.
[2023-03-10 10:02:28] [INFO ] Deduced a trap composed of 157 places in 325 ms of which 2 ms to minimize.
[2023-03-10 10:02:28] [INFO ] Deduced a trap composed of 141 places in 318 ms of which 1 ms to minimize.
[2023-03-10 10:02:28] [INFO ] Deduced a trap composed of 182 places in 320 ms of which 1 ms to minimize.
[2023-03-10 10:02:28] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 30755 ms
[2023-03-10 10:02:30] [INFO ] Deduced a trap composed of 183 places in 322 ms of which 1 ms to minimize.
[2023-03-10 10:02:31] [INFO ] Deduced a trap composed of 122 places in 332 ms of which 1 ms to minimize.
[2023-03-10 10:02:31] [INFO ] Deduced a trap composed of 40 places in 309 ms of which 1 ms to minimize.
[2023-03-10 10:02:31] [INFO ] Deduced a trap composed of 171 places in 340 ms of which 1 ms to minimize.
[2023-03-10 10:02:32] [INFO ] Deduced a trap composed of 161 places in 338 ms of which 1 ms to minimize.
[2023-03-10 10:02:32] [INFO ] Deduced a trap composed of 137 places in 323 ms of which 1 ms to minimize.
[2023-03-10 10:02:33] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 0 ms to minimize.
[2023-03-10 10:02:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2945 ms
[2023-03-10 10:02:33] [INFO ] Deduced a trap composed of 148 places in 345 ms of which 1 ms to minimize.
[2023-03-10 10:02:34] [INFO ] Deduced a trap composed of 34 places in 340 ms of which 1 ms to minimize.
[2023-03-10 10:02:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1032 ms
[2023-03-10 10:02:35] [INFO ] Deduced a trap composed of 171 places in 358 ms of which 1 ms to minimize.
[2023-03-10 10:02:35] [INFO ] Deduced a trap composed of 134 places in 344 ms of which 1 ms to minimize.
[2023-03-10 10:02:35] [INFO ] Deduced a trap composed of 125 places in 324 ms of which 1 ms to minimize.
[2023-03-10 10:02:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1210 ms
[2023-03-10 10:02:39] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 0 ms to minimize.
[2023-03-10 10:02:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-10 10:02:40] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 1 ms to minimize.
[2023-03-10 10:02:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-10 10:02:40] [INFO ] Deduced a trap composed of 149 places in 322 ms of which 1 ms to minimize.
[2023-03-10 10:02:41] [INFO ] Deduced a trap composed of 143 places in 272 ms of which 1 ms to minimize.
[2023-03-10 10:02:41] [INFO ] Deduced a trap composed of 163 places in 330 ms of which 1 ms to minimize.
[2023-03-10 10:02:41] [INFO ] Deduced a trap composed of 119 places in 330 ms of which 1 ms to minimize.
[2023-03-10 10:02:42] [INFO ] Deduced a trap composed of 173 places in 345 ms of which 1 ms to minimize.
[2023-03-10 10:02:42] [INFO ] Deduced a trap composed of 165 places in 336 ms of which 1 ms to minimize.
[2023-03-10 10:02:42] [INFO ] Deduced a trap composed of 174 places in 337 ms of which 1 ms to minimize.
[2023-03-10 10:02:43] [INFO ] Deduced a trap composed of 127 places in 337 ms of which 1 ms to minimize.
[2023-03-10 10:02:43] [INFO ] Deduced a trap composed of 120 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:02:43] [INFO ] Deduced a trap composed of 114 places in 274 ms of which 1 ms to minimize.
[2023-03-10 10:02:44] [INFO ] Deduced a trap composed of 167 places in 303 ms of which 1 ms to minimize.
[2023-03-10 10:02:44] [INFO ] Deduced a trap composed of 121 places in 296 ms of which 1 ms to minimize.
[2023-03-10 10:02:45] [INFO ] Deduced a trap composed of 171 places in 326 ms of which 1 ms to minimize.
[2023-03-10 10:02:45] [INFO ] Deduced a trap composed of 188 places in 317 ms of which 1 ms to minimize.
[2023-03-10 10:02:46] [INFO ] Deduced a trap composed of 155 places in 275 ms of which 1 ms to minimize.
[2023-03-10 10:02:46] [INFO ] Deduced a trap composed of 176 places in 317 ms of which 1 ms to minimize.
[2023-03-10 10:02:46] [INFO ] Deduced a trap composed of 171 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:02:47] [INFO ] Deduced a trap composed of 116 places in 267 ms of which 1 ms to minimize.
[2023-03-10 10:02:47] [INFO ] Deduced a trap composed of 143 places in 329 ms of which 1 ms to minimize.
[2023-03-10 10:02:47] [INFO ] Deduced a trap composed of 136 places in 319 ms of which 1 ms to minimize.
[2023-03-10 10:02:48] [INFO ] Deduced a trap composed of 153 places in 321 ms of which 1 ms to minimize.
[2023-03-10 10:02:48] [INFO ] Deduced a trap composed of 145 places in 306 ms of which 1 ms to minimize.
[2023-03-10 10:02:48] [INFO ] Deduced a trap composed of 173 places in 313 ms of which 1 ms to minimize.
[2023-03-10 10:02:49] [INFO ] Deduced a trap composed of 117 places in 302 ms of which 1 ms to minimize.
[2023-03-10 10:02:49] [INFO ] Deduced a trap composed of 180 places in 201 ms of which 0 ms to minimize.
[2023-03-10 10:02:49] [INFO ] Deduced a trap composed of 174 places in 217 ms of which 0 ms to minimize.
[2023-03-10 10:02:50] [INFO ] Deduced a trap composed of 170 places in 323 ms of which 1 ms to minimize.
[2023-03-10 10:02:50] [INFO ] Deduced a trap composed of 117 places in 219 ms of which 1 ms to minimize.
[2023-03-10 10:02:50] [INFO ] Deduced a trap composed of 165 places in 302 ms of which 1 ms to minimize.
[2023-03-10 10:02:50] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 10539 ms
[2023-03-10 10:02:51] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2023-03-10 10:02:52] [INFO ] Deduced a trap composed of 114 places in 189 ms of which 1 ms to minimize.
[2023-03-10 10:02:52] [INFO ] Deduced a trap composed of 118 places in 195 ms of which 1 ms to minimize.
[2023-03-10 10:02:52] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 1 ms to minimize.
[2023-03-10 10:02:52] [INFO ] Deduced a trap composed of 115 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:02:53] [INFO ] Deduced a trap composed of 124 places in 195 ms of which 1 ms to minimize.
[2023-03-10 10:02:53] [INFO ] Deduced a trap composed of 129 places in 189 ms of which 1 ms to minimize.
[2023-03-10 10:02:53] [INFO ] Deduced a trap composed of 121 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:02:53] [INFO ] Deduced a trap composed of 131 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:02:53] [INFO ] Deduced a trap composed of 128 places in 192 ms of which 0 ms to minimize.
[2023-03-10 10:02:54] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:02:54] [INFO ] Deduced a trap composed of 121 places in 166 ms of which 1 ms to minimize.
[2023-03-10 10:02:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2829 ms
[2023-03-10 10:02:58] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 1 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 0 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 1 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 0 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 0 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 0 ms to minimize.
[2023-03-10 10:02:59] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 1 ms to minimize.
[2023-03-10 10:03:00] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 0 ms to minimize.
[2023-03-10 10:03:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1318 ms
[2023-03-10 10:03:00] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 0 ms to minimize.
[2023-03-10 10:03:00] [INFO ] Deduced a trap composed of 117 places in 99 ms of which 0 ms to minimize.
[2023-03-10 10:03:00] [INFO ] Deduced a trap composed of 114 places in 97 ms of which 0 ms to minimize.
[2023-03-10 10:03:00] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 0 ms to minimize.
[2023-03-10 10:03:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 579 ms
[2023-03-10 10:03:04] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 0 ms to minimize.
[2023-03-10 10:03:04] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 1 ms to minimize.
[2023-03-10 10:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-10 10:03:04] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 0 ms to minimize.
[2023-03-10 10:03:05] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 0 ms to minimize.
[2023-03-10 10:03:05] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 0 ms to minimize.
[2023-03-10 10:03:05] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 1 ms to minimize.
[2023-03-10 10:03:05] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2023-03-10 10:03:05] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 0 ms to minimize.
[2023-03-10 10:03:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 755 ms
[2023-03-10 10:03:06] [INFO ] Deduced a trap composed of 119 places in 94 ms of which 0 ms to minimize.
[2023-03-10 10:03:06] [INFO ] Deduced a trap composed of 117 places in 101 ms of which 1 ms to minimize.
[2023-03-10 10:03:07] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 0 ms to minimize.
[2023-03-10 10:03:07] [INFO ] Deduced a trap composed of 122 places in 98 ms of which 0 ms to minimize.
[2023-03-10 10:03:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 543 ms
[2023-03-10 10:03:07] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 0 ms to minimize.
[2023-03-10 10:03:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-10 10:03:09] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 0 ms to minimize.
[2023-03-10 10:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-10 10:03:09] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 1 ms to minimize.
[2023-03-10 10:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-10 10:03:12] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 1 ms to minimize.
[2023-03-10 10:03:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-10 10:03:14] [INFO ] After 85664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 20862 ms.
[2023-03-10 10:03:35] [INFO ] After 121103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 309 different solutions.
Parikh walk visited 0 properties in 30171 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 13 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:04:05] [INFO ] Computed 48 place invariants in 21 ms
[2023-03-10 10:04:05] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:04:05] [INFO ] Computed 48 place invariants in 21 ms
[2023-03-10 10:04:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:04:06] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1624 ms to find 0 implicit places.
[2023-03-10 10:04:07] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:04:07] [INFO ] Computed 48 place invariants in 22 ms
[2023-03-10 10:04:07] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14398 resets, run finished after 6924 ms. (steps per millisecond=14 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:04:14] [INFO ] Computed 48 place invariants in 20 ms
[2023-03-10 10:04:20] [INFO ] After 5674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-10 10:04:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 25 ms returned sat
[2023-03-10 10:04:24] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-10 10:04:39] [INFO ] After 10657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-10 10:04:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:04:49] [INFO ] After 10086ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-10 10:04:50] [INFO ] Deduced a trap composed of 150 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2023-03-10 10:04:51] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 0 ms to minimize.
[2023-03-10 10:04:51] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2023-03-10 10:04:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-10 10:04:51] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 1 ms to minimize.
[2023-03-10 10:04:52] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2023-03-10 10:04:52] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2023-03-10 10:04:52] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2023-03-10 10:04:53] [INFO ] Deduced a trap composed of 163 places in 240 ms of which 1 ms to minimize.
[2023-03-10 10:04:53] [INFO ] Deduced a trap composed of 145 places in 343 ms of which 1 ms to minimize.
[2023-03-10 10:04:53] [INFO ] Deduced a trap composed of 135 places in 313 ms of which 1 ms to minimize.
[2023-03-10 10:04:54] [INFO ] Deduced a trap composed of 143 places in 327 ms of which 1 ms to minimize.
[2023-03-10 10:04:54] [INFO ] Deduced a trap composed of 170 places in 303 ms of which 1 ms to minimize.
[2023-03-10 10:04:54] [INFO ] Deduced a trap composed of 171 places in 193 ms of which 1 ms to minimize.
[2023-03-10 10:04:55] [INFO ] Deduced a trap composed of 118 places in 222 ms of which 1 ms to minimize.
[2023-03-10 10:04:55] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 1 ms to minimize.
[2023-03-10 10:04:55] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 0 ms to minimize.
[2023-03-10 10:04:55] [INFO ] Deduced a trap composed of 144 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:04:56] [INFO ] Deduced a trap composed of 176 places in 192 ms of which 1 ms to minimize.
[2023-03-10 10:04:56] [INFO ] Deduced a trap composed of 152 places in 190 ms of which 0 ms to minimize.
[2023-03-10 10:04:56] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 1 ms to minimize.
[2023-03-10 10:04:56] [INFO ] Deduced a trap composed of 166 places in 179 ms of which 0 ms to minimize.
[2023-03-10 10:04:56] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 1 ms to minimize.
[2023-03-10 10:04:57] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 0 ms to minimize.
[2023-03-10 10:04:57] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2023-03-10 10:04:57] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:04:57] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:04:57] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 1 ms to minimize.
[2023-03-10 10:04:58] [INFO ] Deduced a trap composed of 130 places in 174 ms of which 0 ms to minimize.
[2023-03-10 10:04:58] [INFO ] Deduced a trap composed of 125 places in 168 ms of which 1 ms to minimize.
[2023-03-10 10:04:58] [INFO ] Deduced a trap composed of 172 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:04:58] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 0 ms to minimize.
[2023-03-10 10:04:59] [INFO ] Deduced a trap composed of 138 places in 188 ms of which 1 ms to minimize.
[2023-03-10 10:04:59] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 1 ms to minimize.
[2023-03-10 10:04:59] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:04:59] [INFO ] Deduced a trap composed of 130 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:04:59] [INFO ] Deduced a trap composed of 118 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:05:00] [INFO ] Deduced a trap composed of 125 places in 194 ms of which 0 ms to minimize.
[2023-03-10 10:05:00] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 1 ms to minimize.
[2023-03-10 10:05:00] [INFO ] Deduced a trap composed of 135 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:05:00] [INFO ] Deduced a trap composed of 131 places in 184 ms of which 0 ms to minimize.
[2023-03-10 10:05:00] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:05:01] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 1 ms to minimize.
[2023-03-10 10:05:01] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 0 ms to minimize.
[2023-03-10 10:05:01] [INFO ] Deduced a trap composed of 136 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:05:01] [INFO ] Deduced a trap composed of 124 places in 188 ms of which 0 ms to minimize.
[2023-03-10 10:05:02] [INFO ] Deduced a trap composed of 154 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:05:02] [INFO ] Deduced a trap composed of 116 places in 188 ms of which 1 ms to minimize.
[2023-03-10 10:05:02] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 1 ms to minimize.
[2023-03-10 10:05:02] [INFO ] Deduced a trap composed of 136 places in 184 ms of which 0 ms to minimize.
[2023-03-10 10:05:02] [INFO ] Deduced a trap composed of 135 places in 188 ms of which 0 ms to minimize.
[2023-03-10 10:05:03] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:05:03] [INFO ] Deduced a trap composed of 138 places in 180 ms of which 1 ms to minimize.
[2023-03-10 10:05:03] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:05:03] [INFO ] Deduced a trap composed of 161 places in 179 ms of which 0 ms to minimize.
[2023-03-10 10:05:03] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 1 ms to minimize.
[2023-03-10 10:05:04] [INFO ] Deduced a trap composed of 154 places in 183 ms of which 0 ms to minimize.
[2023-03-10 10:05:04] [INFO ] Deduced a trap composed of 165 places in 177 ms of which 0 ms to minimize.
[2023-03-10 10:05:04] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 1 ms to minimize.
[2023-03-10 10:05:04] [INFO ] Deduced a trap composed of 149 places in 199 ms of which 0 ms to minimize.
[2023-03-10 10:05:04] [INFO ] Deduced a trap composed of 135 places in 185 ms of which 0 ms to minimize.
[2023-03-10 10:05:05] [INFO ] Deduced a trap composed of 134 places in 179 ms of which 1 ms to minimize.
[2023-03-10 10:05:05] [INFO ] Deduced a trap composed of 175 places in 173 ms of which 0 ms to minimize.
[2023-03-10 10:05:05] [INFO ] Deduced a trap composed of 186 places in 179 ms of which 1 ms to minimize.
[2023-03-10 10:05:05] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 0 ms to minimize.
[2023-03-10 10:05:06] [INFO ] Deduced a trap composed of 146 places in 162 ms of which 1 ms to minimize.
[2023-03-10 10:05:06] [INFO ] Deduced a trap composed of 144 places in 169 ms of which 1 ms to minimize.
[2023-03-10 10:05:06] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 0 ms to minimize.
[2023-03-10 10:05:06] [INFO ] Deduced a trap composed of 168 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:05:06] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:05:07] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 0 ms to minimize.
[2023-03-10 10:05:07] [INFO ] Deduced a trap composed of 123 places in 181 ms of which 0 ms to minimize.
[2023-03-10 10:05:07] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:05:07] [INFO ] Deduced a trap composed of 177 places in 179 ms of which 1 ms to minimize.
[2023-03-10 10:05:07] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 1 ms to minimize.
[2023-03-10 10:05:08] [INFO ] Deduced a trap composed of 154 places in 188 ms of which 0 ms to minimize.
[2023-03-10 10:05:08] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2023-03-10 10:05:08] [INFO ] Deduced a trap composed of 169 places in 249 ms of which 1 ms to minimize.
[2023-03-10 10:05:08] [INFO ] Deduced a trap composed of 170 places in 295 ms of which 1 ms to minimize.
[2023-03-10 10:05:09] [INFO ] Deduced a trap composed of 129 places in 214 ms of which 1 ms to minimize.
[2023-03-10 10:05:09] [INFO ] Deduced a trap composed of 163 places in 210 ms of which 1 ms to minimize.
[2023-03-10 10:05:09] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 2 ms to minimize.
[2023-03-10 10:05:10] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 1 ms to minimize.
[2023-03-10 10:05:10] [INFO ] Deduced a trap composed of 174 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:05:10] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:05:10] [INFO ] Deduced a trap composed of 177 places in 299 ms of which 1 ms to minimize.
[2023-03-10 10:05:11] [INFO ] Deduced a trap composed of 177 places in 340 ms of which 1 ms to minimize.
[2023-03-10 10:05:11] [INFO ] Deduced a trap composed of 157 places in 283 ms of which 1 ms to minimize.
[2023-03-10 10:05:12] [INFO ] Deduced a trap composed of 160 places in 322 ms of which 1 ms to minimize.
[2023-03-10 10:05:12] [INFO ] Deduced a trap composed of 179 places in 298 ms of which 1 ms to minimize.
[2023-03-10 10:05:12] [INFO ] Deduced a trap composed of 184 places in 289 ms of which 1 ms to minimize.
[2023-03-10 10:05:13] [INFO ] Deduced a trap composed of 197 places in 283 ms of which 1 ms to minimize.
[2023-03-10 10:05:13] [INFO ] Deduced a trap composed of 148 places in 295 ms of which 1 ms to minimize.
[2023-03-10 10:05:13] [INFO ] Deduced a trap composed of 133 places in 299 ms of which 1 ms to minimize.
[2023-03-10 10:05:14] [INFO ] Deduced a trap composed of 167 places in 294 ms of which 1 ms to minimize.
[2023-03-10 10:05:14] [INFO ] Deduced a trap composed of 136 places in 206 ms of which 1 ms to minimize.
[2023-03-10 10:05:14] [INFO ] Deduced a trap composed of 185 places in 309 ms of which 1 ms to minimize.
[2023-03-10 10:05:14] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 1 ms to minimize.
[2023-03-10 10:05:15] [INFO ] Deduced a trap composed of 173 places in 279 ms of which 1 ms to minimize.
[2023-03-10 10:05:15] [INFO ] Deduced a trap composed of 183 places in 208 ms of which 1 ms to minimize.
[2023-03-10 10:05:15] [INFO ] Deduced a trap composed of 166 places in 293 ms of which 1 ms to minimize.
[2023-03-10 10:05:16] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 1 ms to minimize.
[2023-03-10 10:05:16] [INFO ] Deduced a trap composed of 187 places in 298 ms of which 1 ms to minimize.
[2023-03-10 10:05:16] [INFO ] Deduced a trap composed of 177 places in 282 ms of which 1 ms to minimize.
[2023-03-10 10:05:17] [INFO ] Deduced a trap composed of 166 places in 293 ms of which 1 ms to minimize.
[2023-03-10 10:05:17] [INFO ] Deduced a trap composed of 137 places in 301 ms of which 1 ms to minimize.
[2023-03-10 10:05:17] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2023-03-10 10:05:17] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2023-03-10 10:05:18] [INFO ] Deduced a trap composed of 183 places in 277 ms of which 0 ms to minimize.
[2023-03-10 10:05:18] [INFO ] Deduced a trap composed of 175 places in 271 ms of which 1 ms to minimize.
[2023-03-10 10:05:18] [INFO ] Deduced a trap composed of 164 places in 293 ms of which 1 ms to minimize.
[2023-03-10 10:05:19] [INFO ] Deduced a trap composed of 149 places in 289 ms of which 0 ms to minimize.
[2023-03-10 10:05:19] [INFO ] Deduced a trap composed of 168 places in 292 ms of which 0 ms to minimize.
[2023-03-10 10:05:19] [INFO ] Deduced a trap composed of 182 places in 286 ms of which 0 ms to minimize.
[2023-03-10 10:05:20] [INFO ] Deduced a trap composed of 150 places in 272 ms of which 0 ms to minimize.
[2023-03-10 10:05:20] [INFO ] Deduced a trap composed of 133 places in 251 ms of which 1 ms to minimize.
[2023-03-10 10:05:20] [INFO ] Deduced a trap composed of 143 places in 188 ms of which 1 ms to minimize.
[2023-03-10 10:05:21] [INFO ] Deduced a trap composed of 157 places in 278 ms of which 1 ms to minimize.
[2023-03-10 10:05:21] [INFO ] Deduced a trap composed of 141 places in 269 ms of which 1 ms to minimize.
[2023-03-10 10:05:21] [INFO ] Deduced a trap composed of 182 places in 275 ms of which 0 ms to minimize.
[2023-03-10 10:05:21] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 30148 ms
[2023-03-10 10:05:23] [INFO ] Deduced a trap composed of 183 places in 231 ms of which 0 ms to minimize.
[2023-03-10 10:05:23] [INFO ] Deduced a trap composed of 122 places in 217 ms of which 1 ms to minimize.
[2023-03-10 10:05:24] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 0 ms to minimize.
[2023-03-10 10:05:24] [INFO ] Deduced a trap composed of 171 places in 317 ms of which 1 ms to minimize.
[2023-03-10 10:05:24] [INFO ] Deduced a trap composed of 161 places in 228 ms of which 1 ms to minimize.
[2023-03-10 10:05:25] [INFO ] Deduced a trap composed of 137 places in 282 ms of which 1 ms to minimize.
[2023-03-10 10:05:25] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 1 ms to minimize.
[2023-03-10 10:05:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2469 ms
[2023-03-10 10:05:26] [INFO ] Deduced a trap composed of 148 places in 315 ms of which 1 ms to minimize.
[2023-03-10 10:05:26] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 1 ms to minimize.
[2023-03-10 10:05:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 974 ms
[2023-03-10 10:05:27] [INFO ] Deduced a trap composed of 171 places in 317 ms of which 1 ms to minimize.
[2023-03-10 10:05:27] [INFO ] Deduced a trap composed of 134 places in 299 ms of which 1 ms to minimize.
[2023-03-10 10:05:28] [INFO ] Deduced a trap composed of 125 places in 306 ms of which 1 ms to minimize.
[2023-03-10 10:05:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1108 ms
[2023-03-10 10:05:31] [INFO ] Deduced a trap composed of 118 places in 195 ms of which 0 ms to minimize.
[2023-03-10 10:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-10 10:05:31] [INFO ] Deduced a trap composed of 51 places in 228 ms of which 1 ms to minimize.
[2023-03-10 10:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-10 10:05:32] [INFO ] Deduced a trap composed of 149 places in 303 ms of which 1 ms to minimize.
[2023-03-10 10:05:32] [INFO ] Deduced a trap composed of 143 places in 287 ms of which 1 ms to minimize.
[2023-03-10 10:05:33] [INFO ] Deduced a trap composed of 163 places in 301 ms of which 1 ms to minimize.
[2023-03-10 10:05:33] [INFO ] Deduced a trap composed of 119 places in 297 ms of which 1 ms to minimize.
[2023-03-10 10:05:33] [INFO ] Deduced a trap composed of 173 places in 288 ms of which 1 ms to minimize.
[2023-03-10 10:05:34] [INFO ] Deduced a trap composed of 165 places in 318 ms of which 1 ms to minimize.
[2023-03-10 10:05:34] [INFO ] Deduced a trap composed of 174 places in 342 ms of which 1 ms to minimize.
[2023-03-10 10:05:34] [INFO ] Deduced a trap composed of 127 places in 354 ms of which 1 ms to minimize.
[2023-03-10 10:05:35] [INFO ] Deduced a trap composed of 120 places in 335 ms of which 1 ms to minimize.
[2023-03-10 10:05:35] [INFO ] Deduced a trap composed of 114 places in 330 ms of which 1 ms to minimize.
[2023-03-10 10:05:36] [INFO ] Deduced a trap composed of 167 places in 285 ms of which 1 ms to minimize.
[2023-03-10 10:05:36] [INFO ] Deduced a trap composed of 121 places in 282 ms of which 1 ms to minimize.
[2023-03-10 10:05:36] [INFO ] Deduced a trap composed of 171 places in 283 ms of which 0 ms to minimize.
[2023-03-10 10:05:37] [INFO ] Deduced a trap composed of 188 places in 292 ms of which 1 ms to minimize.
[2023-03-10 10:05:37] [INFO ] Deduced a trap composed of 155 places in 296 ms of which 1 ms to minimize.
[2023-03-10 10:05:37] [INFO ] Deduced a trap composed of 176 places in 214 ms of which 1 ms to minimize.
[2023-03-10 10:05:38] [INFO ] Deduced a trap composed of 171 places in 322 ms of which 1 ms to minimize.
[2023-03-10 10:05:38] [INFO ] Deduced a trap composed of 116 places in 284 ms of which 1 ms to minimize.
[2023-03-10 10:05:38] [INFO ] Deduced a trap composed of 143 places in 273 ms of which 1 ms to minimize.
[2023-03-10 10:05:39] [INFO ] Deduced a trap composed of 136 places in 340 ms of which 1 ms to minimize.
[2023-03-10 10:05:39] [INFO ] Deduced a trap composed of 153 places in 293 ms of which 0 ms to minimize.
[2023-03-10 10:05:39] [INFO ] Deduced a trap composed of 145 places in 329 ms of which 0 ms to minimize.
[2023-03-10 10:05:40] [INFO ] Deduced a trap composed of 173 places in 315 ms of which 1 ms to minimize.
[2023-03-10 10:05:40] [INFO ] Deduced a trap composed of 117 places in 334 ms of which 1 ms to minimize.
[2023-03-10 10:05:41] [INFO ] Deduced a trap composed of 180 places in 315 ms of which 1 ms to minimize.
[2023-03-10 10:05:41] [INFO ] Deduced a trap composed of 174 places in 216 ms of which 1 ms to minimize.
[2023-03-10 10:05:41] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 1 ms to minimize.
[2023-03-10 10:05:41] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:05:42] [INFO ] Deduced a trap composed of 165 places in 317 ms of which 1 ms to minimize.
[2023-03-10 10:05:42] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 10125 ms
[2023-03-10 10:05:43] [INFO ] Deduced a trap composed of 52 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:05:43] [INFO ] Deduced a trap composed of 114 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:05:43] [INFO ] Deduced a trap composed of 118 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:05:43] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 1 ms to minimize.
[2023-03-10 10:05:43] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 0 ms to minimize.
[2023-03-10 10:05:44] [INFO ] Deduced a trap composed of 124 places in 161 ms of which 1 ms to minimize.
[2023-03-10 10:05:44] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 1 ms to minimize.
[2023-03-10 10:05:44] [INFO ] Deduced a trap composed of 121 places in 156 ms of which 1 ms to minimize.
[2023-03-10 10:05:44] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 0 ms to minimize.
[2023-03-10 10:05:44] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 0 ms to minimize.
[2023-03-10 10:05:45] [INFO ] Deduced a trap composed of 128 places in 168 ms of which 1 ms to minimize.
[2023-03-10 10:05:45] [INFO ] Deduced a trap composed of 121 places in 159 ms of which 1 ms to minimize.
[2023-03-10 10:05:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2590 ms
[2023-03-10 10:05:50] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 1 ms to minimize.
[2023-03-10 10:05:50] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 0 ms to minimize.
[2023-03-10 10:05:51] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 0 ms to minimize.
[2023-03-10 10:05:51] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 0 ms to minimize.
[2023-03-10 10:05:51] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 1 ms to minimize.
[2023-03-10 10:05:51] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 0 ms to minimize.
[2023-03-10 10:05:51] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 0 ms to minimize.
[2023-03-10 10:05:51] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 0 ms to minimize.
[2023-03-10 10:05:51] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 1 ms to minimize.
[2023-03-10 10:05:52] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2023-03-10 10:05:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1562 ms
[2023-03-10 10:05:52] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 1 ms to minimize.
[2023-03-10 10:05:52] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 0 ms to minimize.
[2023-03-10 10:05:52] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 1 ms to minimize.
[2023-03-10 10:05:52] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 1 ms to minimize.
[2023-03-10 10:05:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 692 ms
[2023-03-10 10:05:57] [INFO ] Deduced a trap composed of 89 places in 177 ms of which 1 ms to minimize.
[2023-03-10 10:05:57] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 1 ms to minimize.
[2023-03-10 10:05:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2023-03-10 10:05:57] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 1 ms to minimize.
[2023-03-10 10:05:57] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 0 ms to minimize.
[2023-03-10 10:05:57] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 0 ms to minimize.
[2023-03-10 10:05:58] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 1 ms to minimize.
[2023-03-10 10:05:58] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 1 ms to minimize.
[2023-03-10 10:05:58] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 1 ms to minimize.
[2023-03-10 10:05:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1112 ms
[2023-03-10 10:06:00] [INFO ] Deduced a trap composed of 119 places in 103 ms of which 1 ms to minimize.
[2023-03-10 10:06:00] [INFO ] Deduced a trap composed of 117 places in 103 ms of which 0 ms to minimize.
[2023-03-10 10:06:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 10:06:00] [INFO ] After 100020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:335
Interrupted random walk after 466330 steps, including 67071 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 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 931 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 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 905 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 894 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 892 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 926 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 887 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 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 912 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 335) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 608 ms. (steps per millisecond=16 ) properties (out of 335) seen :0
Interrupted probabilistic random walk after 3866656 steps, run timeout after 150001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 3866656 steps, saw 1933147 distinct states, run finished after 150001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:09:20] [INFO ] Computed 48 place invariants in 22 ms
[2023-03-10 10:09:25] [INFO ] After 5065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-10 10:09:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 18 ms returned sat
[2023-03-10 10:09:29] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-10 10:09:43] [INFO ] After 9985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-10 10:09:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:09:52] [INFO ] After 8284ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-10 10:09:53] [INFO ] Deduced a trap composed of 150 places in 200 ms of which 1 ms to minimize.
[2023-03-10 10:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2023-03-10 10:09:53] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:09:53] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 1 ms to minimize.
[2023-03-10 10:09:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 465 ms
[2023-03-10 10:09:54] [INFO ] Deduced a trap composed of 164 places in 246 ms of which 1 ms to minimize.
[2023-03-10 10:09:54] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 0 ms to minimize.
[2023-03-10 10:09:54] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 1 ms to minimize.
[2023-03-10 10:09:54] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 1 ms to minimize.
[2023-03-10 10:09:55] [INFO ] Deduced a trap composed of 163 places in 268 ms of which 1 ms to minimize.
[2023-03-10 10:09:55] [INFO ] Deduced a trap composed of 145 places in 273 ms of which 1 ms to minimize.
[2023-03-10 10:09:55] [INFO ] Deduced a trap composed of 135 places in 262 ms of which 1 ms to minimize.
[2023-03-10 10:09:56] [INFO ] Deduced a trap composed of 143 places in 187 ms of which 0 ms to minimize.
[2023-03-10 10:09:56] [INFO ] Deduced a trap composed of 170 places in 268 ms of which 0 ms to minimize.
[2023-03-10 10:09:56] [INFO ] Deduced a trap composed of 171 places in 273 ms of which 1 ms to minimize.
[2023-03-10 10:09:56] [INFO ] Deduced a trap composed of 118 places in 270 ms of which 0 ms to minimize.
[2023-03-10 10:09:57] [INFO ] Deduced a trap composed of 143 places in 301 ms of which 1 ms to minimize.
[2023-03-10 10:09:57] [INFO ] Deduced a trap composed of 156 places in 307 ms of which 1 ms to minimize.
[2023-03-10 10:09:57] [INFO ] Deduced a trap composed of 144 places in 261 ms of which 0 ms to minimize.
[2023-03-10 10:09:58] [INFO ] Deduced a trap composed of 176 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:09:58] [INFO ] Deduced a trap composed of 152 places in 256 ms of which 1 ms to minimize.
[2023-03-10 10:09:58] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 1 ms to minimize.
[2023-03-10 10:09:59] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 1 ms to minimize.
[2023-03-10 10:09:59] [INFO ] Deduced a trap composed of 163 places in 322 ms of which 1 ms to minimize.
[2023-03-10 10:09:59] [INFO ] Deduced a trap composed of 136 places in 298 ms of which 0 ms to minimize.
[2023-03-10 10:10:00] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-10 10:10:00] [INFO ] Deduced a trap composed of 146 places in 308 ms of which 1 ms to minimize.
[2023-03-10 10:10:00] [INFO ] Deduced a trap composed of 152 places in 336 ms of which 1 ms to minimize.
[2023-03-10 10:10:01] [INFO ] Deduced a trap composed of 134 places in 210 ms of which 1 ms to minimize.
[2023-03-10 10:10:01] [INFO ] Deduced a trap composed of 130 places in 320 ms of which 2 ms to minimize.
[2023-03-10 10:10:01] [INFO ] Deduced a trap composed of 125 places in 324 ms of which 1 ms to minimize.
[2023-03-10 10:10:02] [INFO ] Deduced a trap composed of 172 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:10:02] [INFO ] Deduced a trap composed of 170 places in 268 ms of which 1 ms to minimize.
[2023-03-10 10:10:02] [INFO ] Deduced a trap composed of 138 places in 265 ms of which 0 ms to minimize.
[2023-03-10 10:10:02] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 1 ms to minimize.
[2023-03-10 10:10:03] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 0 ms to minimize.
[2023-03-10 10:10:03] [INFO ] Deduced a trap composed of 130 places in 260 ms of which 1 ms to minimize.
[2023-03-10 10:10:03] [INFO ] Deduced a trap composed of 118 places in 263 ms of which 1 ms to minimize.
[2023-03-10 10:10:03] [INFO ] Deduced a trap composed of 125 places in 265 ms of which 1 ms to minimize.
[2023-03-10 10:10:04] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 1 ms to minimize.
[2023-03-10 10:10:04] [INFO ] Deduced a trap composed of 135 places in 262 ms of which 1 ms to minimize.
[2023-03-10 10:10:04] [INFO ] Deduced a trap composed of 131 places in 269 ms of which 1 ms to minimize.
[2023-03-10 10:10:05] [INFO ] Deduced a trap composed of 166 places in 264 ms of which 1 ms to minimize.
[2023-03-10 10:10:05] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 1 ms to minimize.
[2023-03-10 10:10:05] [INFO ] Deduced a trap composed of 168 places in 271 ms of which 1 ms to minimize.
[2023-03-10 10:10:05] [INFO ] Deduced a trap composed of 136 places in 276 ms of which 1 ms to minimize.
[2023-03-10 10:10:06] [INFO ] Deduced a trap composed of 124 places in 273 ms of which 0 ms to minimize.
[2023-03-10 10:10:06] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 1 ms to minimize.
[2023-03-10 10:10:06] [INFO ] Deduced a trap composed of 116 places in 314 ms of which 1 ms to minimize.
[2023-03-10 10:10:07] [INFO ] Deduced a trap composed of 165 places in 200 ms of which 1 ms to minimize.
[2023-03-10 10:10:07] [INFO ] Deduced a trap composed of 136 places in 199 ms of which 1 ms to minimize.
[2023-03-10 10:10:07] [INFO ] Deduced a trap composed of 135 places in 198 ms of which 1 ms to minimize.
[2023-03-10 10:10:07] [INFO ] Deduced a trap composed of 135 places in 200 ms of which 0 ms to minimize.
[2023-03-10 10:10:07] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:10:08] [INFO ] Deduced a trap composed of 135 places in 200 ms of which 1 ms to minimize.
[2023-03-10 10:10:08] [INFO ] Deduced a trap composed of 161 places in 243 ms of which 1 ms to minimize.
[2023-03-10 10:10:08] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 1 ms to minimize.
[2023-03-10 10:10:08] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:10:09] [INFO ] Deduced a trap composed of 165 places in 255 ms of which 0 ms to minimize.
[2023-03-10 10:10:09] [INFO ] Deduced a trap composed of 130 places in 170 ms of which 0 ms to minimize.
[2023-03-10 10:10:09] [INFO ] Deduced a trap composed of 149 places in 203 ms of which 1 ms to minimize.
[2023-03-10 10:10:10] [INFO ] Deduced a trap composed of 135 places in 260 ms of which 1 ms to minimize.
[2023-03-10 10:10:10] [INFO ] Deduced a trap composed of 134 places in 258 ms of which 1 ms to minimize.
[2023-03-10 10:10:10] [INFO ] Deduced a trap composed of 175 places in 253 ms of which 1 ms to minimize.
[2023-03-10 10:10:10] [INFO ] Deduced a trap composed of 186 places in 195 ms of which 1 ms to minimize.
[2023-03-10 10:10:11] [INFO ] Deduced a trap composed of 147 places in 256 ms of which 1 ms to minimize.
[2023-03-10 10:10:11] [INFO ] Deduced a trap composed of 146 places in 252 ms of which 1 ms to minimize.
[2023-03-10 10:10:11] [INFO ] Deduced a trap composed of 144 places in 251 ms of which 1 ms to minimize.
[2023-03-10 10:10:11] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2023-03-10 10:10:12] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 1 ms to minimize.
[2023-03-10 10:10:12] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 0 ms to minimize.
[2023-03-10 10:10:12] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 1 ms to minimize.
[2023-03-10 10:10:12] [INFO ] Deduced a trap composed of 123 places in 268 ms of which 0 ms to minimize.
[2023-03-10 10:10:13] [INFO ] Deduced a trap composed of 161 places in 275 ms of which 1 ms to minimize.
[2023-03-10 10:10:13] [INFO ] Deduced a trap composed of 177 places in 300 ms of which 1 ms to minimize.
[2023-03-10 10:10:13] [INFO ] Deduced a trap composed of 161 places in 281 ms of which 0 ms to minimize.
[2023-03-10 10:10:14] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 1 ms to minimize.
[2023-03-10 10:10:14] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2023-03-10 10:10:14] [INFO ] Deduced a trap composed of 169 places in 166 ms of which 0 ms to minimize.
[2023-03-10 10:10:14] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2023-03-10 10:10:15] [INFO ] Deduced a trap composed of 129 places in 180 ms of which 1 ms to minimize.
[2023-03-10 10:10:15] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 0 ms to minimize.
[2023-03-10 10:10:15] [INFO ] Deduced a trap composed of 152 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:10:15] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 0 ms to minimize.
[2023-03-10 10:10:15] [INFO ] Deduced a trap composed of 174 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:10:16] [INFO ] Deduced a trap composed of 176 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:10:16] [INFO ] Deduced a trap composed of 177 places in 189 ms of which 1 ms to minimize.
[2023-03-10 10:10:16] [INFO ] Deduced a trap composed of 177 places in 182 ms of which 0 ms to minimize.
[2023-03-10 10:10:16] [INFO ] Deduced a trap composed of 157 places in 204 ms of which 1 ms to minimize.
[2023-03-10 10:10:17] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:10:17] [INFO ] Deduced a trap composed of 179 places in 173 ms of which 2 ms to minimize.
[2023-03-10 10:10:17] [INFO ] Deduced a trap composed of 184 places in 177 ms of which 1 ms to minimize.
[2023-03-10 10:10:17] [INFO ] Deduced a trap composed of 197 places in 184 ms of which 0 ms to minimize.
[2023-03-10 10:10:17] [INFO ] Deduced a trap composed of 148 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:10:18] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:10:18] [INFO ] Deduced a trap composed of 167 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:10:18] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 1 ms to minimize.
[2023-03-10 10:10:18] [INFO ] Deduced a trap composed of 185 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:10:19] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 0 ms to minimize.
[2023-03-10 10:10:19] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:10:19] [INFO ] Deduced a trap composed of 183 places in 216 ms of which 1 ms to minimize.
[2023-03-10 10:10:19] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 1 ms to minimize.
[2023-03-10 10:10:19] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2023-03-10 10:10:20] [INFO ] Deduced a trap composed of 187 places in 192 ms of which 0 ms to minimize.
[2023-03-10 10:10:20] [INFO ] Deduced a trap composed of 177 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:10:20] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 0 ms to minimize.
[2023-03-10 10:10:20] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 0 ms to minimize.
[2023-03-10 10:10:20] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 1 ms to minimize.
[2023-03-10 10:10:21] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-10 10:10:21] [INFO ] Deduced a trap composed of 183 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:10:21] [INFO ] Deduced a trap composed of 175 places in 168 ms of which 1 ms to minimize.
[2023-03-10 10:10:21] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 1 ms to minimize.
[2023-03-10 10:10:21] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 1 ms to minimize.
[2023-03-10 10:10:22] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 0 ms to minimize.
[2023-03-10 10:10:22] [INFO ] Deduced a trap composed of 182 places in 165 ms of which 1 ms to minimize.
[2023-03-10 10:10:22] [INFO ] Deduced a trap composed of 150 places in 170 ms of which 1 ms to minimize.
[2023-03-10 10:10:22] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 0 ms to minimize.
[2023-03-10 10:10:22] [INFO ] Deduced a trap composed of 143 places in 180 ms of which 2 ms to minimize.
[2023-03-10 10:10:23] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 0 ms to minimize.
[2023-03-10 10:10:23] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:10:23] [INFO ] Deduced a trap composed of 182 places in 169 ms of which 1 ms to minimize.
[2023-03-10 10:10:23] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 29848 ms
[2023-03-10 10:10:24] [INFO ] Deduced a trap composed of 183 places in 167 ms of which 0 ms to minimize.
[2023-03-10 10:10:24] [INFO ] Deduced a trap composed of 122 places in 219 ms of which 1 ms to minimize.
[2023-03-10 10:10:25] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 1 ms to minimize.
[2023-03-10 10:10:25] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 1 ms to minimize.
[2023-03-10 10:10:25] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 1 ms to minimize.
[2023-03-10 10:10:25] [INFO ] Deduced a trap composed of 137 places in 199 ms of which 1 ms to minimize.
[2023-03-10 10:10:26] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-10 10:10:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1775 ms
[2023-03-10 10:10:26] [INFO ] Deduced a trap composed of 148 places in 195 ms of which 1 ms to minimize.
[2023-03-10 10:10:26] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 1 ms to minimize.
[2023-03-10 10:10:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 640 ms
[2023-03-10 10:10:27] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 0 ms to minimize.
[2023-03-10 10:10:27] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 1 ms to minimize.
[2023-03-10 10:10:27] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 0 ms to minimize.
[2023-03-10 10:10:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 665 ms
[2023-03-10 10:10:31] [INFO ] Deduced a trap composed of 118 places in 205 ms of which 1 ms to minimize.
[2023-03-10 10:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-10 10:10:31] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 1 ms to minimize.
[2023-03-10 10:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-10 10:10:32] [INFO ] Deduced a trap composed of 149 places in 334 ms of which 1 ms to minimize.
[2023-03-10 10:10:32] [INFO ] Deduced a trap composed of 143 places in 204 ms of which 0 ms to minimize.
[2023-03-10 10:10:32] [INFO ] Deduced a trap composed of 163 places in 198 ms of which 1 ms to minimize.
[2023-03-10 10:10:33] [INFO ] Deduced a trap composed of 119 places in 208 ms of which 1 ms to minimize.
[2023-03-10 10:10:33] [INFO ] Deduced a trap composed of 173 places in 201 ms of which 1 ms to minimize.
[2023-03-10 10:10:33] [INFO ] Deduced a trap composed of 165 places in 290 ms of which 1 ms to minimize.
[2023-03-10 10:10:34] [INFO ] Deduced a trap composed of 174 places in 259 ms of which 1 ms to minimize.
[2023-03-10 10:10:34] [INFO ] Deduced a trap composed of 127 places in 274 ms of which 1 ms to minimize.
[2023-03-10 10:10:34] [INFO ] Deduced a trap composed of 120 places in 318 ms of which 1 ms to minimize.
[2023-03-10 10:10:35] [INFO ] Deduced a trap composed of 114 places in 315 ms of which 1 ms to minimize.
[2023-03-10 10:10:35] [INFO ] Deduced a trap composed of 167 places in 314 ms of which 1 ms to minimize.
[2023-03-10 10:10:36] [INFO ] Deduced a trap composed of 121 places in 294 ms of which 1 ms to minimize.
[2023-03-10 10:10:36] [INFO ] Deduced a trap composed of 171 places in 314 ms of which 1 ms to minimize.
[2023-03-10 10:10:36] [INFO ] Deduced a trap composed of 188 places in 266 ms of which 1 ms to minimize.
[2023-03-10 10:10:37] [INFO ] Deduced a trap composed of 155 places in 292 ms of which 1 ms to minimize.
[2023-03-10 10:10:37] [INFO ] Deduced a trap composed of 176 places in 307 ms of which 1 ms to minimize.
[2023-03-10 10:10:37] [INFO ] Deduced a trap composed of 171 places in 293 ms of which 1 ms to minimize.
[2023-03-10 10:10:38] [INFO ] Deduced a trap composed of 116 places in 306 ms of which 1 ms to minimize.
[2023-03-10 10:10:38] [INFO ] Deduced a trap composed of 143 places in 325 ms of which 1 ms to minimize.
[2023-03-10 10:10:38] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:10:38] [INFO ] Deduced a trap composed of 153 places in 202 ms of which 0 ms to minimize.
[2023-03-10 10:10:39] [INFO ] Deduced a trap composed of 145 places in 323 ms of which 1 ms to minimize.
[2023-03-10 10:10:39] [INFO ] Deduced a trap composed of 173 places in 207 ms of which 1 ms to minimize.
[2023-03-10 10:10:39] [INFO ] Deduced a trap composed of 117 places in 326 ms of which 1 ms to minimize.
[2023-03-10 10:10:40] [INFO ] Deduced a trap composed of 180 places in 291 ms of which 1 ms to minimize.
[2023-03-10 10:10:40] [INFO ] Deduced a trap composed of 174 places in 327 ms of which 1 ms to minimize.
[2023-03-10 10:10:41] [INFO ] Deduced a trap composed of 170 places in 244 ms of which 1 ms to minimize.
[2023-03-10 10:10:41] [INFO ] Deduced a trap composed of 117 places in 328 ms of which 1 ms to minimize.
[2023-03-10 10:10:41] [INFO ] Deduced a trap composed of 165 places in 329 ms of which 1 ms to minimize.
[2023-03-10 10:10:41] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 9777 ms
[2023-03-10 10:10:42] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 1 ms to minimize.
[2023-03-10 10:10:42] [INFO ] Deduced a trap composed of 114 places in 213 ms of which 1 ms to minimize.
[2023-03-10 10:10:43] [INFO ] Deduced a trap composed of 118 places in 193 ms of which 1 ms to minimize.
[2023-03-10 10:10:43] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 1 ms to minimize.
[2023-03-10 10:10:43] [INFO ] Deduced a trap composed of 115 places in 191 ms of which 1 ms to minimize.
[2023-03-10 10:10:43] [INFO ] Deduced a trap composed of 124 places in 167 ms of which 1 ms to minimize.
[2023-03-10 10:10:43] [INFO ] Deduced a trap composed of 129 places in 163 ms of which 1 ms to minimize.
[2023-03-10 10:10:44] [INFO ] Deduced a trap composed of 121 places in 111 ms of which 1 ms to minimize.
[2023-03-10 10:10:44] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 0 ms to minimize.
[2023-03-10 10:10:44] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2023-03-10 10:10:44] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 1 ms to minimize.
[2023-03-10 10:10:44] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 1 ms to minimize.
[2023-03-10 10:10:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2524 ms
[2023-03-10 10:10:51] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:10:51] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 1 ms to minimize.
[2023-03-10 10:10:52] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 1 ms to minimize.
[2023-03-10 10:10:52] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 1 ms to minimize.
[2023-03-10 10:10:52] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 1 ms to minimize.
[2023-03-10 10:10:52] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 1 ms to minimize.
[2023-03-10 10:10:53] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 1 ms to minimize.
[2023-03-10 10:10:53] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 1 ms to minimize.
[2023-03-10 10:10:53] [INFO ] Deduced a trap composed of 104 places in 163 ms of which 1 ms to minimize.
[2023-03-10 10:10:53] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 1 ms to minimize.
[2023-03-10 10:10:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2129 ms
[2023-03-10 10:10:54] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 1 ms to minimize.
[2023-03-10 10:10:54] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 1 ms to minimize.
[2023-03-10 10:10:54] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 0 ms to minimize.
[2023-03-10 10:10:54] [INFO ] Deduced a trap composed of 110 places in 164 ms of which 0 ms to minimize.
[2023-03-10 10:10:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 934 ms
[2023-03-10 10:11:00] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 0 ms to minimize.
[2023-03-10 10:11:00] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 1 ms to minimize.
[2023-03-10 10:11:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2023-03-10 10:11:00] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 0 ms to minimize.
[2023-03-10 10:11:00] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 0 ms to minimize.
[2023-03-10 10:11:01] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 0 ms to minimize.
[2023-03-10 10:11:01] [INFO ] Deduced a trap composed of 112 places in 150 ms of which 1 ms to minimize.
[2023-03-10 10:11:01] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 1 ms to minimize.
[2023-03-10 10:11:01] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 0 ms to minimize.
[2023-03-10 10:11:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1229 ms
[2023-03-10 10:11:03] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 1 ms to minimize.
[2023-03-10 10:11:03] [INFO ] Deduced a trap composed of 117 places in 176 ms of which 0 ms to minimize.
[2023-03-10 10:11:04] [INFO ] Deduced a trap composed of 119 places in 172 ms of which 1 ms to minimize.
[2023-03-10 10:11:04] [INFO ] Deduced a trap composed of 122 places in 165 ms of which 1 ms to minimize.
[2023-03-10 10:11:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 921 ms
[2023-03-10 10:11:04] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 0 ms to minimize.
[2023-03-10 10:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-10 10:11:08] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 0 ms to minimize.
[2023-03-10 10:11:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-10 10:11:08] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 1 ms to minimize.
[2023-03-10 10:11:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-10 10:11:12] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 0 ms to minimize.
[2023-03-10 10:11:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-03-10 10:11:15] [INFO ] After 91656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 20767 ms.
[2023-03-10 10:11:36] [INFO ] After 130559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Fused 335 Parikh solutions to 309 different solutions.
Parikh walk visited 0 properties in 30474 ms.
Support contains 335 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Applied a total of 0 rules in 13 ms. Remains 419 /419 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Starting structural reductions in SAFETY 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.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:12:06] [INFO ] Computed 48 place invariants in 22 ms
[2023-03-10 10:12:07] [INFO ] Implicit Places using invariants in 339 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:12:07] [INFO ] Computed 48 place invariants in 23 ms
[2023-03-10 10:12:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:12:08] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2023-03-10 10:12:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:12:08] [INFO ] Computed 48 place invariants in 20 ms
[2023-03-10 10:12:09] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 396/396 transitions.
Incomplete random walk after 100000 steps, including 14592 resets, run finished after 7469 ms. (steps per millisecond=13 ) properties (out of 335) seen :0
Running SMT prover for 335 properties.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:12:16] [INFO ] Computed 48 place invariants in 21 ms
[2023-03-10 10:12:20] [INFO ] After 4199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:335
[2023-03-10 10:12:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2023-03-10 10:12:23] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 17 ms returned sat
[2023-03-10 10:12:36] [INFO ] After 9078ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :335
[2023-03-10 10:12:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:12:46] [INFO ] After 10607ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :335
[2023-03-10 10:12:48] [INFO ] Deduced a trap composed of 150 places in 390 ms of which 2 ms to minimize.
[2023-03-10 10:12:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 464 ms
[2023-03-10 10:12:48] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 1 ms to minimize.
[2023-03-10 10:12:49] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 1 ms to minimize.
[2023-03-10 10:12:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 585 ms
[2023-03-10 10:12:49] [INFO ] Deduced a trap composed of 164 places in 331 ms of which 1 ms to minimize.
[2023-03-10 10:12:49] [INFO ] Deduced a trap composed of 18 places in 324 ms of which 1 ms to minimize.
[2023-03-10 10:12:50] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-10 10:12:50] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 1 ms to minimize.
[2023-03-10 10:12:51] [INFO ] Deduced a trap composed of 163 places in 316 ms of which 0 ms to minimize.
[2023-03-10 10:12:51] [INFO ] Deduced a trap composed of 145 places in 234 ms of which 1 ms to minimize.
[2023-03-10 10:12:51] [INFO ] Deduced a trap composed of 135 places in 315 ms of which 1 ms to minimize.
[2023-03-10 10:12:51] [INFO ] Deduced a trap composed of 143 places in 310 ms of which 1 ms to minimize.
[2023-03-10 10:12:52] [INFO ] Deduced a trap composed of 170 places in 228 ms of which 2 ms to minimize.
[2023-03-10 10:12:52] [INFO ] Deduced a trap composed of 171 places in 304 ms of which 1 ms to minimize.
[2023-03-10 10:12:52] [INFO ] Deduced a trap composed of 118 places in 298 ms of which 1 ms to minimize.
[2023-03-10 10:12:53] [INFO ] Deduced a trap composed of 143 places in 225 ms of which 1 ms to minimize.
[2023-03-10 10:12:53] [INFO ] Deduced a trap composed of 156 places in 316 ms of which 1 ms to minimize.
[2023-03-10 10:12:53] [INFO ] Deduced a trap composed of 144 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:12:54] [INFO ] Deduced a trap composed of 176 places in 312 ms of which 1 ms to minimize.
[2023-03-10 10:12:54] [INFO ] Deduced a trap composed of 152 places in 323 ms of which 1 ms to minimize.
[2023-03-10 10:12:55] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 0 ms to minimize.
[2023-03-10 10:12:55] [INFO ] Deduced a trap composed of 166 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:12:55] [INFO ] Deduced a trap composed of 163 places in 308 ms of which 1 ms to minimize.
[2023-03-10 10:12:56] [INFO ] Deduced a trap composed of 136 places in 291 ms of which 1 ms to minimize.
[2023-03-10 10:12:56] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2023-03-10 10:12:56] [INFO ] Deduced a trap composed of 146 places in 302 ms of which 0 ms to minimize.
[2023-03-10 10:12:57] [INFO ] Deduced a trap composed of 152 places in 315 ms of which 1 ms to minimize.
[2023-03-10 10:12:57] [INFO ] Deduced a trap composed of 134 places in 309 ms of which 1 ms to minimize.
[2023-03-10 10:12:57] [INFO ] Deduced a trap composed of 130 places in 302 ms of which 1 ms to minimize.
[2023-03-10 10:12:58] [INFO ] Deduced a trap composed of 125 places in 301 ms of which 1 ms to minimize.
[2023-03-10 10:12:58] [INFO ] Deduced a trap composed of 172 places in 277 ms of which 1 ms to minimize.
[2023-03-10 10:12:58] [INFO ] Deduced a trap composed of 170 places in 301 ms of which 1 ms to minimize.
[2023-03-10 10:12:58] [INFO ] Deduced a trap composed of 138 places in 302 ms of which 1 ms to minimize.
[2023-03-10 10:12:59] [INFO ] Deduced a trap composed of 136 places in 231 ms of which 1 ms to minimize.
[2023-03-10 10:12:59] [INFO ] Deduced a trap composed of 156 places in 305 ms of which 1 ms to minimize.
[2023-03-10 10:12:59] [INFO ] Deduced a trap composed of 130 places in 308 ms of which 1 ms to minimize.
[2023-03-10 10:13:00] [INFO ] Deduced a trap composed of 118 places in 214 ms of which 1 ms to minimize.
[2023-03-10 10:13:00] [INFO ] Deduced a trap composed of 125 places in 226 ms of which 1 ms to minimize.
[2023-03-10 10:13:00] [INFO ] Deduced a trap composed of 131 places in 305 ms of which 1 ms to minimize.
[2023-03-10 10:13:01] [INFO ] Deduced a trap composed of 135 places in 258 ms of which 0 ms to minimize.
[2023-03-10 10:13:01] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:13:01] [INFO ] Deduced a trap composed of 166 places in 308 ms of which 1 ms to minimize.
[2023-03-10 10:13:01] [INFO ] Deduced a trap composed of 125 places in 321 ms of which 1 ms to minimize.
[2023-03-10 10:13:02] [INFO ] Deduced a trap composed of 168 places in 231 ms of which 1 ms to minimize.
[2023-03-10 10:13:02] [INFO ] Deduced a trap composed of 136 places in 299 ms of which 1 ms to minimize.
[2023-03-10 10:13:02] [INFO ] Deduced a trap composed of 124 places in 308 ms of which 1 ms to minimize.
[2023-03-10 10:13:03] [INFO ] Deduced a trap composed of 154 places in 244 ms of which 0 ms to minimize.
[2023-03-10 10:13:03] [INFO ] Deduced a trap composed of 116 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:13:03] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 1 ms to minimize.
[2023-03-10 10:13:03] [INFO ] Deduced a trap composed of 136 places in 205 ms of which 1 ms to minimize.
[2023-03-10 10:13:04] [INFO ] Deduced a trap composed of 135 places in 217 ms of which 1 ms to minimize.
[2023-03-10 10:13:04] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 1 ms to minimize.
[2023-03-10 10:13:04] [INFO ] Deduced a trap composed of 138 places in 290 ms of which 1 ms to minimize.
[2023-03-10 10:13:05] [INFO ] Deduced a trap composed of 135 places in 258 ms of which 1 ms to minimize.
[2023-03-10 10:13:05] [INFO ] Deduced a trap composed of 161 places in 314 ms of which 1 ms to minimize.
[2023-03-10 10:13:05] [INFO ] Deduced a trap composed of 132 places in 311 ms of which 1 ms to minimize.
[2023-03-10 10:13:06] [INFO ] Deduced a trap composed of 154 places in 214 ms of which 1 ms to minimize.
[2023-03-10 10:13:06] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 1 ms to minimize.
[2023-03-10 10:13:06] [INFO ] Deduced a trap composed of 130 places in 292 ms of which 1 ms to minimize.
[2023-03-10 10:13:06] [INFO ] Deduced a trap composed of 149 places in 221 ms of which 1 ms to minimize.
[2023-03-10 10:13:07] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 1 ms to minimize.
[2023-03-10 10:13:07] [INFO ] Deduced a trap composed of 134 places in 297 ms of which 1 ms to minimize.
[2023-03-10 10:13:07] [INFO ] Deduced a trap composed of 175 places in 295 ms of which 1 ms to minimize.
[2023-03-10 10:13:08] [INFO ] Deduced a trap composed of 186 places in 263 ms of which 1 ms to minimize.
[2023-03-10 10:13:08] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 1 ms to minimize.
[2023-03-10 10:13:08] [INFO ] Deduced a trap composed of 146 places in 255 ms of which 1 ms to minimize.
[2023-03-10 10:13:08] [INFO ] Deduced a trap composed of 144 places in 256 ms of which 1 ms to minimize.
[2023-03-10 10:13:09] [INFO ] Deduced a trap composed of 166 places in 274 ms of which 1 ms to minimize.
[2023-03-10 10:13:09] [INFO ] Deduced a trap composed of 168 places in 274 ms of which 1 ms to minimize.
[2023-03-10 10:13:09] [INFO ] Deduced a trap composed of 163 places in 272 ms of which 0 ms to minimize.
[2023-03-10 10:13:10] [INFO ] Deduced a trap composed of 164 places in 263 ms of which 1 ms to minimize.
[2023-03-10 10:13:10] [INFO ] Deduced a trap composed of 123 places in 267 ms of which 1 ms to minimize.
[2023-03-10 10:13:10] [INFO ] Deduced a trap composed of 161 places in 265 ms of which 1 ms to minimize.
[2023-03-10 10:13:10] [INFO ] Deduced a trap composed of 177 places in 268 ms of which 0 ms to minimize.
[2023-03-10 10:13:11] [INFO ] Deduced a trap composed of 161 places in 263 ms of which 1 ms to minimize.
[2023-03-10 10:13:11] [INFO ] Deduced a trap composed of 154 places in 303 ms of which 1 ms to minimize.
[2023-03-10 10:13:11] [INFO ] Deduced a trap composed of 164 places in 309 ms of which 1 ms to minimize.
[2023-03-10 10:13:12] [INFO ] Deduced a trap composed of 169 places in 318 ms of which 1 ms to minimize.
[2023-03-10 10:13:12] [INFO ] Deduced a trap composed of 170 places in 235 ms of which 1 ms to minimize.
[2023-03-10 10:13:12] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 0 ms to minimize.
[2023-03-10 10:13:13] [INFO ] Deduced a trap composed of 163 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:13:13] [INFO ] Deduced a trap composed of 152 places in 173 ms of which 0 ms to minimize.
[2023-03-10 10:13:13] [INFO ] Deduced a trap composed of 165 places in 166 ms of which 0 ms to minimize.
[2023-03-10 10:13:13] [INFO ] Deduced a trap composed of 174 places in 174 ms of which 1 ms to minimize.
[2023-03-10 10:13:13] [INFO ] Deduced a trap composed of 176 places in 168 ms of which 0 ms to minimize.
[2023-03-10 10:13:14] [INFO ] Deduced a trap composed of 177 places in 247 ms of which 1 ms to minimize.
[2023-03-10 10:13:14] [INFO ] Deduced a trap composed of 177 places in 155 ms of which 0 ms to minimize.
[2023-03-10 10:13:14] [INFO ] Deduced a trap composed of 157 places in 260 ms of which 0 ms to minimize.
[2023-03-10 10:13:15] [INFO ] Deduced a trap composed of 160 places in 262 ms of which 0 ms to minimize.
[2023-03-10 10:13:15] [INFO ] Deduced a trap composed of 179 places in 154 ms of which 1 ms to minimize.
[2023-03-10 10:13:15] [INFO ] Deduced a trap composed of 184 places in 278 ms of which 1 ms to minimize.
[2023-03-10 10:13:15] [INFO ] Deduced a trap composed of 197 places in 312 ms of which 2 ms to minimize.
[2023-03-10 10:13:16] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 1 ms to minimize.
[2023-03-10 10:13:16] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 1 ms to minimize.
[2023-03-10 10:13:16] [INFO ] Deduced a trap composed of 167 places in 166 ms of which 0 ms to minimize.
[2023-03-10 10:13:16] [INFO ] Deduced a trap composed of 136 places in 254 ms of which 1 ms to minimize.
[2023-03-10 10:13:17] [INFO ] Deduced a trap composed of 185 places in 198 ms of which 0 ms to minimize.
[2023-03-10 10:13:17] [INFO ] Deduced a trap composed of 168 places in 267 ms of which 1 ms to minimize.
[2023-03-10 10:13:17] [INFO ] Deduced a trap composed of 173 places in 261 ms of which 1 ms to minimize.
[2023-03-10 10:13:17] [INFO ] Deduced a trap composed of 183 places in 265 ms of which 1 ms to minimize.
[2023-03-10 10:13:18] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 1 ms to minimize.
[2023-03-10 10:13:18] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2023-03-10 10:13:18] [INFO ] Deduced a trap composed of 187 places in 212 ms of which 1 ms to minimize.
[2023-03-10 10:13:19] [INFO ] Deduced a trap composed of 177 places in 293 ms of which 1 ms to minimize.
[2023-03-10 10:13:19] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-10 10:13:19] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 1 ms to minimize.
[2023-03-10 10:13:19] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 1 ms to minimize.
[2023-03-10 10:13:20] [INFO ] Deduced a trap composed of 164 places in 297 ms of which 1 ms to minimize.
[2023-03-10 10:13:20] [INFO ] Deduced a trap composed of 183 places in 226 ms of which 1 ms to minimize.
[2023-03-10 10:13:20] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 0 ms to minimize.
[2023-03-10 10:13:20] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2023-03-10 10:13:21] [INFO ] Deduced a trap composed of 149 places in 185 ms of which 0 ms to minimize.
[2023-03-10 10:13:21] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 0 ms to minimize.
[2023-03-10 10:13:21] [INFO ] Deduced a trap composed of 182 places in 202 ms of which 1 ms to minimize.
[2023-03-10 10:13:21] [INFO ] Deduced a trap composed of 150 places in 179 ms of which 0 ms to minimize.
[2023-03-10 10:13:21] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:13:22] [INFO ] Deduced a trap composed of 143 places in 192 ms of which 0 ms to minimize.
[2023-03-10 10:13:22] [INFO ] Deduced a trap composed of 157 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:13:22] [INFO ] Deduced a trap composed of 141 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:13:22] [INFO ] Deduced a trap composed of 182 places in 157 ms of which 1 ms to minimize.
[2023-03-10 10:13:22] [INFO ] Trap strengthening (SAT) tested/added 117/116 trap constraints in 33593 ms
[2023-03-10 10:13:23] [INFO ] Deduced a trap composed of 183 places in 190 ms of which 0 ms to minimize.
[2023-03-10 10:13:24] [INFO ] Deduced a trap composed of 122 places in 199 ms of which 1 ms to minimize.
[2023-03-10 10:13:24] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2023-03-10 10:13:24] [INFO ] Deduced a trap composed of 171 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:13:24] [INFO ] Deduced a trap composed of 161 places in 181 ms of which 1 ms to minimize.
[2023-03-10 10:13:25] [INFO ] Deduced a trap composed of 137 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:13:25] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 1 ms to minimize.
[2023-03-10 10:13:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1715 ms
[2023-03-10 10:13:25] [INFO ] Deduced a trap composed of 148 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:13:26] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 1 ms to minimize.
[2023-03-10 10:13:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 658 ms
[2023-03-10 10:13:26] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 1 ms to minimize.
[2023-03-10 10:13:26] [INFO ] Deduced a trap composed of 134 places in 209 ms of which 1 ms to minimize.
[2023-03-10 10:13:27] [INFO ] Deduced a trap composed of 125 places in 215 ms of which 1 ms to minimize.
[2023-03-10 10:13:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 746 ms
[2023-03-10 10:13:29] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 1 ms to minimize.
[2023-03-10 10:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-10 10:13:29] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 1 ms to minimize.
[2023-03-10 10:13:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-03-10 10:13:30] [INFO ] Deduced a trap composed of 149 places in 203 ms of which 1 ms to minimize.
[2023-03-10 10:13:30] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 1 ms to minimize.
[2023-03-10 10:13:30] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 1 ms to minimize.
[2023-03-10 10:13:30] [INFO ] Deduced a trap composed of 119 places in 208 ms of which 0 ms to minimize.
[2023-03-10 10:13:31] [INFO ] Deduced a trap composed of 173 places in 199 ms of which 1 ms to minimize.
[2023-03-10 10:13:31] [INFO ] Deduced a trap composed of 165 places in 195 ms of which 2 ms to minimize.
[2023-03-10 10:13:31] [INFO ] Deduced a trap composed of 174 places in 190 ms of which 1 ms to minimize.
[2023-03-10 10:13:31] [INFO ] Deduced a trap composed of 127 places in 197 ms of which 1 ms to minimize.
[2023-03-10 10:13:32] [INFO ] Deduced a trap composed of 120 places in 200 ms of which 0 ms to minimize.
[2023-03-10 10:13:32] [INFO ] Deduced a trap composed of 114 places in 199 ms of which 1 ms to minimize.
[2023-03-10 10:13:32] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 0 ms to minimize.
[2023-03-10 10:13:32] [INFO ] Deduced a trap composed of 121 places in 204 ms of which 1 ms to minimize.
[2023-03-10 10:13:33] [INFO ] Deduced a trap composed of 171 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:13:33] [INFO ] Deduced a trap composed of 188 places in 205 ms of which 1 ms to minimize.
[2023-03-10 10:13:33] [INFO ] Deduced a trap composed of 155 places in 200 ms of which 1 ms to minimize.
[2023-03-10 10:13:33] [INFO ] Deduced a trap composed of 176 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:13:34] [INFO ] Deduced a trap composed of 171 places in 191 ms of which 1 ms to minimize.
[2023-03-10 10:13:34] [INFO ] Deduced a trap composed of 116 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:13:34] [INFO ] Deduced a trap composed of 143 places in 237 ms of which 1 ms to minimize.
[2023-03-10 10:13:34] [INFO ] Deduced a trap composed of 136 places in 279 ms of which 1 ms to minimize.
[2023-03-10 10:13:35] [INFO ] Deduced a trap composed of 153 places in 279 ms of which 1 ms to minimize.
[2023-03-10 10:13:35] [INFO ] Deduced a trap composed of 145 places in 256 ms of which 1 ms to minimize.
[2023-03-10 10:13:35] [INFO ] Deduced a trap composed of 173 places in 240 ms of which 0 ms to minimize.
[2023-03-10 10:13:36] [INFO ] Deduced a trap composed of 117 places in 251 ms of which 1 ms to minimize.
[2023-03-10 10:13:36] [INFO ] Deduced a trap composed of 180 places in 199 ms of which 1 ms to minimize.
[2023-03-10 10:13:36] [INFO ] Deduced a trap composed of 174 places in 262 ms of which 1 ms to minimize.
[2023-03-10 10:13:36] [INFO ] Deduced a trap composed of 170 places in 286 ms of which 1 ms to minimize.
[2023-03-10 10:13:37] [INFO ] Deduced a trap composed of 117 places in 319 ms of which 1 ms to minimize.
[2023-03-10 10:13:37] [INFO ] Deduced a trap composed of 165 places in 311 ms of which 2 ms to minimize.
[2023-03-10 10:13:37] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7715 ms
[2023-03-10 10:13:38] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 0 ms to minimize.
[2023-03-10 10:13:38] [INFO ] Deduced a trap composed of 114 places in 183 ms of which 1 ms to minimize.
[2023-03-10 10:13:39] [INFO ] Deduced a trap composed of 118 places in 175 ms of which 1 ms to minimize.
[2023-03-10 10:13:39] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 1 ms to minimize.
[2023-03-10 10:13:39] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:13:39] [INFO ] Deduced a trap composed of 124 places in 185 ms of which 0 ms to minimize.
[2023-03-10 10:13:40] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 0 ms to minimize.
[2023-03-10 10:13:40] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 1 ms to minimize.
[2023-03-10 10:13:40] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 1 ms to minimize.
[2023-03-10 10:13:40] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 0 ms to minimize.
[2023-03-10 10:13:40] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2023-03-10 10:13:40] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 1 ms to minimize.
[2023-03-10 10:13:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2553 ms
[2023-03-10 10:13:47] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 1 ms to minimize.
[2023-03-10 10:13:47] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 0 ms to minimize.
[2023-03-10 10:13:47] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 1 ms to minimize.
[2023-03-10 10:13:47] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 1 ms to minimize.
[2023-03-10 10:13:47] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 1 ms to minimize.
[2023-03-10 10:13:47] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 0 ms to minimize.
[2023-03-10 10:13:48] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 1 ms to minimize.
[2023-03-10 10:13:48] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 1 ms to minimize.
[2023-03-10 10:13:48] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 0 ms to minimize.
[2023-03-10 10:13:48] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 1 ms to minimize.
[2023-03-10 10:13:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1773 ms
[2023-03-10 10:13:49] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 0 ms to minimize.
[2023-03-10 10:13:49] [INFO ] Deduced a trap composed of 117 places in 169 ms of which 1 ms to minimize.
[2023-03-10 10:13:49] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 1 ms to minimize.
[2023-03-10 10:13:49] [INFO ] Deduced a trap composed of 110 places in 153 ms of which 1 ms to minimize.
[2023-03-10 10:13:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 869 ms
[2023-03-10 10:13:54] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 0 ms to minimize.
[2023-03-10 10:13:54] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 1 ms to minimize.
[2023-03-10 10:13:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-10 10:13:54] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 0 ms to minimize.
[2023-03-10 10:13:55] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 1 ms to minimize.
[2023-03-10 10:13:55] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 1 ms to minimize.
[2023-03-10 10:13:55] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 1 ms to minimize.
[2023-03-10 10:13:55] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 0 ms to minimize.
[2023-03-10 10:13:55] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 1 ms to minimize.
[2023-03-10 10:13:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1124 ms
[2023-03-10 10:13:57] [INFO ] Deduced a trap composed of 119 places in 190 ms of which 1 ms to minimize.
[2023-03-10 10:13:57] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 1 ms to minimize.
[2023-03-10 10:13:57] [INFO ] Deduced a trap composed of 119 places in 176 ms of which 1 ms to minimize.
[2023-03-10 10:13:57] [INFO ] Deduced a trap composed of 122 places in 169 ms of which 1 ms to minimize.
[2023-03-10 10:13:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 869 ms
[2023-03-10 10:13:58] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-10 10:14:00] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 0 ms to minimize.
[2023-03-10 10:14:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-10 10:14:00] [INFO ] After 84818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :335
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-10 10:14:00] [INFO ] After 100013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :335
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 418312 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 418312 steps, saw 209351 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:14:04] [INFO ] Computed 48 place invariants in 20 ms
[2023-03-10 10:14:04] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:14:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-10 10:14:04] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-10 10:14:04] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:14:04] [INFO ] After 96ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:04] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-10 10:14:04] [INFO ] After 518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.14 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 412 transition count 316
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 160 place count 334 transition count 316
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 160 place count 334 transition count 303
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 320 place count 254 transition count 247
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 2 with 27 rules applied. Total rules applied 347 place count 254 transition count 220
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 374 place count 227 transition count 220
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 400 place count 227 transition count 220
Applied a total of 400 rules in 136 ms. Remains 227 /419 variables (removed 192) and now considering 220/396 (removed 176) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/419 places, 220/396 transitions.
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609626 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609626 steps, saw 305132 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 220 rows 227 cols
[2023-03-10 10:14:07] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-10 10:14:07] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:14:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 10:14:08] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 41 ms returned sat
[2023-03-10 10:14:08] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:08] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:14:08] [INFO ] After 61ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:08] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 10:14:08] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 16 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 227/227 places, 220/220 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 227/227 places, 220/220 transitions.
Applied a total of 0 rules in 14 ms. Remains 227 /227 variables (removed 0) and now considering 220/220 (removed 0) transitions.
// Phase 1: matrix 220 rows 227 cols
[2023-03-10 10:14:08] [INFO ] Computed 44 place invariants in 36 ms
[2023-03-10 10:14:09] [INFO ] Implicit Places using invariants in 592 ms returned [44, 49, 70, 75, 95, 101, 122, 127, 147, 152, 173, 179, 193, 198]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 593 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 213/227 places, 220/220 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 212 transition count 219
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 212 transition count 212
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 205 transition count 212
Applied a total of 16 rules in 27 ms. Remains 205 /213 variables (removed 8) and now considering 212/220 (removed 8) transitions.
// Phase 1: matrix 212 rows 205 cols
[2023-03-10 10:14:09] [INFO ] Computed 31 place invariants in 14 ms
[2023-03-10 10:14:09] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2023-03-10 10:14:09] [INFO ] Computed 31 place invariants in 16 ms
[2023-03-10 10:14:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:14:11] [INFO ] Implicit Places using invariants and state equation in 2515 ms returned []
Implicit Place search using SMT with State Equation took 2869 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 205/227 places, 212/220 transitions.
Finished structural reductions, in 2 iterations. Remains : 205/227 places, 212/220 transitions.
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 646031 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646031 steps, saw 323328 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 205 cols
[2023-03-10 10:14:14] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-10 10:14:15] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:14:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 10:14:15] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-10 10:14:15] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:14:15] [INFO ] After 30ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:15] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-10 10:14:15] [INFO ] After 256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 205 cols
[2023-03-10 10:14:15] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 10:14:15] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2023-03-10 10:14:15] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-10 10:14:15] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:14:17] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
[2023-03-10 10:14:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2023-03-10 10:14:17] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 10:14:17] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 205 transition count 194
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 194
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 177 transition count 184
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 177 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 176 transition count 183
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 176 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 174 transition count 181
Applied a total of 62 rules in 45 ms. Remains 174 /205 variables (removed 31) and now considering 181/212 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 181 rows 174 cols
[2023-03-10 10:14:17] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 10:14:17] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:14:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 10:14:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 10:14:18] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 10:14:18] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:18] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 0 ms to minimize.
[2023-03-10 10:14:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-10 10:14:18] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 10:14:18] [INFO ] After 524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:14:18] [INFO ] Flatten gal took : 121 ms
[2023-03-10 10:14:18] [INFO ] Flatten gal took : 33 ms
[2023-03-10 10:14:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality543389869024718080.gal : 21 ms
[2023-03-10 10:14:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13341585646734445637.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3464376868629913784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality543389869024718080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13341585646734445637.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality13341585646734445637.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23043
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23043 after 50349
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50349 after 106795
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106795 after 224170
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224170 after 461332
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461332 after 942906
Detected timeout of ITS tools.
[2023-03-10 10:14:34] [INFO ] Flatten gal took : 42 ms
[2023-03-10 10:14:34] [INFO ] Applying decomposition
[2023-03-10 10:14:34] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3828369384881300295.txt' '-o' '/tmp/graph3828369384881300295.bin' '-w' '/tmp/graph3828369384881300295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3828369384881300295.bin' '-l' '-1' '-v' '-w' '/tmp/graph3828369384881300295.weights' '-q' '0' '-e' '0.001'
[2023-03-10 10:14:34] [INFO ] Decomposing Gal with order
[2023-03-10 10:14:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 10:14:34] [INFO ] Removed a total of 112 redundant transitions.
[2023-03-10 10:14:34] [INFO ] Flatten gal took : 114 ms
[2023-03-10 10:14:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 21 ms.
[2023-03-10 10:14:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15018704458220545762.gal : 20 ms
[2023-03-10 10:14:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9542193504927700048.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3464376868629913784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15018704458220545762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9542193504927700048.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality9542193504927700048.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9614737464828785595
[2023-03-10 10:14:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9614737464828785595
Running compilation step : cd /tmp/ltsmin9614737464828785595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 807 ms.
Running link step : cd /tmp/ltsmin9614737464828785595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin9614737464828785595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 877 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 491647 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :{}
Probabilistic random walk after 491647 steps, saw 246083 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 396 rows 419 cols
[2023-03-10 10:15:07] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-10 10:15:07] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:15:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-10 10:15:07] [INFO ] [Nat]Absence check using 7 positive and 41 generalized place invariants in 17 ms returned sat
[2023-03-10 10:15:08] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-10 10:15:08] [INFO ] After 88ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:08] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-10 10:15:08] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 419/419 places, 396/396 transitions.
Graph (complete) has 893 edges and 419 vertex of which 413 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 412 transition count 317
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 159 place count 335 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 334 transition count 316
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 160 place count 334 transition count 303
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 186 place count 321 transition count 303
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 298 place count 265 transition count 247
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 320 place count 254 transition count 247
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 3 with 26 rules applied. Total rules applied 346 place count 254 transition count 221
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 372 place count 228 transition count 221
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 399 place count 228 transition count 221
Applied a total of 399 rules in 64 ms. Remains 228 /419 variables (removed 191) and now considering 221/396 (removed 175) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/419 places, 221/396 transitions.
Incomplete random walk after 10000 steps, including 1444 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 583296 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 583296 steps, saw 291966 distinct states, run finished after 3005 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 221 rows 228 cols
[2023-03-10 10:15:11] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-10 10:15:11] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:15:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 10:15:11] [INFO ] [Nat]Absence check using 2 positive and 42 generalized place invariants in 23 ms returned sat
[2023-03-10 10:15:11] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:15:11] [INFO ] After 34ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:11] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-10 10:15:11] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 7 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/228 places, 221/221 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 228 cols
[2023-03-10 10:15:11] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-10 10:15:12] [INFO ] Implicit Places using invariants in 674 ms returned [44, 49, 71, 76, 96, 102, 123, 128, 148, 153, 174, 180, 194, 199]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 684 ms to find 14 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 214/228 places, 221/221 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 213 transition count 220
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 213 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 206 transition count 213
Applied a total of 16 rules in 29 ms. Remains 206 /214 variables (removed 8) and now considering 213/221 (removed 8) transitions.
// Phase 1: matrix 213 rows 206 cols
[2023-03-10 10:15:12] [INFO ] Computed 31 place invariants in 20 ms
[2023-03-10 10:15:12] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2023-03-10 10:15:13] [INFO ] Computed 31 place invariants in 19 ms
[2023-03-10 10:15:13] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:15:15] [INFO ] Implicit Places using invariants and state equation in 2452 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 206/228 places, 213/221 transitions.
Finished structural reductions, in 2 iterations. Remains : 206/228 places, 213/221 transitions.
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 614706 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 614706 steps, saw 307585 distinct states, run finished after 3004 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 206 cols
[2023-03-10 10:15:18] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 10:15:18] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:15:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-10 10:15:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 10:15:18] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:15:18] [INFO ] After 33ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:18] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 10:15:18] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 206 cols
[2023-03-10 10:15:18] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 10:15:19] [INFO ] Implicit Places using invariants in 329 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2023-03-10 10:15:19] [INFO ] Computed 31 place invariants in 18 ms
[2023-03-10 10:15:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 10:15:21] [INFO ] Implicit Places using invariants and state equation in 2544 ms returned []
Implicit Place search using SMT with State Equation took 2893 ms to find 0 implicit places.
[2023-03-10 10:15:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 206 cols
[2023-03-10 10:15:21] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 10:15:22] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 213/213 transitions.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 206 transition count 195
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 188 transition count 195
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 178 transition count 185
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 178 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 177 transition count 184
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 177 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 175 transition count 182
Applied a total of 62 rules in 17 ms. Remains 175 /206 variables (removed 31) and now considering 182/213 (removed 31) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 182 rows 175 cols
[2023-03-10 10:15:22] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-10 10:15:22] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 10:15:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-10 10:15:22] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 10:15:22] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 10:15:22] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:22] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 10:15:22] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 10:15:22] [INFO ] Flatten gal took : 26 ms
[2023-03-10 10:15:22] [INFO ] Flatten gal took : 25 ms
[2023-03-10 10:15:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1353313029544329155.gal : 8 ms
[2023-03-10 10:15:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14391763439571903471.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3464376868629913784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1353313029544329155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14391763439571903471.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14391763439571903471.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1262
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1262 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10156
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10156 after 21793
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21793 after 49371
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :49371 after 106543
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106543 after 226643
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :226643 after 471807
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :471807 after 972184
Detected timeout of ITS tools.
[2023-03-10 10:15:37] [INFO ] Flatten gal took : 25 ms
[2023-03-10 10:15:37] [INFO ] Applying decomposition
[2023-03-10 10:15:37] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12949051919635897342.txt' '-o' '/tmp/graph12949051919635897342.bin' '-w' '/tmp/graph12949051919635897342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12949051919635897342.bin' '-l' '-1' '-v' '-w' '/tmp/graph12949051919635897342.weights' '-q' '0' '-e' '0.001'
[2023-03-10 10:15:37] [INFO ] Decomposing Gal with order
[2023-03-10 10:15:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 10:15:37] [INFO ] Removed a total of 115 redundant transitions.
[2023-03-10 10:15:37] [INFO ] Flatten gal took : 47 ms
[2023-03-10 10:15:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 14 ms.
[2023-03-10 10:15:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2784962967784991926.gal : 8 ms
[2023-03-10 10:15:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6493967197232311143.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3464376868629913784;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2784962967784991926.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6493967197232311143.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality6493967197232311143.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 29654
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5524465062854184929
[2023-03-10 10:15:52] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5524465062854184929
Running compilation step : cd /tmp/ltsmin5524465062854184929;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 530 ms.
Running link step : cd /tmp/ltsmin5524465062854184929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5524465062854184929;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicProp==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is 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 r160-smll-167819446000298"
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 ;