Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r085-tall-165260115500127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleExponent-PT-020, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-tall-165260115500127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 340K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1652702181780

Running Version 202205111006
[2022-05-16 11:56:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-16 11:56:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 11:56:23] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-05-16 11:56:23] [INFO ] Transformed 1064 places.
[2022-05-16 11:56:23] [INFO ] Transformed 998 transitions.
[2022-05-16 11:56:23] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 226 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1060 transition count 758
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 484 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 484 place count 820 transition count 718
Deduced a syphon composed of 40 places in 37 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 564 place count 780 transition count 718
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 3 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 2 with 368 rules applied. Total rules applied 932 place count 596 transition count 534
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 8 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1008 place count 558 transition count 534
Applied a total of 1008 rules in 240 ms. Remains 558 /1064 variables (removed 506) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2022-05-16 11:56:23] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-16 11:56:23] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2022-05-16 11:56:24] [INFO ] Invariants computation overflowed in 16 ms
[2022-05-16 11:56:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-16 11:56:50] [INFO ] Implicit Places using invariants and state equation in 26218 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 26748 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 556/1064 places, 534/998 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 556 transition count 533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 555 transition count 533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 552 transition count 530
Applied a total of 8 rules in 56 ms. Remains 552 /556 variables (removed 4) and now considering 530/534 (removed 4) transitions.
// Phase 1: matrix 530 rows 552 cols
[2022-05-16 11:56:50] [INFO ] Computed 99 place invariants in 134 ms
[2022-05-16 11:56:50] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 530 rows 552 cols
[2022-05-16 11:56:50] [INFO ] Computed 99 place invariants in 103 ms
[2022-05-16 11:56:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-16 11:57:01] [INFO ] Implicit Places using invariants and state equation in 10668 ms returned []
Implicit Place search using SMT with State Equation took 11125 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 552/1064 places, 530/998 transitions.
Finished structural reductions, in 2 iterations. Remains : 552/1064 places, 530/998 transitions.
Discarding 118 transitions out of 530. Remains 412
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1225 resets, run finished after 832 ms. (steps per millisecond=12 ) properties (out of 411) seen :14
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 397) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 397) seen :0
Interrupted probabilistic random walk after 79750 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 4=1, 8=1, 9=1, 10=1, 11=1, 26=1, 89=1, 106=1, 127=1, 136=1, 140=1, 149=1, 173=1, 182=1, 206=1, 210=1, 216=1, 230=1, 235=1, 236=1, 248=1, 249=1, 300=1, 301=1, 310=1, 313=1, 320=1, 332=1, 341=1, 370=1, 371=1, 380=1, 381=1}
Probabilistic random walk after 79750 steps, saw 39883 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :35
Running SMT prover for 362 properties.
// Phase 1: matrix 530 rows 552 cols
[2022-05-16 11:57:05] [INFO ] Computed 99 place invariants in 69 ms
[2022-05-16 11:57:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 11:57:09] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 38 ms returned sat
[2022-05-16 11:57:27] [INFO ] After 14653ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:354
[2022-05-16 11:57:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-16 11:57:27] [INFO ] After 294ms SMT Verify possible using 40 Read/Feed constraints in real domain returned unsat :0 sat :0 real:362
[2022-05-16 11:57:27] [INFO ] After 21939ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:362
[2022-05-16 11:57:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 11:57:30] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 30 ms returned sat
[2022-05-16 11:57:47] [INFO ] After 13723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :362
[2022-05-16 11:57:52] [INFO ] After 4868ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :361
[2022-05-16 11:57:52] [INFO ] After 4870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :361
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-16 11:57:52] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :361
Parikh walk visited 0 properties in 30311 ms.
Support contains 488 out of 552 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 552/552 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 552 transition count 525
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 547 transition count 525
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 547 transition count 525
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 546 transition count 524
Applied a total of 19 rules in 65 ms. Remains 546 /552 variables (removed 6) and now considering 524/530 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 546/552 places, 524/530 transitions.
Interrupted random walk after 606128 steps, including 77658 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 882 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10001 steps, including 808 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 362) seen :0
Interrupted probabilistic random walk after 4353733 steps, run timeout after 138001 ms. (steps per millisecond=31 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 10=1, 14=1, 15=1, 16=1, 17=1, 226=1, 227=1, 228=1, 229=1, 292=1, 293=1, 294=1, 295=1}
Probabilistic random walk after 4353733 steps, saw 2176813 distinct states, run finished after 138001 ms. (steps per millisecond=31 ) properties seen :21
Running SMT prover for 341 properties.
// Phase 1: matrix 524 rows 546 cols
[2022-05-16 12:01:27] [INFO ] Invariants computation overflowed in 39 ms
[2022-05-16 12:01:46] [INFO ] After 13169ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:339
[2022-05-16 12:01:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-16 12:01:47] [INFO ] After 740ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :1 real:340
[2022-05-16 12:01:47] [INFO ] After 873ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:01:47] [INFO ] After 19691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:02:05] [INFO ] After 13029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :341
[2022-05-16 12:02:35] [INFO ] After 29854ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :341
[2022-05-16 12:02:37] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 4 ms to minimize.
[2022-05-16 12:02:37] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2022-05-16 12:02:37] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2022-05-16 12:02:38] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2022-05-16 12:02:38] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2022-05-16 12:02:38] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2022-05-16 12:02:38] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2022-05-16 12:02:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1203 ms
[2022-05-16 12:02:39] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:02:39] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 0 ms to minimize.
[2022-05-16 12:02:39] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2022-05-16 12:02:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2022-05-16 12:02:41] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-05-16 12:02:41] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:02:41] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:02:42] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:02:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 652 ms
[2022-05-16 12:02:42] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2022-05-16 12:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-16 12:02:43] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2022-05-16 12:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-16 12:02:43] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:02:43] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:02:44] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:02:44] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:02:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 591 ms
[2022-05-16 12:02:44] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2022-05-16 12:02:45] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:02:45] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2022-05-16 12:02:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2022-05-16 12:02:46] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-16 12:02:47] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:02:47] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2022-05-16 12:02:48] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:02:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-16 12:02:48] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2022-05-16 12:02:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-16 12:02:49] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2022-05-16 12:02:49] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:02:49] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:02:49] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:02:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 532 ms
[2022-05-16 12:02:50] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:02:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-16 12:02:50] [INFO ] Deduced a trap composed of 35 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:02:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2022-05-16 12:02:51] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 4 ms to minimize.
[2022-05-16 12:02:51] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 0 ms to minimize.
[2022-05-16 12:02:51] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2022-05-16 12:02:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2022-05-16 12:02:52] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 0 ms to minimize.
[2022-05-16 12:02:52] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 0 ms to minimize.
[2022-05-16 12:02:53] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:02:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 918 ms
[2022-05-16 12:02:55] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2022-05-16 12:02:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2022-05-16 12:02:55] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 0 ms to minimize.
[2022-05-16 12:02:55] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 0 ms to minimize.
[2022-05-16 12:02:55] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 0 ms to minimize.
[2022-05-16 12:02:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 370 ms
[2022-05-16 12:02:56] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 0 ms to minimize.
[2022-05-16 12:02:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-16 12:02:56] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:02:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-05-16 12:02:57] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2022-05-16 12:02:57] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:02:57] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 0 ms to minimize.
[2022-05-16 12:02:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 363 ms
[2022-05-16 12:02:57] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2022-05-16 12:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 993 ms
[2022-05-16 12:03:01] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2022-05-16 12:03:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-16 12:03:02] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-05-16 12:03:03] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 0 ms to minimize.
[2022-05-16 12:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-16 12:03:04] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:03:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-16 12:03:04] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:03:04] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2022-05-16 12:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2022-05-16 12:03:05] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2022-05-16 12:03:05] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 0 ms to minimize.
[2022-05-16 12:03:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2022-05-16 12:03:05] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 0 ms to minimize.
[2022-05-16 12:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-16 12:03:06] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2022-05-16 12:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-16 12:03:06] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2022-05-16 12:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-16 12:03:07] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2022-05-16 12:03:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-16 12:03:07] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2022-05-16 12:03:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-16 12:03:08] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2022-05-16 12:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-16 12:03:08] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:03:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-05-16 12:03:09] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:03:09] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2022-05-16 12:03:09] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
[2022-05-16 12:03:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2022-05-16 12:03:09] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 4 ms to minimize.
[2022-05-16 12:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-16 12:03:38] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2022-05-16 12:03:40] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2022-05-16 12:03:40] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2022-05-16 12:03:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2022-05-16 12:03:40] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:03:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2022-05-16 12:03:45] [INFO ] After 99590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.
Minimization took 62140 ms.
[2022-05-16 12:04:47] [INFO ] After 180277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :341
Parikh walk visited 0 properties in 30012 ms.
Support contains 460 out of 546 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 546/546 places, 524/524 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 546 transition count 520
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 542 transition count 520
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 542 transition count 520
Applied a total of 12 rules in 38 ms. Remains 542 /546 variables (removed 4) and now considering 520/524 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 542/546 places, 520/524 transitions.
Interrupted random walk after 764587 steps, including 98049 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 859 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 884 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 882 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 812 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Interrupted probabilistic random walk after 4343277 steps, run timeout after 132001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 4343277 steps, saw 2171561 distinct states, run finished after 132003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 341 properties.
// Phase 1: matrix 520 rows 542 cols
[2022-05-16 12:08:13] [INFO ] Computed 99 place invariants in 52 ms
[2022-05-16 12:08:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:08:16] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 35 ms returned sat
[2022-05-16 12:08:33] [INFO ] After 13929ms SMT Verify possible using state equation in real domain returned unsat :0 sat :34 real:307
[2022-05-16 12:08:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 12:08:34] [INFO ] After 1056ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :5 real:336
[2022-05-16 12:08:34] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:08:34] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 1 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:08:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1163 ms
[2022-05-16 12:08:35] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:08:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-16 12:08:36] [INFO ] After 2593ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:08:36] [INFO ] After 22394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:08:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:08:38] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 32 ms returned sat
[2022-05-16 12:08:52] [INFO ] After 10548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :341
[2022-05-16 12:09:26] [INFO ] After 34281ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :341
[2022-05-16 12:09:26] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:09:27] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:09:27] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:09:27] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:09:27] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:09:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 776 ms
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:09:29] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:09:30] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2022-05-16 12:09:30] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2022-05-16 12:09:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2022-05-16 12:09:31] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:09:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-16 12:09:33] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:09:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 900 ms
[2022-05-16 12:09:35] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2022-05-16 12:09:38] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:09:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-16 12:09:39] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:09:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2022-05-16 12:09:40] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:09:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-16 12:09:41] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:09:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-16 12:09:41] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2022-05-16 12:09:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-16 12:09:42] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 1 ms to minimize.
[2022-05-16 12:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-05-16 12:09:42] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 0 ms to minimize.
[2022-05-16 12:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-16 12:09:43] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:09:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-16 12:09:43] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:09:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-16 12:09:44] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:09:44] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:09:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2022-05-16 12:09:44] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:09:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-16 12:09:45] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2022-05-16 12:09:45] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:09:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-16 12:09:46] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2022-05-16 12:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-16 12:09:46] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:09:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-16 12:09:47] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 0 ms to minimize.
[2022-05-16 12:09:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-16 12:09:47] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2022-05-16 12:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-16 12:09:48] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2022-05-16 12:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-16 12:09:48] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2022-05-16 12:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-05-16 12:09:48] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 0 ms to minimize.
[2022-05-16 12:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-16 12:09:49] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2022-05-16 12:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-16 12:09:49] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:09:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-16 12:09:50] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-05-16 12:09:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-16 12:09:51] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-16 12:09:51] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2022-05-16 12:09:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-16 12:09:52] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2022-05-16 12:09:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-16 12:09:52] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-16 12:09:53] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:09:53] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:09:53] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2022-05-16 12:09:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2022-05-16 12:09:54] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:09:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-16 12:09:55] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2022-05-16 12:09:55] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:09:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2022-05-16 12:09:55] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 0 ms to minimize.
[2022-05-16 12:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-16 12:09:55] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 370 ms
[2022-05-16 12:09:58] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2022-05-16 12:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2022-05-16 12:09:59] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2022-05-16 12:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2022-05-16 12:09:59] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-16 12:10:00] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2022-05-16 12:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-16 12:10:01] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-16 12:10:01] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2022-05-16 12:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-16 12:10:02] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2022-05-16 12:10:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-16 12:10:02] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2022-05-16 12:10:02] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:10:02] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:10:02] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 0 ms to minimize.
[2022-05-16 12:10:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 551 ms
[2022-05-16 12:10:03] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2022-05-16 12:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-16 12:10:03] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2022-05-16 12:10:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-16 12:10:04] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2022-05-16 12:10:04] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2022-05-16 12:10:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2022-05-16 12:10:04] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 1 ms to minimize.
[2022-05-16 12:10:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-16 12:10:16] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 0 ms to minimize.
[2022-05-16 12:10:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2022-05-16 12:10:34] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2022-05-16 12:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2022-05-16 12:10:37] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2022-05-16 12:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 682 ms
[2022-05-16 12:10:37] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2022-05-16 12:10:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-16 12:10:38] [INFO ] After 106273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.
Minimization took 53067 ms.
[2022-05-16 12:11:31] [INFO ] After 175635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :341
Parikh walk visited 0 properties in 30019 ms.
Support contains 460 out of 542 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 542/542 places, 520/520 transitions.
Applied a total of 0 rules in 15 ms. Remains 542 /542 variables (removed 0) and now considering 520/520 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 542/542 places, 520/520 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 542/542 places, 520/520 transitions.
Applied a total of 0 rules in 11 ms. Remains 542 /542 variables (removed 0) and now considering 520/520 (removed 0) transitions.
// Phase 1: matrix 520 rows 542 cols
[2022-05-16 12:12:01] [INFO ] Computed 99 place invariants in 53 ms
[2022-05-16 12:12:02] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 520 rows 542 cols
[2022-05-16 12:12:02] [INFO ] Computed 99 place invariants in 49 ms
[2022-05-16 12:12:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 12:12:03] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned [47, 171, 241, 443, 513]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 1192 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 537/542 places, 520/520 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 537 transition count 518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 535 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 535 transition count 518
Applied a total of 5 rules in 34 ms. Remains 535 /537 variables (removed 2) and now considering 518/520 (removed 2) transitions.
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:12:03] [INFO ] Computed 94 place invariants in 50 ms
[2022-05-16 12:12:03] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:12:03] [INFO ] Computed 94 place invariants in 41 ms
[2022-05-16 12:12:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 12:12:04] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 535/542 places, 518/520 transitions.
Finished structural reductions, in 2 iterations. Remains : 535/542 places, 518/520 transitions.
Interrupted random walk after 640643 steps, including 92555 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 894 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 883 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 888 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Interrupted probabilistic random walk after 4366915 steps, run timeout after 132001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 4366915 steps, saw 2183237 distinct states, run finished after 132001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 341 properties.
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:15:01] [INFO ] Computed 94 place invariants in 44 ms
[2022-05-16 12:15:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:15:03] [INFO ] [Real]Absence check using 2 positive and 92 generalized place invariants in 40 ms returned sat
[2022-05-16 12:15:22] [INFO ] After 15166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:334
[2022-05-16 12:15:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 12:15:22] [INFO ] After 673ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :7 real:334
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 600 ms
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-16 12:15:23] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-16 12:15:24] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2022-05-16 12:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-05-16 12:15:24] [INFO ] After 2003ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:15:24] [INFO ] After 23140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:15:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:15:26] [INFO ] [Nat]Absence check using 2 positive and 92 generalized place invariants in 36 ms returned sat
[2022-05-16 12:15:41] [INFO ] After 11902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :341
[2022-05-16 12:16:22] [INFO ] After 40689ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :341
[2022-05-16 12:16:22] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2022-05-16 12:16:22] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:16:23] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2022-05-16 12:16:23] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:16:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 624 ms
[2022-05-16 12:16:24] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:16:24] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:16:24] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 0 ms to minimize.
[2022-05-16 12:16:24] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:16:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 561 ms
[2022-05-16 12:16:25] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 1 ms to minimize.
[2022-05-16 12:16:25] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:16:25] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2022-05-16 12:16:25] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 0 ms to minimize.
[2022-05-16 12:16:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 624 ms
[2022-05-16 12:16:26] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-16 12:16:28] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-16 12:16:28] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2022-05-16 12:16:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-16 12:16:28] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2022-05-16 12:16:31] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2022-05-16 12:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-16 12:16:31] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2022-05-16 12:16:31] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-16 12:16:34] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2022-05-16 12:16:34] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:16:34] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 0 ms to minimize.
[2022-05-16 12:16:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2022-05-16 12:16:39] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2022-05-16 12:16:40] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2022-05-16 12:16:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1269 ms
[2022-05-16 12:16:51] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-05-16 12:16:51] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:16:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2022-05-16 12:16:51] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:16:51] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2022-05-16 12:16:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2022-05-16 12:16:51] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 0 ms to minimize.
[2022-05-16 12:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-16 12:16:52] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
[2022-05-16 12:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-16 12:16:52] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2022-05-16 12:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-16 12:16:52] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2022-05-16 12:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-16 12:16:53] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 0 ms to minimize.
[2022-05-16 12:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-16 12:16:53] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-16 12:16:53] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2022-05-16 12:16:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-16 12:16:54] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1555 ms
[2022-05-16 12:16:58] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2022-05-16 12:16:58] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:16:58] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 0 ms to minimize.
[2022-05-16 12:16:58] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2022-05-16 12:16:58] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2022-05-16 12:16:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 534 ms
[2022-05-16 12:17:00] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-16 12:17:01] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2022-05-16 12:17:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-16 12:17:02] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:17:03] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:17:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2022-05-16 12:17:03] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2022-05-16 12:17:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-16 12:17:04] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:17:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-16 12:17:20] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 0 ms to minimize.
[2022-05-16 12:17:23] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 0 ms to minimize.
[2022-05-16 12:17:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2022-05-16 12:17:25] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:17:25] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2022-05-16 12:17:25] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:17:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 409 ms
[2022-05-16 12:17:27] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:17:27] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2022-05-16 12:17:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 721 ms
[2022-05-16 12:17:29] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2022-05-16 12:17:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-16 12:17:29] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 0 ms to minimize.
[2022-05-16 12:17:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2022-05-16 12:17:29] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:17:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-05-16 12:17:29] [INFO ] After 108044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.
Minimization took 39909 ms.
[2022-05-16 12:18:09] [INFO ] After 165633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :341
Parikh walk visited 0 properties in 30000 ms.
Support contains 460 out of 535 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 535/535 places, 518/518 transitions.
Applied a total of 0 rules in 12 ms. Remains 535 /535 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 535/535 places, 518/518 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 535/535 places, 518/518 transitions.
Applied a total of 0 rules in 9 ms. Remains 535 /535 variables (removed 0) and now considering 518/518 (removed 0) transitions.
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:18:39] [INFO ] Computed 94 place invariants in 44 ms
[2022-05-16 12:18:40] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:18:40] [INFO ] Computed 94 place invariants in 39 ms
[2022-05-16 12:18:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 12:18:40] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2022-05-16 12:18:40] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:18:40] [INFO ] Computed 94 place invariants in 49 ms
[2022-05-16 12:18:41] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 535/535 places, 518/518 transitions.
Incomplete random walk after 100000 steps, including 14458 resets, run finished after 5297 ms. (steps per millisecond=18 ) properties (out of 460) seen :0
Running SMT prover for 460 properties.
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:18:46] [INFO ] Computed 94 place invariants in 46 ms
[2022-05-16 12:18:50] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-05-16 12:18:50] [INFO ] [Real]Absence check using 2 positive and 92 generalized place invariants in 38 ms returned sat
[2022-05-16 12:19:08] [INFO ] After 13739ms SMT Verify possible using state equation in real domain returned unsat :0 sat :59 real:401
[2022-05-16 12:19:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 12:19:10] [INFO ] After 2700ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :0 real:460
[2022-05-16 12:19:11] [INFO ] After 24410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:460
[2022-05-16 12:19:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:19:14] [INFO ] [Nat]Absence check using 2 positive and 92 generalized place invariants in 37 ms returned sat
[2022-05-16 12:19:30] [INFO ] After 12117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :460
[2022-05-16 12:20:00] [INFO ] After 30014ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :460
[2022-05-16 12:20:01] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:20:01] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 1 ms to minimize.
[2022-05-16 12:20:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2022-05-16 12:20:01] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2022-05-16 12:20:01] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2022-05-16 12:20:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 968 ms
[2022-05-16 12:20:02] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:20:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-16 12:20:03] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2022-05-16 12:20:03] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2022-05-16 12:20:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2022-05-16 12:20:04] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-16 12:20:05] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:20:05] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2022-05-16 12:20:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2022-05-16 12:20:05] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2022-05-16 12:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-16 12:20:06] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:20:06] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:20:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2022-05-16 12:20:07] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2022-05-16 12:20:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-16 12:20:07] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2022-05-16 12:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-16 12:20:08] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 0 ms to minimize.
[2022-05-16 12:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2022-05-16 12:20:08] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2022-05-16 12:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2022-05-16 12:20:08] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2022-05-16 12:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-05-16 12:20:09] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2022-05-16 12:20:09] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:20:09] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:20:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2022-05-16 12:20:10] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2022-05-16 12:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2022-05-16 12:20:11] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2022-05-16 12:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2022-05-16 12:20:11] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2022-05-16 12:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-16 12:20:11] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2022-05-16 12:20:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-16 12:20:12] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2022-05-16 12:20:12] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2022-05-16 12:20:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2022-05-16 12:20:13] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 1 ms to minimize.
[2022-05-16 12:20:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2022-05-16 12:20:14] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2022-05-16 12:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-16 12:20:14] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 1 ms to minimize.
[2022-05-16 12:20:15] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:20:15] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2022-05-16 12:20:15] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2022-05-16 12:20:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 422 ms
[2022-05-16 12:20:15] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 0 ms to minimize.
[2022-05-16 12:20:15] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:20:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2022-05-16 12:20:16] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2022-05-16 12:20:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-16 12:20:17] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2022-05-16 12:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-05-16 12:20:17] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 0 ms to minimize.
[2022-05-16 12:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-05-16 12:20:17] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-16 12:20:18] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:20:18] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2022-05-16 12:20:18] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:20:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 286 ms
[2022-05-16 12:20:19] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-05-16 12:20:19] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 0 ms to minimize.
[2022-05-16 12:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-16 12:20:20] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2022-05-16 12:20:20] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 0 ms to minimize.
[2022-05-16 12:20:20] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2022-05-16 12:20:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2022-05-16 12:20:21] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2022-05-16 12:20:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-16 12:20:21] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 0 ms to minimize.
[2022-05-16 12:20:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2022-05-16 12:20:23] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 0 ms to minimize.
[2022-05-16 12:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-16 12:20:23] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 0 ms to minimize.
[2022-05-16 12:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-05-16 12:20:23] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2022-05-16 12:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-16 12:20:25] [INFO ] Deduced a trap composed of 80 places in 47 ms of which 1 ms to minimize.
[2022-05-16 12:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2022-05-16 12:20:25] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2022-05-16 12:20:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-05-16 12:20:27] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2022-05-16 12:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-16 12:20:30] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
[2022-05-16 12:20:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2022-05-16 12:20:30] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:20:30] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 0 ms to minimize.
[2022-05-16 12:20:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2022-05-16 12:20:31] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2022-05-16 12:20:32] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 0 ms to minimize.
[2022-05-16 12:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1455 ms
[2022-05-16 12:20:38] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 0 ms to minimize.
[2022-05-16 12:20:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2022-05-16 12:20:41] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2022-05-16 12:20:41] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 0 ms to minimize.
[2022-05-16 12:20:41] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 0 ms to minimize.
[2022-05-16 12:20:41] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 0 ms to minimize.
[2022-05-16 12:20:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 867 ms
[2022-05-16 12:20:49] [INFO ] After 78417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :460
Attempting to minimize the solution found.
Minimization took 1735 ms.
[2022-05-16 12:20:51] [INFO ] After 100013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :459
Interrupted random walk after 641972 steps, including 92869 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 957 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 938 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 954 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 905 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 901 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 928 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 890 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 881 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 920 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 341) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 341) seen :0
Interrupted probabilistic random walk after 4152869 steps, run timeout after 129001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 4152869 steps, saw 2076248 distinct states, run finished after 129001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 341 properties.
// Phase 1: matrix 518 rows 535 cols
[2022-05-16 12:23:43] [INFO ] Computed 94 place invariants in 43 ms
[2022-05-16 12:23:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:23:45] [INFO ] [Real]Absence check using 2 positive and 92 generalized place invariants in 40 ms returned sat
[2022-05-16 12:24:04] [INFO ] After 15302ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:334
[2022-05-16 12:24:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-05-16 12:24:05] [INFO ] After 697ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :7 real:334
[2022-05-16 12:24:05] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2022-05-16 12:24:05] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2022-05-16 12:24:05] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2022-05-16 12:24:05] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 0 ms to minimize.
[2022-05-16 12:24:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 584 ms
[2022-05-16 12:24:05] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2022-05-16 12:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2022-05-16 12:24:06] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 0 ms to minimize.
[2022-05-16 12:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2022-05-16 12:24:06] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 0 ms to minimize.
[2022-05-16 12:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2022-05-16 12:24:06] [INFO ] After 1979ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:24:06] [INFO ] After 23380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:341
[2022-05-16 12:24:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 12:24:09] [INFO ] [Nat]Absence check using 2 positive and 92 generalized place invariants in 38 ms returned sat
[2022-05-16 12:24:22] [INFO ] After 10371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :341
[2022-05-16 12:25:01] [INFO ] After 39169ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :341
[2022-05-16 12:25:01] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:25:02] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:25:02] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2022-05-16 12:25:02] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:25:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 599 ms
[2022-05-16 12:25:03] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2022-05-16 12:25:03] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 0 ms to minimize.
[2022-05-16 12:25:03] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2022-05-16 12:25:03] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2022-05-16 12:25:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 537 ms
[2022-05-16 12:25:04] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:25:04] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2022-05-16 12:25:04] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 0 ms to minimize.
[2022-05-16 12:25:05] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2022-05-16 12:25:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 597 ms
[2022-05-16 12:25:05] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 0 ms to minimize.
[2022-05-16 12:25:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-16 12:25:07] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 1 ms to minimize.
[2022-05-16 12:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-16 12:25:07] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2022-05-16 12:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2022-05-16 12:25:08] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2022-05-16 12:25:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-05-16 12:25:10] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 0 ms to minimize.
[2022-05-16 12:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2022-05-16 12:25:10] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 1 ms to minimize.
[2022-05-16 12:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2022-05-16 12:25:10] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2022-05-16 12:25:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-16 12:25:13] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2022-05-16 12:25:13] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 1 ms to minimize.
[2022-05-16 12:25:13] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 0 ms to minimize.
[2022-05-16 12:25:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 465 ms
[2022-05-16 12:25:18] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2022-05-16 12:25:19] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2022-05-16 12:25:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1204 ms
[2022-05-16 12:25:29] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2022-05-16 12:25:30] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 0 ms to minimize.
[2022-05-16 12:25:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2022-05-16 12:25:30] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 0 ms to minimize.
[2022-05-16 12:25:30] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2022-05-16 12:25:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2022-05-16 12:25:30] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2022-05-16 12:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-05-16 12:25:30] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 0 ms to minimize.
[2022-05-16 12:25:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-16 12:25:31] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 0 ms to minimize.
[2022-05-16 12:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-16 12:25:31] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2022-05-16 12:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-16 12:25:31] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2022-05-16 12:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-16 12:25:32] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 0 ms to minimize.
[2022-05-16 12:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-16 12:25:32] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 0 ms to minimize.
[2022-05-16 12:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-16 12:25:33] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 0 ms to minimize.
[2022-05-16 12:25:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1596 ms
[2022-05-16 12:25:36] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2022-05-16 12:25:37] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2022-05-16 12:25:37] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 0 ms to minimize.
[2022-05-16 12:25:37] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:25:37] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2022-05-16 12:25:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 535 ms
[2022-05-16 12:25:39] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2022-05-16 12:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-05-16 12:25:40] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 0 ms to minimize.
[2022-05-16 12:25:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-05-16 12:25:41] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 0 ms to minimize.
[2022-05-16 12:25:41] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-05-16 12:25:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2022-05-16 12:25:42] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2022-05-16 12:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-16 12:25:43] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 0 ms to minimize.
[2022-05-16 12:25:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-16 12:25:59] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2022-05-16 12:25:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 286 ms
[2022-05-16 12:26:02] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 0 ms to minimize.
[2022-05-16 12:26:02] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 0 ms to minimize.
[2022-05-16 12:26:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2022-05-16 12:26:03] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2022-05-16 12:26:04] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2022-05-16 12:26:04] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2022-05-16 12:26:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2022-05-16 12:26:05] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 0 ms to minimize.
[2022-05-16 12:26:05] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 0 ms to minimize.
[2022-05-16 12:26:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
[2022-05-16 12:26:07] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 0 ms to minimize.
[2022-05-16 12:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-16 12:26:08] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2022-05-16 12:26:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2022-05-16 12:26:08] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 0 ms to minimize.
[2022-05-16 12:26:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-05-16 12:26:08] [INFO ] After 106043ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :341
Attempting to minimize the solution found.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-020, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r085-tall-165260115500127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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