fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r160-smll-167819446100302
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1501.695 1800000.00 2561752.00 3724.10 [undef] Time out reached

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678443344908

Running Version 202205111006
[2023-03-10 10:15:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-10 10:15:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 10:15:47] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2023-03-10 10:15:47] [INFO ] Transformed 1064 places.
[2023-03-10 10:15:47] [INFO ] Transformed 998 transitions.
[2023-03-10 10:15:47] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 600 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 76 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 10 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 16 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 506 ms. Remains 558 /1064 variables (removed 506) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2023-03-10 10:15:48] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-10 10:15:49] [INFO ] Implicit Places using invariants in 1079 ms returned []
// Phase 1: matrix 534 rows 558 cols
[2023-03-10 10:15:49] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 10:15:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-10 10:16:20] [INFO ] Performed 280/558 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-10 10:16:41] [INFO ] Implicit Places using invariants and state equation in 51427 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 52612 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 557/1064 places, 534/998 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 555 transition count 532
Applied a total of 4 rules in 63 ms. Remains 555 /557 variables (removed 2) and now considering 532/534 (removed 2) transitions.
// Phase 1: matrix 532 rows 555 cols
[2023-03-10 10:16:41] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-10 10:16:41] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 532 rows 555 cols
[2023-03-10 10:16:41] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-10 10:16:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-10 10:17:12] [INFO ] Performed 333/555 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 10:17:40] [INFO ] Implicit Places using invariants and state equation in 59239 ms returned []
Implicit Place search using SMT with State Equation took 59734 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 555/1064 places, 532/998 transitions.
Finished structural reductions, in 2 iterations. Remains : 555/1064 places, 532/998 transitions.
Discarding 118 transitions out of 532. Remains 414
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 1208 resets, run finished after 1236 ms. (steps per millisecond=8 ) properties (out of 413) seen :14
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) 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 399) 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 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=11 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 101 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) 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 399) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 399) seen :0
Incomplete Best-First random walk after 100 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 399) seen :0
Interrupted probabilistic random walk after 52295 steps, run timeout after 3001 ms. (steps per millisecond=17 ) 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, 237=1, 239=1, 251=1, 252=1, 303=1, 304=1, 313=1, 316=1, 323=1, 335=1, 344=1, 373=1, 374=1, 383=1, 384=1}
Probabilistic random walk after 52295 steps, saw 26152 distinct states, run finished after 3004 ms. (steps per millisecond=17 ) properties seen :35
Running SMT prover for 364 properties.
// Phase 1: matrix 532 rows 555 cols
[2023-03-10 10:17:45] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-10 10:18:10] [INFO ] After 15410ms SMT Verify possible using state equation in real domain returned unsat :0 sat :133 real:230
[2023-03-10 10:18:10] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-10 10:18:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 10:18:10] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 364 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1277 ms.
Support contains 491 out of 555 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 555/555 places, 532/532 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 555 transition count 527
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 550 transition count 527
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 550 transition count 527
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 549 transition count 526
Applied a total of 19 rules in 87 ms. Remains 549 /555 variables (removed 6) and now considering 526/532 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 549/555 places, 526/532 transitions.
Interrupted random walk after 464600 steps, including 59379 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 844 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 861 resets, run finished after 494 ms. (steps per millisecond=20 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 856 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 880 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 364) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 422 ms. (steps per millisecond=23 ) properties (out of 364) seen :0
Interrupted probabilistic random walk after 3545239 steps, run timeout after 153001 ms. (steps per millisecond=23 ) 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, 229=1, 230=1, 231=1, 232=1, 295=1, 296=1, 298=1}
Probabilistic random walk after 3545239 steps, saw 1772637 distinct states, run finished after 153001 ms. (steps per millisecond=23 ) properties seen :19
Running SMT prover for 345 properties.
// Phase 1: matrix 526 rows 549 cols
[2023-03-10 10:21:36] [INFO ] Computed 100 place invariants in 84 ms
[2023-03-10 10:21:42] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 10:21:42] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 104 ms returned sat
[2023-03-10 10:22:13] [INFO ] After 23811ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:342
[2023-03-10 10:22:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 10:22:13] [INFO ] After 198ms SMT Verify possible using 42 Read/Feed constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-10 10:22:13] [INFO ] After 36255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:345
[2023-03-10 10:22:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 10:22:19] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 77 ms returned sat
[2023-03-10 10:22:50] [INFO ] After 24350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :345
[2023-03-10 10:23:33] [INFO ] After 43440ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :345
[2023-03-10 10:23:33] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 7 ms to minimize.
[2023-03-10 10:23:34] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 2 ms to minimize.
[2023-03-10 10:23:34] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 2 ms to minimize.
[2023-03-10 10:23:34] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 2 ms to minimize.
[2023-03-10 10:23:35] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 2 ms to minimize.
[2023-03-10 10:23:35] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-10 10:23:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2015 ms
[2023-03-10 10:23:36] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2023-03-10 10:23:36] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:23:36] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 1 ms to minimize.
[2023-03-10 10:23:37] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2023-03-10 10:23:37] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2023-03-10 10:23:37] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2023-03-10 10:23:37] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 1 ms to minimize.
[2023-03-10 10:23:37] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 1 ms to minimize.
[2023-03-10 10:23:38] [INFO ] Deduced a trap composed of 63 places in 243 ms of which 1 ms to minimize.
[2023-03-10 10:23:38] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 1 ms to minimize.
[2023-03-10 10:23:38] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 0 ms to minimize.
[2023-03-10 10:23:38] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2023-03-10 10:23:39] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 1 ms to minimize.
[2023-03-10 10:23:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2743 ms
[2023-03-10 10:23:40] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 0 ms to minimize.
[2023-03-10 10:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2023-03-10 10:23:40] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 0 ms to minimize.
[2023-03-10 10:23:41] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2023-03-10 10:23:41] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 0 ms to minimize.
[2023-03-10 10:23:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 746 ms
[2023-03-10 10:23:43] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 1 ms to minimize.
[2023-03-10 10:23:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-10 10:23:44] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-10 10:23:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-03-10 10:23:45] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:23:45] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:23:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2023-03-10 10:23:46] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2023-03-10 10:23:46] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2023-03-10 10:23:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2023-03-10 10:23:47] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 0 ms to minimize.
[2023-03-10 10:23:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-10 10:23:51] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-03-10 10:23:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-10 10:23:51] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2023-03-10 10:23:52] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 1 ms to minimize.
[2023-03-10 10:23:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 457 ms
[2023-03-10 10:23:53] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 2 ms to minimize.
[2023-03-10 10:23:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-10 10:23:55] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 3 ms to minimize.
[2023-03-10 10:23:55] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 0 ms to minimize.
[2023-03-10 10:23:55] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 1 ms to minimize.
[2023-03-10 10:23:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 732 ms
[2023-03-10 10:23:57] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 1 ms to minimize.
[2023-03-10 10:23:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-10 10:24:07] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 1 ms to minimize.
[2023-03-10 10:24:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2023-03-10 10:24:08] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 1 ms to minimize.
[2023-03-10 10:24:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-10 10:24:12] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 1 ms to minimize.
[2023-03-10 10:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 555 ms
[2023-03-10 10:24:15] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 1 ms to minimize.
[2023-03-10 10:24:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-10 10:24:18] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-10 10:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-10 10:24:18] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 1 ms to minimize.
[2023-03-10 10:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-10 10:24:19] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 1 ms to minimize.
[2023-03-10 10:24:20] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 1 ms to minimize.
[2023-03-10 10:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-03-10 10:24:20] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 1 ms to minimize.
[2023-03-10 10:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-10 10:24:21] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2023-03-10 10:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2023-03-10 10:24:22] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 1 ms to minimize.
[2023-03-10 10:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-10 10:24:23] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2023-03-10 10:24:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-10 10:24:24] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 1 ms to minimize.
[2023-03-10 10:24:24] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 0 ms to minimize.
[2023-03-10 10:24:24] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 0 ms to minimize.
[2023-03-10 10:24:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2023-03-10 10:24:25] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 0 ms to minimize.
[2023-03-10 10:24:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-10 10:24:25] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
[2023-03-10 10:24:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-10 10:24:26] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 1 ms to minimize.
[2023-03-10 10:24:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-10 10:24:27] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 3 ms to minimize.
[2023-03-10 10:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-10 10:24:27] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2023-03-10 10:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-03-10 10:24:27] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 0 ms to minimize.
[2023-03-10 10:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-10 10:24:27] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 1 ms to minimize.
[2023-03-10 10:24:28] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 1 ms to minimize.
[2023-03-10 10:24:28] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 1 ms to minimize.
[2023-03-10 10:24:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 433 ms
[2023-03-10 10:24:28] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 1 ms to minimize.
[2023-03-10 10:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-10 10:24:28] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
[2023-03-10 10:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-10 10:24:29] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 0 ms to minimize.
[2023-03-10 10:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-10 10:24:29] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2023-03-10 10:24:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-10 10:24:31] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2023-03-10 10:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-10 10:24:34] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 15 ms to minimize.
[2023-03-10 10:24:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3809 ms
[2023-03-10 10:24:38] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 3 ms to minimize.
[2023-03-10 10:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-10 10:24:38] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2023-03-10 10:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-10 10:25:06] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 0 ms to minimize.
[2023-03-10 10:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-10 10:25:40] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2023-03-10 10:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1115 ms
[2023-03-10 10:25:41] [INFO ] After 171122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :345
Attempting to minimize the solution found.
Minimization took 16916 ms.
[2023-03-10 10:25:58] [INFO ] After 225013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :344
Parikh walk visited 0 properties in 30005 ms.
Support contains 466 out of 549 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 549/549 places, 526/526 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 549 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 547 transition count 524
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 547 transition count 524
Applied a total of 8 rules in 54 ms. Remains 547 /549 variables (removed 2) and now considering 524/526 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 547/549 places, 524/526 transitions.
Interrupted random walk after 491542 steps, including 62994 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 851 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 857 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 873 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 812 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 837 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 869 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 345) seen :0
Interrupted probabilistic random walk after 3586380 steps, run timeout after 150001 ms. (steps per millisecond=23 ) properties seen :{5=1, 279=1}
Probabilistic random walk after 3586380 steps, saw 1793200 distinct states, run finished after 150001 ms. (steps per millisecond=23 ) properties seen :2
Running SMT prover for 343 properties.
// Phase 1: matrix 524 rows 547 cols
[2023-03-10 10:29:48] [INFO ] Computed 100 place invariants in 123 ms
[2023-03-10 10:29:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 10:29:52] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 55 ms returned sat
[2023-03-10 10:30:21] [INFO ] After 24206ms SMT Verify possible using state equation in real domain returned unsat :0 sat :34 real:309
[2023-03-10 10:30:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 10:30:23] [INFO ] After 1923ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :27 real:316
[2023-03-10 10:30:24] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 2 ms to minimize.
[2023-03-10 10:30:24] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2023-03-10 10:30:24] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2023-03-10 10:30:25] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 1 ms to minimize.
[2023-03-10 10:30:25] [INFO ] Deduced a trap composed of 33 places in 253 ms of which 1 ms to minimize.
[2023-03-10 10:30:25] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 1 ms to minimize.
[2023-03-10 10:30:26] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 1 ms to minimize.
[2023-03-10 10:30:26] [INFO ] Deduced a trap composed of 81 places in 241 ms of which 1 ms to minimize.
[2023-03-10 10:30:26] [INFO ] Deduced a trap composed of 41 places in 253 ms of which 1 ms to minimize.
[2023-03-10 10:30:26] [INFO ] Deduced a trap composed of 85 places in 235 ms of which 1 ms to minimize.
[2023-03-10 10:30:27] [INFO ] Deduced a trap composed of 57 places in 230 ms of which 1 ms to minimize.
[2023-03-10 10:30:27] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 0 ms to minimize.
[2023-03-10 10:30:27] [INFO ] Deduced a trap composed of 53 places in 232 ms of which 1 ms to minimize.
[2023-03-10 10:30:28] [INFO ] Deduced a trap composed of 109 places in 230 ms of which 1 ms to minimize.
[2023-03-10 10:30:28] [INFO ] Deduced a trap composed of 104 places in 224 ms of which 1 ms to minimize.
[2023-03-10 10:30:28] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4555 ms
[2023-03-10 10:30:28] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 1 ms to minimize.
[2023-03-10 10:30:28] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 1 ms to minimize.
[2023-03-10 10:30:29] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 0 ms to minimize.
[2023-03-10 10:30:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 731 ms
[2023-03-10 10:30:30] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 0 ms to minimize.
[2023-03-10 10:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2023-03-10 10:30:30] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 1 ms to minimize.
[2023-03-10 10:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-10 10:30:31] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 1 ms to minimize.
[2023-03-10 10:30:31] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 0 ms to minimize.
[2023-03-10 10:30:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2023-03-10 10:30:32] [INFO ] After 10910ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 10:30:32] [INFO ] After 43854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 10:30:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 10:30:38] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 84 ms returned sat
[2023-03-10 10:31:13] [INFO ] After 27736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :343
[2023-03-10 10:32:11] [INFO ] After 58486ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :343
[2023-03-10 10:32:12] [INFO ] Deduced a trap composed of 16 places in 371 ms of which 1 ms to minimize.
[2023-03-10 10:32:12] [INFO ] Deduced a trap composed of 14 places in 357 ms of which 1 ms to minimize.
[2023-03-10 10:32:12] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 1 ms to minimize.
[2023-03-10 10:32:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1303 ms
[2023-03-10 10:32:15] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 0 ms to minimize.
[2023-03-10 10:32:15] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2023-03-10 10:32:15] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 1 ms to minimize.
[2023-03-10 10:32:16] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2023-03-10 10:32:16] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 1 ms to minimize.
[2023-03-10 10:32:16] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 1 ms to minimize.
[2023-03-10 10:32:17] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 1 ms to minimize.
[2023-03-10 10:32:17] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 1 ms to minimize.
[2023-03-10 10:32:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2277 ms
[2023-03-10 10:32:18] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
[2023-03-10 10:32:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2023-03-10 10:32:19] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 2 ms to minimize.
[2023-03-10 10:32:20] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 1 ms to minimize.
[2023-03-10 10:32:20] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 1 ms to minimize.
[2023-03-10 10:32:21] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 0 ms to minimize.
[2023-03-10 10:32:21] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 1 ms to minimize.
[2023-03-10 10:32:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1963 ms
[2023-03-10 10:32:23] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 1 ms to minimize.
[2023-03-10 10:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-10 10:32:26] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 1 ms to minimize.
[2023-03-10 10:32:27] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 1 ms to minimize.
[2023-03-10 10:32:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 648 ms
[2023-03-10 10:32:29] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 1 ms to minimize.
[2023-03-10 10:32:29] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 1 ms to minimize.
[2023-03-10 10:32:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2023-03-10 10:32:32] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 1 ms to minimize.
[2023-03-10 10:32:32] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 1 ms to minimize.
[2023-03-10 10:32:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 705 ms
[2023-03-10 10:32:35] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 1 ms to minimize.
[2023-03-10 10:32:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-10 10:32:36] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2023-03-10 10:32:36] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 1 ms to minimize.
[2023-03-10 10:32:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2023-03-10 10:32:37] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2023-03-10 10:32:37] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2023-03-10 10:32:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 740 ms
[2023-03-10 10:32:38] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2023-03-10 10:32:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-10 10:32:40] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 1 ms to minimize.
[2023-03-10 10:32:40] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 0 ms to minimize.
[2023-03-10 10:32:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 421 ms
[2023-03-10 10:32:47] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2023-03-10 10:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-10 10:32:51] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 1 ms to minimize.
[2023-03-10 10:32:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-10 10:32:53] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 0 ms to minimize.
[2023-03-10 10:32:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-10 10:32:54] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 1 ms to minimize.
[2023-03-10 10:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-10 10:32:55] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 0 ms to minimize.
[2023-03-10 10:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2023-03-10 10:32:56] [INFO ] Deduced a trap composed of 49 places in 232 ms of which 1 ms to minimize.
[2023-03-10 10:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2023-03-10 10:32:56] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 1 ms to minimize.
[2023-03-10 10:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2023-03-10 10:32:58] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 1 ms to minimize.
[2023-03-10 10:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-10 10:32:59] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 0 ms to minimize.
[2023-03-10 10:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-10 10:33:00] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 0 ms to minimize.
[2023-03-10 10:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-10 10:33:00] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 1 ms to minimize.
[2023-03-10 10:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2023-03-10 10:33:02] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 1 ms to minimize.
[2023-03-10 10:33:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-10 10:33:02] [INFO ] Deduced a trap composed of 57 places in 184 ms of which 0 ms to minimize.
[2023-03-10 10:33:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-10 10:33:03] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 0 ms to minimize.
[2023-03-10 10:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-10 10:33:04] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 0 ms to minimize.
[2023-03-10 10:33:04] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2023-03-10 10:33:04] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 0 ms to minimize.
[2023-03-10 10:33:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2023-03-10 10:33:05] [INFO ] Deduced a trap composed of 60 places in 132 ms of which 1 ms to minimize.
[2023-03-10 10:33:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-10 10:33:06] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2023-03-10 10:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-10 10:33:06] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 4 ms to minimize.
[2023-03-10 10:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-03-10 10:33:06] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 1 ms to minimize.
[2023-03-10 10:33:07] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 0 ms to minimize.
[2023-03-10 10:33:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-10 10:33:07] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2023-03-10 10:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-10 10:33:07] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2023-03-10 10:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-10 10:33:08] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 1 ms to minimize.
[2023-03-10 10:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-10 10:33:08] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 1 ms to minimize.
[2023-03-10 10:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-10 10:33:09] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 0 ms to minimize.
[2023-03-10 10:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-10 10:33:09] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 0 ms to minimize.
[2023-03-10 10:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-10 10:33:10] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 0 ms to minimize.
[2023-03-10 10:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-10 10:33:11] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 0 ms to minimize.
[2023-03-10 10:33:11] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2023-03-10 10:33:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-03-10 10:33:11] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 1 ms to minimize.
[2023-03-10 10:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-10 10:33:12] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2023-03-10 10:33:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2023-03-10 10:33:13] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 1 ms to minimize.
[2023-03-10 10:33:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-10 10:34:14] [INFO ] After 181419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :343
Attempting to minimize the solution found.
Minimization took 3299 ms.
[2023-03-10 10:34:17] [INFO ] After 225019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :342
Parikh walk visited 0 properties in 30005 ms.
Support contains 463 out of 547 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 547/547 places, 524/524 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 547 transition count 522
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 545 transition count 522
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 545 transition count 522
Applied a total of 5 rules in 41 ms. Remains 545 /547 variables (removed 2) and now considering 522/524 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 545/547 places, 522/524 transitions.
Interrupted random walk after 489735 steps, including 62661 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 835 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 856 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 857 resets, run finished after 458 ms. (steps per millisecond=21 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 815 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 870 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 870 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 869 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 900 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 848 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Probably explored full state space saw : 912221 states, properties seen :0
Probabilistic random walk after 1824538 steps, saw 912221 distinct states, run finished after 75236 ms. (steps per millisecond=24 ) properties seen :0
Interrupted probabilistic random walk after 3424179 steps, run timeout after 150001 ms. (steps per millisecond=22 ) properties seen :{}
Exhaustive walk after 3424179 steps, saw 1712268 distinct states, run finished after 150005 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 343 properties.
// Phase 1: matrix 522 rows 545 cols
[2023-03-10 10:39:23] [INFO ] Computed 100 place invariants in 102 ms
[2023-03-10 10:39:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 10:39:29] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 72 ms returned sat
[2023-03-10 10:39:56] [INFO ] After 21241ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:337
[2023-03-10 10:39:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 10:39:57] [INFO ] After 545ms SMT Verify possible using 44 Read/Feed constraints in real domain returned unsat :0 sat :6 real:337
[2023-03-10 10:39:57] [INFO ] Deduced a trap composed of 20 places in 265 ms of which 1 ms to minimize.
[2023-03-10 10:39:57] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 1 ms to minimize.
[2023-03-10 10:39:58] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 0 ms to minimize.
[2023-03-10 10:39:58] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 1 ms to minimize.
[2023-03-10 10:39:58] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 1 ms to minimize.
[2023-03-10 10:39:58] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 0 ms to minimize.
[2023-03-10 10:39:58] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 0 ms to minimize.
[2023-03-10 10:39:59] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 1 ms to minimize.
[2023-03-10 10:39:59] [INFO ] Deduced a trap composed of 112 places in 165 ms of which 1 ms to minimize.
[2023-03-10 10:39:59] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2023-03-10 10:39:59] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 1 ms to minimize.
[2023-03-10 10:39:59] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 0 ms to minimize.
[2023-03-10 10:40:00] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2023-03-10 10:40:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2936 ms
[2023-03-10 10:40:00] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 1 ms to minimize.
[2023-03-10 10:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-10 10:40:00] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 0 ms to minimize.
[2023-03-10 10:40:00] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 0 ms to minimize.
[2023-03-10 10:40:01] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2023-03-10 10:40:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2023-03-10 10:40:01] [INFO ] After 4390ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 10:40:01] [INFO ] After 37533ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:343
[2023-03-10 10:40:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 10:40:04] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 66 ms returned sat
[2023-03-10 10:40:26] [INFO ] After 18125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :343
[2023-03-10 10:41:24] [INFO ] After 57439ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :343
[2023-03-10 10:41:24] [INFO ] Deduced a trap composed of 20 places in 392 ms of which 2 ms to minimize.
[2023-03-10 10:41:25] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 1 ms to minimize.
[2023-03-10 10:41:25] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 1 ms to minimize.
[2023-03-10 10:41:26] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 0 ms to minimize.
[2023-03-10 10:41:26] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2023-03-10 10:41:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2564 ms
[2023-03-10 10:41:28] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 0 ms to minimize.
[2023-03-10 10:41:28] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2023-03-10 10:41:28] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 0 ms to minimize.
[2023-03-10 10:41:29] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 1 ms to minimize.
[2023-03-10 10:41:29] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2023-03-10 10:41:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1458 ms
[2023-03-10 10:41:31] [INFO ] Deduced a trap composed of 18 places in 403 ms of which 1 ms to minimize.
[2023-03-10 10:41:32] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 1 ms to minimize.
[2023-03-10 10:41:32] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 1 ms to minimize.
[2023-03-10 10:41:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1324 ms
[2023-03-10 10:41:34] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-10 10:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-10 10:41:35] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 1 ms to minimize.
[2023-03-10 10:41:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-03-10 10:41:39] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 1 ms to minimize.
[2023-03-10 10:41:40] [INFO ] Deduced a trap composed of 32 places in 330 ms of which 1 ms to minimize.
[2023-03-10 10:41:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 787 ms
[2023-03-10 10:41:41] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 1 ms to minimize.
[2023-03-10 10:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2023-03-10 10:41:43] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 1 ms to minimize.
[2023-03-10 10:41:44] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2023-03-10 10:41:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 573 ms
[2023-03-10 10:41:45] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 1 ms to minimize.
[2023-03-10 10:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2023-03-10 10:41:48] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 1 ms to minimize.
[2023-03-10 10:41:48] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-10 10:41:49] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 1 ms to minimize.
[2023-03-10 10:41:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 982 ms
[2023-03-10 10:41:50] [INFO ] Deduced a trap composed of 28 places in 247 ms of which 1 ms to minimize.
[2023-03-10 10:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2023-03-10 10:41:54] [INFO ] Deduced a trap composed of 13 places in 227 ms of which 1 ms to minimize.
[2023-03-10 10:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1125 ms
[2023-03-10 10:42:02] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 1 ms to minimize.
[2023-03-10 10:42:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-10 10:42:05] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2023-03-10 10:42:06] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2023-03-10 10:42:06] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 0 ms to minimize.
[2023-03-10 10:42:06] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-10 10:42:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1464 ms
[2023-03-10 10:42:07] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 1 ms to minimize.
[2023-03-10 10:42:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-10 10:42:08] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 1 ms to minimize.
[2023-03-10 10:42:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-10 10:42:09] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 1 ms to minimize.
[2023-03-10 10:42:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-10 10:42:11] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 0 ms to minimize.
[2023-03-10 10:42:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-10 10:42:12] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 0 ms to minimize.
[2023-03-10 10:42:12] [INFO ] Deduced a trap composed of 48 places in 237 ms of which 1 ms to minimize.
[2023-03-10 10:42:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 641 ms
[2023-03-10 10:42:13] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 1 ms to minimize.
[2023-03-10 10:42:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-10 10:42:15] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 1 ms to minimize.
[2023-03-10 10:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-10 10:42:15] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 1 ms to minimize.
[2023-03-10 10:42:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-10 10:42:17] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 1 ms to minimize.
[2023-03-10 10:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-10 10:42:19] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 1 ms to minimize.
[2023-03-10 10:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2023-03-10 10:42:19] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 0 ms to minimize.
[2023-03-10 10:42:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-10 10:42:21] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 0 ms to minimize.
[2023-03-10 10:42:21] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 1 ms to minimize.
[2023-03-10 10:42:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 486 ms
[2023-03-10 10:42:22] [INFO ] Deduced a trap composed of 68 places in 171 ms of which 1 ms to minimize.
[2023-03-10 10:42:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-10 10:42:23] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 1 ms to minimize.
[2023-03-10 10:42:23] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 1 ms to minimize.
[2023-03-10 10:42:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2023-03-10 10:42:24] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 0 ms to minimize.
[2023-03-10 10:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-10 10:42:24] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 1 ms to minimize.
[2023-03-10 10:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-10 10:42:25] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 1 ms to minimize.
[2023-03-10 10:42:25] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 1 ms to minimize.
[2023-03-10 10:42:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 501 ms
[2023-03-10 10:42:25] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2023-03-10 10:42:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-10 10:42:27] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 0 ms to minimize.
[2023-03-10 10:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-10 10:42:27] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 0 ms to minimize.
[2023-03-10 10:42:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-10 10:42:29] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 1 ms to minimize.
[2023-03-10 10:42:29] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 0 ms to minimize.
[2023-03-10 10:42:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-03-10 10:42:29] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 0 ms to minimize.
[2023-03-10 10:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2023-03-10 10:42:30] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 1 ms to minimize.
[2023-03-10 10:42:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-10 10:42:31] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 1 ms to minimize.
[2023-03-10 10:42:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-10 10:42:32] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 1 ms to minimize.
[2023-03-10 10:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-10 10:42:33] [INFO ] Deduced a trap composed of 72 places in 113 ms of which 0 ms to minimize.
[2023-03-10 10:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-10 10:42:33] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 1 ms to minimize.
[2023-03-10 10:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-03-10 10:43:12] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2023-03-10 10:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2261 ms
[2023-03-10 10:43:46] [INFO ] After 199209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :342
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-10 10:43:46] [INFO ] After 225014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :342
Parikh walk visited 0 properties in 30022 ms.
Support contains 463 out of 545 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 545/545 places, 522/522 transitions.
Applied a total of 0 rules in 13 ms. Remains 545 /545 variables (removed 0) and now considering 522/522 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 545/545 places, 522/522 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 545/545 places, 522/522 transitions.
Applied a total of 0 rules in 12 ms. Remains 545 /545 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 545 cols
[2023-03-10 10:44:16] [INFO ] Computed 100 place invariants in 110 ms
[2023-03-10 10:44:16] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 522 rows 545 cols
[2023-03-10 10:44:16] [INFO ] Computed 100 place invariants in 65 ms
[2023-03-10 10:44:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 10:44:22] [INFO ] Implicit Places using invariants and state equation in 5647 ms returned [50, 174, 244, 446, 516]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 5996 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 540/545 places, 522/522 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 540 transition count 520
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 538 transition count 520
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 538 transition count 520
Applied a total of 5 rules in 32 ms. Remains 538 /540 variables (removed 2) and now considering 520/522 (removed 2) transitions.
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 10:44:22] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-10 10:44:22] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 520 rows 538 cols
[2023-03-10 10:44:22] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-10 10:44:22] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-10 10:44:26] [INFO ] Implicit Places using invariants and state equation in 4100 ms returned []
Implicit Place search using SMT with State Equation took 4364 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 538/545 places, 520/522 transitions.
Finished structural reductions, in 2 iterations. Remains : 538/545 places, 520/522 transitions.
Interrupted random walk after 504160 steps, including 72673 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 911 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 917 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 889 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 909 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 943 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 934 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 429 ms. (steps per millisecond=23 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 916 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 918 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 884 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 892 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 884 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 898 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 881 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 343) seen :0
Incomplete Best-First random walk after 10000 steps, including 910 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 343) seen :0

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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