MCC'2024- Execution of r496-tall-171640602900229

About the Execution of LTSMin+red for FunctionPointer-PT-b004

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1651.560	495625.00	630859.00	1023.40	0 ? inf ? inf ? 0 ? 0 inf inf inf 0 inf 1 0	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602900229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-b004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717188193115

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:43:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:43:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:43:14] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-31 20:43:14] [INFO ] Transformed 306 places.
[2024-05-31 20:43:14] [INFO ] Transformed 840 transitions.
[2024-05-31 20:43:14] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 84 places in 11 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:43:14] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-31 20:43:14] [INFO ] Computed 4 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1]
RANDOM walk for 10001 steps (13 resets) in 53 ms. (185 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (30 resets) in 113 ms. (877 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 12, 5, 9, 5, 5, 11, 3, 4, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:43:14] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-31 20:43:14] [INFO ] Invariant cache hit.
[2024-05-31 20:43:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 20:43:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-31 20:43:15] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 20:43:15] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:43:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Nat]Added 65 Read/Feed constraints in 12 ms returned sat
[2024-05-31 20:43:15] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 12 ms to minimize.
[2024-05-31 20:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2024-05-31 20:43:15] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 64 ms.
[2024-05-31 20:43:15] [INFO ] Added : 1 causal constraints over 1 iterations in 112 ms. Result :sat
Minimization took 93 ms.
[2024-05-31 20:43:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:43:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:15] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:43:16] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 57 ms.
[2024-05-31 20:43:16] [INFO ] Added : 3 causal constraints over 1 iterations in 102 ms. Result :sat
Minimization took 82 ms.
[2024-05-31 20:43:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:43:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-31 20:43:16] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:43:16] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 11 ms to minimize.
[2024-05-31 20:43:16] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-31 20:43:16] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:43:17] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:43:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 513 ms
[2024-05-31 20:43:17] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 41 ms.
[2024-05-31 20:43:17] [INFO ] Added : 2 causal constraints over 1 iterations in 88 ms. Result :sat
Minimization took 78 ms.
[2024-05-31 20:43:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:43:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:43:17] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-05-31 20:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-31 20:43:17] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 46 ms.
[2024-05-31 20:43:17] [INFO ] Added : 1 causal constraints over 1 iterations in 90 ms. Result :sat
Minimization took 76 ms.
[2024-05-31 20:43:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-31 20:43:17] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:43:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:43:18] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:43:18] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:43:18] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:43:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 387 ms
[2024-05-31 20:43:18] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 37 ms.
[2024-05-31 20:43:18] [INFO ] Added : 2 causal constraints over 1 iterations in 105 ms. Result :sat
Minimization took 84 ms.
[2024-05-31 20:43:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:43:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-31 20:43:18] [INFO ] [Nat]Added 65 Read/Feed constraints in 23 ms returned sat
[2024-05-31 20:43:19] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:43:19] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:43:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2024-05-31 20:43:19] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 36 ms.
[2024-05-31 20:43:19] [INFO ] Added : 2 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 78 ms.
[2024-05-31 20:43:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:19] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:19] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-31 20:43:19] [INFO ] [Real]Added 65 Read/Feed constraints in 25 ms returned sat
[2024-05-31 20:43:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:19] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-31 20:43:19] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-31 20:43:19] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-31 20:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-31 20:43:19] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 27 ms.
[2024-05-31 20:43:19] [INFO ] Added : 1 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 86 ms.
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:43:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:43:20] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-31 20:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-31 20:43:20] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 26 ms.
[2024-05-31 20:43:20] [INFO ] Added : 1 causal constraints over 1 iterations in 70 ms. Result :sat
Minimization took 84 ms.
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:43:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 20:43:20] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-31 20:43:20] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-31 20:43:20] [INFO ] Added : 2 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 76 ms.
[2024-05-31 20:43:21] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:43:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:21] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-31 20:43:21] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:43:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:21] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-31 20:43:21] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:43:21] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-05-31 20:43:21] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 37 ms.
[2024-05-31 20:43:21] [INFO ] Added : 1 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 12, 5, 9, 5, 5, 11, 3, 4, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 12, 5, 9, 5, 5, 11, 3, 4, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 195 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.8 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 195 transition count 611
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 63 place count 170 transition count 455
Iterating global reduction 1 with 25 rules applied. Total rules applied 88 place count 170 transition count 455
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 112 place count 170 transition count 431
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 127 place count 155 transition count 401
Iterating global reduction 2 with 15 rules applied. Total rules applied 142 place count 155 transition count 401
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 155 transition count 397
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 149 transition count 385
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 149 transition count 385
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 164 place count 143 transition count 361
Iterating global reduction 3 with 6 rules applied. Total rules applied 170 place count 143 transition count 361
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 175 place count 138 transition count 351
Iterating global reduction 3 with 5 rules applied. Total rules applied 180 place count 138 transition count 351
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 184 place count 134 transition count 335
Iterating global reduction 3 with 4 rules applied. Total rules applied 188 place count 134 transition count 335
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 130 transition count 319
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 130 transition count 319
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 126 transition count 311
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 126 transition count 311
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 208 place count 122 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 122 transition count 303
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 216 place count 118 transition count 295
Iterating global reduction 3 with 4 rules applied. Total rules applied 220 place count 118 transition count 295
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 224 place count 114 transition count 287
Iterating global reduction 3 with 4 rules applied. Total rules applied 228 place count 114 transition count 287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 111 transition count 281
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 111 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 242 place count 111 transition count 273
Applied a total of 242 rules in 147 ms. Remains 111 /222 variables (removed 111) and now considering 273/648 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 111/222 places, 273/648 transitions.
[2024-05-31 20:43:21] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
Found an invariant !
This invariant on transitions {35=1, 90=1, 126=1, 162=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 86=1, 138=1, 170=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :[4, 36, 1, 0, 0, 0, 4, 2, 0, 5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 36, 5, 9, 5, 5, 11, 3, 4, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:43:22] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
// Phase 1: matrix 178 rows 111 cols
[2024-05-31 20:43:22] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5, 36, 5, 9, 5, 5, 11, 3, 4, 7] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (2 resets) in 1160 ms. (861 steps per ms)
BEST_FIRST walk for 10000010 steps (23 resets) in 4732 ms. (2112 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 721, 5, 479, 6, 6, 2086, 492, 6, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:43:27] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:43:27] [INFO ] Invariant cache hit.
[2024-05-31 20:43:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:43:28] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 20:43:28] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:28] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 20:43:28] [INFO ] Added : 19 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 32 ms.
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:28] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 20:43:28] [INFO ] Added : 30 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Added 33 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:43:28] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 13 ms.
[2024-05-31 20:43:28] [INFO ] Added : 6 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:43:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:28] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-31 20:43:29] [INFO ] Added : 7 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:43:29] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 13 ms.
[2024-05-31 20:43:29] [INFO ] Added : 6 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:43:29] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 20:43:29] [INFO ] Added : 7 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Added 33 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:43:29] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 12 ms.
[2024-05-31 20:43:29] [INFO ] Added : 4 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Real]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:43:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:43:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:43:29] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 15 ms.
[2024-05-31 20:43:29] [INFO ] Added : 11 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:43:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:30] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 20:43:30] [INFO ] Added : 21 causal constraints over 5 iterations in 73 ms. Result :sat
Minimization took 38 ms.
[2024-05-31 20:43:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Real]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:43:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:43:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 20:43:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:43:30] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 20:43:30] [INFO ] Added : 9 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 721, 5, 479, 6, 6, 2086, 492, 6, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 1396, 5, 479, 6, 7, 2086, 492, 6, 30] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 111/111 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-05-31 20:43:39] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:43:39] [INFO ] Invariant cache hit.
[2024-05-31 20:43:39] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-31 20:43:39] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:43:39] [INFO ] Invariant cache hit.
[2024-05-31 20:43:39] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 20:43:40] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-31 20:43:40] [INFO ] Redundant transitions in 14 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-31 20:43:40] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:43:40] [INFO ] Invariant cache hit.
[2024-05-31 20:43:40] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 178/288 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/289 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 146 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 178/288 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/289 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 239/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 417 constraints, problems are : Problem set: 0 solved, 271 unsolved in 10039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
After SMT, in 17993ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 18012ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18413 ms. Remains : 111/111 places, 273/273 transitions.
[2024-05-31 20:43:58] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
Found an invariant !
This invariant on transitions {35=1, 90=1, 126=1, 162=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 86=1, 138=1, 170=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :[0, 0, 1, 2, 2, 2, 5, 2, 3, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 1396, 5, 479, 6, 7, 2086, 492, 6, 30] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:43:58] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:43:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 1396, 5, 479, 6, 7, 2086, 492, 6, 30] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1197 ms. (834 steps per ms)
BEST_FIRST walk for 10000010 steps (22 resets) in 4570 ms. (2187 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1180, 7948, 5, 479, 6, 7, 2086, 492, 6, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:44:03] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:44:03] [INFO ] Invariant cache hit.
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:44:04] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 20:44:04] [INFO ] [Real]Added 33 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:44:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:04] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:44:04] [INFO ] Added : 19 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 33 ms.
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:04] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 20:44:04] [INFO ] Added : 30 causal constraints over 7 iterations in 91 ms. Result :sat
Minimization took 37 ms.
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:44:04] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:44:04] [INFO ] Added : 6 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:44:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:44:04] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:44:04] [INFO ] Added : 7 causal constraints over 4 iterations in 50 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:05] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:44:05] [INFO ] Added : 6 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:05] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:44:05] [INFO ] Added : 7 causal constraints over 2 iterations in 35 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Added 33 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:44:05] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-31 20:44:05] [INFO ] Added : 4 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:44:05] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:44:05] [INFO ] Added : 11 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:05] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:44:06] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:06] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 14 ms.
[2024-05-31 20:44:06] [INFO ] Added : 21 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 33 ms.
[2024-05-31 20:44:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:06] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:06] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:44:06] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:44:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:44:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:44:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:44:06] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:44:06] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:44:06] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:44:06] [INFO ] Added : 9 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1180, 7948, 5, 479, 6, 7, 2086, 492, 6, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1180, 15627, 5, 479, 6, 7, 2086, 492, 6, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 10 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Applied a total of 0 rules in 39 ms. Remains 111 /111 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 111/111 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Applied a total of 0 rules in 8 ms. Remains 111 /111 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-05-31 20:44:45] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:44:45] [INFO ] Invariant cache hit.
[2024-05-31 20:44:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 20:44:45] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:44:45] [INFO ] Invariant cache hit.
[2024-05-31 20:44:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 20:44:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 20:44:45] [INFO ] Redundant transitions in 3 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-31 20:44:45] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:44:45] [INFO ] Invariant cache hit.
[2024-05-31 20:44:45] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 178/288 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/289 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 146 constraints, problems are : Problem set: 0 solved, 271 unsolved in 6964 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 178/288 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 33/145 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 1/289 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 239/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 417 constraints, problems are : Problem set: 0 solved, 271 unsolved in 10002 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
After SMT, in 17170ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 17173ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17428 ms. Remains : 111/111 places, 273/273 transitions.
[2024-05-31 20:45:02] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
Found an invariant !
This invariant on transitions {35=1, 90=1, 126=1, 162=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 86=1, 138=1, 170=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :[0, 0, 3, 1, 1, 1, 2147483647, 2147483647, 1, 9]
Current structural bounds on expressions (after cover walk) : Max Seen:[1180, 15627, 5, 479, 6, 7, +inf, +inf, 6, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:45:02] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:45:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1180, 15627, 5, 479, 6, 7, +inf, +inf, 6, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (3 resets) in 1138 ms. (877 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 8000008 steps (16 resets) in 3668 ms. (2180 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1180, 15627, 5, 479, 6, 7, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:45:07] [INFO ] Flow matrix only has 178 transitions (discarded 95 similar events)
[2024-05-31 20:45:07] [INFO ] Invariant cache hit.
[2024-05-31 20:45:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:45:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 20:45:07] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:07] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 19 ms.
[2024-05-31 20:45:07] [INFO ] Added : 19 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 32 ms.
[2024-05-31 20:45:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:45:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:45:07] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:45:07] [INFO ] Added : 30 causal constraints over 7 iterations in 91 ms. Result :sat
Minimization took 40 ms.
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:45:08] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-31 20:45:08] [INFO ] Added : 6 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:08] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-31 20:45:08] [INFO ] Added : 7 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:45:08] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-31 20:45:08] [INFO ] Added : 6 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 32 ms.
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:08] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 20:45:08] [INFO ] Added : 7 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:45:08] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:09] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 10 ms.
[2024-05-31 20:45:09] [INFO ] Added : 20 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:45:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:45:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:09] [INFO ] Computed and/alt/rep : 56/266/53 causal constraints (skipped 123 transitions) in 9 ms.
[2024-05-31 20:45:09] [INFO ] Added : 9 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1180, 15627, 5, 479, 6, 7, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 273/273 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 109 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 109 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 109 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 108 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 108 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 107 transition count 261
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 107 transition count 261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 106 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 106 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 105 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 105 transition count 257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 104 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 104 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 103 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 103 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 102 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 102 transition count 251
Applied a total of 20 rules in 23 ms. Remains 102 /111 variables (removed 9) and now considering 251/273 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 102/111 places, 251/273 transitions.
[2024-05-31 20:45:42] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
Found an invariant !
This invariant on transitions {32=1, 78=1, 113=1, 155=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 76=1, 111=1, 149=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :[3, 27, 2, 0, 0, 0, 0, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:45:42] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:45:42] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1266 ms. (789 steps per ms)
BEST_FIRST walk for 8000005 steps (16 resets) in 3560 ms. (2246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:45:47] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:45:47] [INFO ] Invariant cache hit.
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-31 20:45:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:45:47] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:47] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:45:47] [INFO ] Added : 12 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:47] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:45:47] [INFO ] Added : 32 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 34 ms.
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:47] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 12 ms.
[2024-05-31 20:45:47] [INFO ] Added : 10 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:48] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:45:48] [INFO ] Added : 11 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:48] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-31 20:45:48] [INFO ] Added : 11 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:48] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:45:48] [INFO ] Added : 11 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:45:48] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:45:48] [INFO ] Added : 35 causal constraints over 9 iterations in 105 ms. Result :sat
Minimization took 37 ms.
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:45:48] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:45:48] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:45:48] [INFO ] Added : 11 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 251/251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 251/251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2024-05-31 20:46:22] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:46:22] [INFO ] Invariant cache hit.
[2024-05-31 20:46:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 20:46:22] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:46:22] [INFO ] Invariant cache hit.
[2024-05-31 20:46:22] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:46:22] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-31 20:46:22] [INFO ] Redundant transitions in 3 ms returned []
Running 249 sub problems to find dead transitions.
[2024-05-31 20:46:22] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:46:22] [INFO ] Invariant cache hit.
[2024-05-31 20:46:22] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 163/264 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 30/133 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 249 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/265 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 134 constraints, problems are : Problem set: 0 solved, 249 unsolved in 6071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 163/264 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 30/133 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 32/165 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 1/265 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 217/383 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (OVERLAPS) 0/265 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 383 constraints, problems are : Problem set: 0 solved, 249 unsolved in 8584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 14822ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 14826ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15085 ms. Remains : 102/102 places, 251/251 transitions.
[2024-05-31 20:46:37] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
Found an invariant !
This invariant on transitions {32=1, 78=1, 113=1, 155=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {30=1, 76=1, 111=1, 149=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :[3, 23, 2, 2, 2, 2, 2, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40003 steps (9 resets) in 866 ms. (46 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 158 ms. (251 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
[2024-05-31 20:46:38] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:46:38] [INFO ] Invariant cache hit.
[2024-05-31 20:46:38] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 107/128 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/137 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 109/246 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 27/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/252 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 12/264 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/265 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/265 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 134 constraints, problems are : Problem set: 0 solved, 6 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 107/128 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 9/137 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 109/246 variables, 66/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 6/252 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 12/264 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/265 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/265 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/265 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 140 constraints, problems are : Problem set: 0 solved, 6 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 99 transition count 246
Applied a total of 6 rules in 8 ms. Remains 99 /102 variables (removed 3) and now considering 246/251 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 99/102 places, 246/251 transitions.
RANDOM walk for 40005 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 349815 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 6
Probabilistic random walk after 349815 steps, saw 231620 distinct states, run finished after 3006 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-31 20:46:41] [INFO ] Flow matrix only has 158 transitions (discarded 88 similar events)
// Phase 1: matrix 158 rows 99 cols
[2024-05-31 20:46:41] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:46:41] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 105/126 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/135 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 106/241 variables, 65/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 25/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/247 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 9/256 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 1/257 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/257 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/257 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 128 constraints, problems are : Problem set: 0 solved, 6 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 105/126 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 9/135 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 106/241 variables, 65/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 25/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 6/247 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 9/256 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1/257 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/257 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/257 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 134 constraints, problems are : Problem set: 0 solved, 6 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 30000 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 246/246 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 98 transition count 242
Applied a total of 4 rules in 10 ms. Remains 98 /99 variables (removed 1) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 98/99 places, 242/246 transitions.
RANDOM walk for 40006 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 27 ms. (1428 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 315507 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 5
Probabilistic random walk after 315507 steps, saw 209530 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2024-05-31 20:47:15] [INFO ] Flow matrix only has 156 transitions (discarded 86 similar events)
// Phase 1: matrix 156 rows 98 cols
[2024-05-31 20:47:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:47:15] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/119 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 9/128 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 109/237 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 25/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/243 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 10/253 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/254 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/254 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 127 constraints, problems are : Problem set: 0 solved, 5 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 101/119 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/128 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 109/237 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 25/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/243 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 10/253 variables, 10/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/254 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/254 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/254 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 132 constraints, problems are : Problem set: 0 solved, 5 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 20:47:46] [INFO ] Flow matrix only has 156 transitions (discarded 86 similar events)
[2024-05-31 20:47:46] [INFO ] Invariant cache hit.
[2024-05-31 20:47:46] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:47:46] [INFO ] Flow matrix only has 156 transitions (discarded 86 similar events)
[2024-05-31 20:47:46] [INFO ] Invariant cache hit.
[2024-05-31 20:47:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:47:46] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-31 20:47:46] [INFO ] Redundant transitions in 2 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-31 20:47:46] [INFO ] Flow matrix only has 156 transitions (discarded 86 similar events)
[2024-05-31 20:47:46] [INFO ] Invariant cache hit.
[2024-05-31 20:47:46] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 156/253 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/126 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/254 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 127 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5579 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 156/253 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/126 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 32/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 1/254 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 208/367 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 367 constraints, problems are : Problem set: 0 solved, 240 unsolved in 7975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 13718ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 13722ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13930 ms. Remains : 98/98 places, 242/242 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 98 transition count 149
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 101 place count 91 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 90 transition count 148
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 102 place count 90 transition count 129
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 140 place count 71 transition count 129
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 172 place count 55 transition count 113
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 179 place count 48 transition count 99
Iterating global reduction 3 with 7 rules applied. Total rules applied 186 place count 48 transition count 99
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 193 place count 41 transition count 85
Iterating global reduction 3 with 7 rules applied. Total rules applied 200 place count 41 transition count 85
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 207 place count 34 transition count 71
Iterating global reduction 3 with 7 rules applied. Total rules applied 214 place count 34 transition count 71
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 221 place count 34 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 221 place count 34 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 33 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 227 place count 31 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 230 place count 31 transition count 60
Applied a total of 230 rules in 16 ms. Remains 31 /98 variables (removed 67) and now considering 60/242 (removed 182) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 60 rows 31 cols
[2024-05-31 20:47:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:48:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:48:00] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 20:48:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 20:48:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:48:00] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-31 20:48:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:48:00] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 20:48:00] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 20:48:00] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 161 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1180, 15627, 5, 479, 6, 8, 337, 1207] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:48:00] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:48:00] [INFO ] Invariant cache hit.
[2024-05-31 20:48:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:48:00] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:48:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:48:00] [INFO ] [Real]Added 30 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:48:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:48:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:48:00] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:48:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:48:00] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-31 20:48:00] [INFO ] Added : 12 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 95 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 95 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 91 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 91 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 91 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 89 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 89 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 87 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 87 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 85 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 85 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 83 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 83 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 81 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 81 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 79 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 79 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 78 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 78 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 77 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 77 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 76 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 75 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 75 transition count 192
Applied a total of 54 rules in 33 ms. Remains 75 /102 variables (removed 27) and now considering 192/251 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 75/102 places, 192/251 transitions.
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-31 20:48:00] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 912 ms. (1095 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 401 ms. (2487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[787] Max Struct:[+inf]
[2024-05-31 20:48:01] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:01] [INFO ] Invariant cache hit.
[2024-05-31 20:48:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:01] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:48:01] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:48:01] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:48:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:48:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:01] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:48:01] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:48:01] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-31 20:48:01] [INFO ] Added : 7 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[787] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[787] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 20:48:02] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:02] [INFO ] Invariant cache hit.
[2024-05-31 20:48:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:48:02] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:02] [INFO ] Invariant cache hit.
[2024-05-31 20:48:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:48:02] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-31 20:48:02] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:48:02] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:02] [INFO ] Invariant cache hit.
[2024-05-31 20:48:02] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4433 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7147ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7323 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-31 20:48:10] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[787] Max Struct:[+inf]
[2024-05-31 20:48:10] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[787] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 885 ms. (1128 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 392 ms. (2544 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1427] Max Struct:[+inf]
[2024-05-31 20:48:11] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:11] [INFO ] Invariant cache hit.
[2024-05-31 20:48:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:48:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:48:11] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:48:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:48:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:11] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 20:48:11] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:48:11] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-31 20:48:11] [INFO ] Added : 7 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1427] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1427] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 20:48:12] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:12] [INFO ] Invariant cache hit.
[2024-05-31 20:48:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 20:48:12] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:12] [INFO ] Invariant cache hit.
[2024-05-31 20:48:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:48:12] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-31 20:48:12] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:48:12] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:12] [INFO ] Invariant cache hit.
[2024-05-31 20:48:12] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2628 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6899ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6902ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7073 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-31 20:48:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[1427] Max Struct:[+inf]
[2024-05-31 20:48:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1427] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 861 ms. (1160 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 394 ms. (2531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1427] Max Struct:[+inf]
[2024-05-31 20:48:21] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:21] [INFO ] Invariant cache hit.
[2024-05-31 20:48:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:21] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:48:21] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:48:21] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:48:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:48:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:21] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:48:21] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:48:21] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-31 20:48:21] [INFO ] Added : 7 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1427] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1427] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 20:48:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:22] [INFO ] Invariant cache hit.
[2024-05-31 20:48:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 20:48:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:22] [INFO ] Invariant cache hit.
[2024-05-31 20:48:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:48:22] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-31 20:48:22] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:48:22] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:22] [INFO ] Invariant cache hit.
[2024-05-31 20:48:22] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2519 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6949ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7117 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-31 20:48:29] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1427] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2001494 steps, run timeout after 3001 ms. (steps per millisecond=666 ) properties seen :0 out of 1
Probabilistic random walk after 2001494 steps, saw 1240601 distinct states, run finished after 3001 ms. (steps per millisecond=666 ) properties seen :0
[2024-05-31 20:48:32] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:32] [INFO ] Invariant cache hit.
[2024-05-31 20:48:32] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 920 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 75/75 places, 192/192 transitions.
RANDOM walk for 40001 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1863221 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :0 out of 1
Probabilistic random walk after 1863221 steps, saw 1142797 distinct states, run finished after 3001 ms. (steps per millisecond=620 ) properties seen :0
[2024-05-31 20:48:36] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:36] [INFO ] Invariant cache hit.
[2024-05-31 20:48:36] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 887 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 17 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 20:48:37] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:37] [INFO ] Invariant cache hit.
[2024-05-31 20:48:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 20:48:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:38] [INFO ] Invariant cache hit.
[2024-05-31 20:48:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:48:38] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-31 20:48:38] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:48:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:48:38] [INFO ] Invariant cache hit.
[2024-05-31 20:48:38] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2642 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4163 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6912ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6914ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7115 ms. Remains : 75/75 places, 192/192 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 75 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 69 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 87 place count 69 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 109 place count 58 transition count 100
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 143 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 34 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 27 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 178 place count 20 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 185 place count 20 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 192 place count 20 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 18 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 18 transition count 30
Applied a total of 199 rules in 17 ms. Remains 18 /75 variables (removed 57) and now considering 30/192 (removed 162) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-31 20:48:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:48:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:45] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 20:48:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:48:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:48:45] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:48:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:45] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:48:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:48:45] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:48:45] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 93 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1427] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-01 in 45030 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:48:45] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:48:45] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52] Max Struct:[+inf]
[2024-05-31 20:48:45] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:48:45] [INFO ] Invariant cache hit.
[2024-05-31 20:48:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:48:45] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:48:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:48:45] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:48:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:48:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:48:45] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:48:45] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:48:45] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-31 20:48:45] [INFO ] Added : 32 causal constraints over 7 iterations in 88 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[52] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[603] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 96 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 96 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 92 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 92 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 92 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 91 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 91 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 90 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 90 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 89 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 89 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 88 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 88 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 87 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 86 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 86 transition count 214
Applied a total of 36 rules in 13 ms. Remains 86 /102 variables (removed 16) and now considering 214/251 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 86/102 places, 214/251 transitions.
[2024-05-31 20:48:45] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
Found an invariant !
This invariant on transitions {27=1, 62=1, 94=1, 128=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 65=1, 97=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[44]
Current structural bounds on expressions (after cover walk) : Max Seen:[603] Max Struct:[+inf]
[2024-05-31 20:48:45] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
// Phase 1: matrix 133 rows 86 cols
[2024-05-31 20:48:45] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[603] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 998 ms. (1001 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 467 ms. (2136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[603] Max Struct:[+inf]
[2024-05-31 20:48:47] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:48:47] [INFO ] Invariant cache hit.
[2024-05-31 20:48:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:48:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:48:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 20:48:47] [INFO ] [Real]Added 19 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:48:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:48:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:48:47] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:48:47] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:48:47] [INFO ] Computed and/alt/rep : 63/212/57 causal constraints (skipped 74 transitions) in 8 ms.
[2024-05-31 20:48:47] [INFO ] Added : 20 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[603] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[13997] Max Struct:[+inf]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 20:48:49] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:48:49] [INFO ] Invariant cache hit.
[2024-05-31 20:48:49] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 20:48:49] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:48:49] [INFO ] Invariant cache hit.
[2024-05-31 20:48:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 20:48:49] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-31 20:48:49] [INFO ] Redundant transitions in 0 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-31 20:48:49] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:48:49] [INFO ] Invariant cache hit.
[2024-05-31 20:48:49] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 1/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 108 constraints, problems are : Problem set: 0 solved, 212 unsolved in 5446 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 32/139 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 1/219 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 180/320 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 320 constraints, problems are : Problem set: 0 solved, 212 unsolved in 6633 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 12216ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 12220ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12415 ms. Remains : 86/86 places, 214/214 transitions.
[2024-05-31 20:49:01] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
Found an invariant !
This invariant on transitions {27=1, 62=1, 94=1, 128=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 65=1, 97=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[26]
Current structural bounds on expressions (after cover walk) : Max Seen:[13997] Max Struct:[+inf]
[2024-05-31 20:49:01] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:49:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[13997] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 956 ms. (1044 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 442 ms. (2257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[13997] Max Struct:[+inf]
[2024-05-31 20:49:03] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:49:03] [INFO ] Invariant cache hit.
[2024-05-31 20:49:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:49:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:49:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 20:49:03] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:49:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:49:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:49:03] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:49:03] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:49:03] [INFO ] Computed and/alt/rep : 63/212/57 causal constraints (skipped 74 transitions) in 7 ms.
[2024-05-31 20:49:03] [INFO ] Added : 20 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[13997] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[204343] Max Struct:[+inf]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 86/86 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-31 20:49:33] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:49:33] [INFO ] Invariant cache hit.
[2024-05-31 20:49:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 20:49:33] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:49:33] [INFO ] Invariant cache hit.
[2024-05-31 20:49:33] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 20:49:33] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-31 20:49:33] [INFO ] Redundant transitions in 2 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-31 20:49:33] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:49:33] [INFO ] Invariant cache hit.
[2024-05-31 20:49:33] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 1/219 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 108 constraints, problems are : Problem set: 0 solved, 212 unsolved in 5347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 133/218 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 19/107 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 32/139 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (OVERLAPS) 1/219 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 180/320 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 320 constraints, problems are : Problem set: 0 solved, 212 unsolved in 6538 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 86/86 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 0/0 constraints]
After SMT, in 12033ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 12039ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12269 ms. Remains : 86/86 places, 214/214 transitions.
[2024-05-31 20:49:45] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
Found an invariant !
This invariant on transitions {27=1, 62=1, 94=1, 128=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 65=1, 97=1, 128=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:49:45] [INFO ] Flow matrix only has 133 transitions (discarded 81 similar events)
[2024-05-31 20:49:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 982 ms. (1017 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-02 in 61549 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:49:46] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:49:46] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 20:49:46] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:49:46] [INFO ] Invariant cache hit.
[2024-05-31 20:49:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:49:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:49:46] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:49:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:49:46] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:49:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:49:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:49:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:49:46] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:49:46] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:49:46] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:49:46] [INFO ] Added : 10 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 98 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 98 transition count 245
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 93 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 93 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 93 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 91 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 91 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 89 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 221
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 87 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 87 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 85 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 85 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 83 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 83 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 81 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 81 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 80 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 80 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 79 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 78 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 77 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 76 transition count 191
Applied a total of 55 rules in 14 ms. Remains 76 /102 variables (removed 26) and now considering 191/251 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 76/102 places, 191/251 transitions.
[2024-05-31 20:49:46] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 87=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 55=1, 101=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 20:49:47] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-31 20:49:47] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 894 ms. (1117 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 396 ms. (2518 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 20:49:48] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:49:48] [INFO ] Invariant cache hit.
[2024-05-31 20:49:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:49:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:49:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:49:48] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:49:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:49:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:49:48] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:49:48] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:49:48] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 20:49:48] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-31 20:49:48] [INFO ] Added : 9 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 20:49:48] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:49:48] [INFO ] Invariant cache hit.
[2024-05-31 20:49:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 20:49:48] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:49:48] [INFO ] Invariant cache hit.
[2024-05-31 20:49:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:49:48] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-31 20:49:48] [INFO ] Redundant transitions in 2 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 20:49:48] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:49:48] [INFO ] Invariant cache hit.
[2024-05-31 20:49:48] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2496 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4606 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 7205ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7208ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7380 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-31 20:49:55] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 87=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 55=1, 101=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2002281 steps, run timeout after 3001 ms. (steps per millisecond=667 ) properties seen :0 out of 1
Probabilistic random walk after 2002281 steps, saw 1238967 distinct states, run finished after 3001 ms. (steps per millisecond=667 ) properties seen :0
[2024-05-31 20:49:59] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:49:59] [INFO ] Invariant cache hit.
[2024-05-31 20:49:59] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/186 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 94/169 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/186 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/190 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/193 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 172ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 76/76 places, 191/191 transitions.
RANDOM walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1958608 steps, run timeout after 3001 ms. (steps per millisecond=652 ) properties seen :0 out of 1
Probabilistic random walk after 1958608 steps, saw 1212229 distinct states, run finished after 3001 ms. (steps per millisecond=652 ) properties seen :0
[2024-05-31 20:50:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:02] [INFO ] Invariant cache hit.
[2024-05-31 20:50:02] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/186 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 94/169 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/186 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/190 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/193 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 20:50:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:02] [INFO ] Invariant cache hit.
[2024-05-31 20:50:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:50:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:02] [INFO ] Invariant cache hit.
[2024-05-31 20:50:02] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:50:02] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-31 20:50:02] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 20:50:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:02] [INFO ] Invariant cache hit.
[2024-05-31 20:50:02] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2578 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4400 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 7090ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7249 ms. Remains : 76/76 places, 191/191 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 76 transition count 110
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 69 transition count 110
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 88 place count 69 transition count 97
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 114 place count 56 transition count 97
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 144 place count 41 transition count 82
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 34 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 34 transition count 68
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 27 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 27 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 179 place count 20 transition count 40
Iterating global reduction 2 with 7 rules applied. Total rules applied 186 place count 20 transition count 40
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 193 place count 20 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 193 place count 20 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 19 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 18 transition count 32
Applied a total of 197 rules in 13 ms. Remains 18 /76 variables (removed 58) and now considering 32/191 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 18 cols
[2024-05-31 20:50:09] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 20:50:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:09] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 20:50:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:50:09] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:50:09] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:50:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:09] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:50:09] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:50:09] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:50:09] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 81 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-03 in 23124 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:50:09] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:50:09] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[+inf]
[2024-05-31 20:50:09] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:50:09] [INFO ] Invariant cache hit.
[2024-05-31 20:50:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:50:09] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:50:09] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:50:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:50:09] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:50:09] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:10] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-31 20:50:10] [INFO ] Added : 11 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 95 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 95 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 91 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 91 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 91 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 89 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 89 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 87 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 87 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 85 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 85 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 83 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 83 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 81 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 80 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 80 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 79 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 79 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 78 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 78 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 77 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 77 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 76 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 75 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 75 transition count 192
Applied a total of 54 rules in 12 ms. Remains 75 /102 variables (removed 27) and now considering 192/251 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 75/102 places, 192/251 transitions.
[2024-05-31 20:50:10] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[9] Max Struct:[+inf]
[2024-05-31 20:50:10] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-31 20:50:10] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 934 ms. (1069 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 437 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[823] Max Struct:[+inf]
[2024-05-31 20:50:11] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:50:11] [INFO ] Invariant cache hit.
[2024-05-31 20:50:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:11] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:50:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:50:11] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:50:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:50:11] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:11] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-31 20:50:11] [INFO ] Added : 4 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[823] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[823] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 20:50:12] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:50:12] [INFO ] Invariant cache hit.
[2024-05-31 20:50:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:50:12] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:50:12] [INFO ] Invariant cache hit.
[2024-05-31 20:50:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:50:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-31 20:50:12] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:50:12] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:50:12] [INFO ] Invariant cache hit.
[2024-05-31 20:50:12] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2347 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4285 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6744ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6747ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6923 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-31 20:50:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:50:19] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-31 20:50:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 944 ms. (1058 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-04 in 10533 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:50:20] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:50:20] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 20:50:20] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:50:20] [INFO ] Invariant cache hit.
[2024-05-31 20:50:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:20] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:50:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:50:20] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:50:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:20] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:50:20] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:20] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:50:20] [INFO ] Added : 6 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 98 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 98 transition count 245
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 93 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 93 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 93 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 91 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 91 transition count 225
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 89 transition count 221
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 221
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 87 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 87 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 85 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 85 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 83 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 83 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 81 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 81 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 80 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 80 transition count 199
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 79 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 78 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 77 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 76 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 76 transition count 191
Applied a total of 55 rules in 12 ms. Remains 76 /102 variables (removed 26) and now considering 191/251 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/102 places, 191/251 transitions.
[2024-05-31 20:50:20] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-31 20:50:20] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-31 20:50:20] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 944 ms. (1058 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 418 ms. (2386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-31 20:50:22] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:22] [INFO ] Invariant cache hit.
[2024-05-31 20:50:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:22] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:50:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:50:22] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:50:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:50:22] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:50:22] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-31 20:50:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:50:22] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 10 ms.
[2024-05-31 20:50:22] [INFO ] Added : 14 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 20:50:22] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:22] [INFO ] Invariant cache hit.
[2024-05-31 20:50:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:50:22] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:22] [INFO ] Invariant cache hit.
[2024-05-31 20:50:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:50:22] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-31 20:50:22] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 20:50:22] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:22] [INFO ] Invariant cache hit.
[2024-05-31 20:50:22] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2633 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 189/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 286 constraints, problems are : Problem set: 0 solved, 189 unsolved in 4371 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
After SMT, in 7118ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7300 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-31 20:50:29] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2032010 steps, run timeout after 3001 ms. (steps per millisecond=677 ) properties seen :0 out of 1
Probabilistic random walk after 2032010 steps, saw 1257166 distinct states, run finished after 3001 ms. (steps per millisecond=677 ) properties seen :0
[2024-05-31 20:50:32] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:50:32] [INFO ] Invariant cache hit.
[2024-05-31 20:50:32] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/186 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/69 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/75 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 94/169 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/186 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/186 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/190 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/193 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3762 steps, including 115 resets, run visited all 1 properties in 9 ms. (steps per millisecond=418 )
Parikh walk visited 1 properties in 13 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-05 in 12588 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:50:32] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:50:32] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 20:50:32] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:50:32] [INFO ] Invariant cache hit.
[2024-05-31 20:50:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:50:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:50:33] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:50:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:50:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:33] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:50:33] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:50:33] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:50:33] [INFO ] Added : 11 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 98 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 98 transition count 246
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 93 transition count 234
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 93 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 93 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 91 transition count 226
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 91 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 89 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 87 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 87 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 85 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 85 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 83 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 83 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 81 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 81 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 80 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 80 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 79 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 78 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 77 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 76 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 76 transition count 192
Applied a total of 54 rules in 19 ms. Remains 76 /102 variables (removed 26) and now considering 192/251 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 76/102 places, 192/251 transitions.
[2024-05-31 20:50:33] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 103=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 54=1, 84=1, 113=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 20:50:33] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-31 20:50:33] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 937 ms. (1066 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 427 ms. (2336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 20:50:34] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:34] [INFO ] Invariant cache hit.
[2024-05-31 20:50:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:50:34] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:50:34] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:50:34] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:50:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:34] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:50:34] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:34] [INFO ] Computed and/alt/rep : 62/198/53 causal constraints (skipped 63 transitions) in 8 ms.
[2024-05-31 20:50:34] [INFO ] Added : 6 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 20:50:34] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:34] [INFO ] Invariant cache hit.
[2024-05-31 20:50:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:50:34] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:34] [INFO ] Invariant cache hit.
[2024-05-31 20:50:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:50:35] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-31 20:50:35] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:50:35] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:35] [INFO ] Invariant cache hit.
[2024-05-31 20:50:35] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 8272ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 8275ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8456 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-31 20:50:43] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {32=1, 57=1, 103=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 54=1, 84=1, 113=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40002 steps (10 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2072590 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :0 out of 1
Probabilistic random walk after 2072590 steps, saw 1282011 distinct states, run finished after 3001 ms. (steps per millisecond=690 ) properties seen :0
[2024-05-31 20:50:46] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:46] [INFO ] Invariant cache hit.
[2024-05-31 20:50:46] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/45 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/169 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/175 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/176 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/45 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/169 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/175 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 192/192 transitions.
RANDOM walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2059489 steps, run timeout after 3001 ms. (steps per millisecond=686 ) properties seen :0 out of 1
Probabilistic random walk after 2059489 steps, saw 1273989 distinct states, run finished after 3001 ms. (steps per millisecond=686 ) properties seen :0
[2024-05-31 20:50:49] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:49] [INFO ] Invariant cache hit.
[2024-05-31 20:50:49] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/45 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/169 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/175 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/176 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/45 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 124/169 variables, 57/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/175 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 20:50:49] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:49] [INFO ] Invariant cache hit.
[2024-05-31 20:50:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 20:50:49] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:49] [INFO ] Invariant cache hit.
[2024-05-31 20:50:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:50:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-31 20:50:50] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:50:50] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:50:50] [INFO ] Invariant cache hit.
[2024-05-31 20:50:50] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 96 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3726 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 118/194 variables, 76/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 18/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 286 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 8158ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 8159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8359 ms. Remains : 76/76 places, 192/192 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 76 transition count 111
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 69 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 68 transition count 110
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 90 place count 68 transition count 98
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 114 place count 56 transition count 98
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 144 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 151 place count 34 transition count 69
Iterating global reduction 3 with 7 rules applied. Total rules applied 158 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 165 place count 27 transition count 55
Iterating global reduction 3 with 7 rules applied. Total rules applied 172 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 179 place count 20 transition count 41
Iterating global reduction 3 with 7 rules applied. Total rules applied 186 place count 20 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 193 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 20 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 18 transition count 33
Applied a total of 197 rules in 26 ms. Remains 18 /76 variables (removed 58) and now considering 33/192 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 18 cols
[2024-05-31 20:50:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:50:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 20:50:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:50:58] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:50:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:50:58] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:50:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:50:58] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:50:58] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:50:58] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 102 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-07 in 25368 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:50:58] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:50:58] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8] Max Struct:[+inf]
[2024-05-31 20:50:58] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:50:58] [INFO ] Invariant cache hit.
[2024-05-31 20:50:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:58] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:50:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:50:58] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:50:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:50:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:50:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:50:58] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:50:58] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:50:58] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:50:58] [INFO ] Added : 35 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 95 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 95 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 91 transition count 232
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 91 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 90 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 89 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 88 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 87 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 86 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 85 transition count 212
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 84 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 83 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 82 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 81 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 80 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 80 transition count 202
Applied a total of 46 rules in 15 ms. Remains 80 /102 variables (removed 22) and now considering 202/251 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 80/102 places, 202/251 transitions.
[2024-05-31 20:50:58] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-05-31 20:50:58] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2024-05-31 20:50:58] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 949 ms. (1052 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 408 ms. (2444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[581] Max Struct:[+inf]
[2024-05-31 20:51:00] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:51:00] [INFO ] Invariant cache hit.
[2024-05-31 20:51:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:51:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:51:00] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:51:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:00] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:51:00] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:51:00] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 7 ms.
[2024-05-31 20:51:00] [INFO ] Added : 9 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[581] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[581] Max Struct:[+inf]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-31 20:51:01] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:51:01] [INFO ] Invariant cache hit.
[2024-05-31 20:51:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 20:51:01] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:51:01] [INFO ] Invariant cache hit.
[2024-05-31 20:51:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:51:01] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-31 20:51:01] [INFO ] Redundant transitions in 0 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-31 20:51:01] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:51:01] [INFO ] Invariant cache hit.
[2024-05-31 20:51:01] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 2892 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 301 constraints, problems are : Problem set: 0 solved, 200 unsolved in 4526 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 7521ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 7525ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7702 ms. Remains : 80/80 places, 202/202 transitions.
[2024-05-31 20:51:09] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:51:09] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:51:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 936 ms. (1067 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-11 in 11827 ms.
Starting property specific reduction for FunctionPointer-PT-b004-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:51:10] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
// Phase 1: matrix 163 rows 102 cols
[2024-05-31 20:51:10] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (3 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[+inf]
[2024-05-31 20:51:10] [INFO ] Flow matrix only has 163 transitions (discarded 88 similar events)
[2024-05-31 20:51:10] [INFO ] Invariant cache hit.
[2024-05-31 20:51:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:51:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:51:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 20:51:10] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:51:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:51:10] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:51:10] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:51:10] [INFO ] Computed and/alt/rep : 69/368/65 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-31 20:51:10] [INFO ] Added : 11 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 251/251 transitions.
Graph (complete) has 429 edges and 102 vertex of which 95 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 95 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 91 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 91 transition count 230
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 91 transition count 226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 89 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 87 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 85 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 85 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 83 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 83 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 81 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 79 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 78 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 77 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 76 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 75 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 74 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 74 transition count 188
Applied a total of 58 rules in 23 ms. Remains 74 /102 variables (removed 28) and now considering 188/251 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 74/102 places, 188/251 transitions.
[2024-05-31 20:51:10] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[19] Max Struct:[+inf]
[2024-05-31 20:51:10] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-31 20:51:10] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 927 ms. (1077 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 400 ms. (2493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1996] Max Struct:[+inf]
[2024-05-31 20:51:11] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:11] [INFO ] Invariant cache hit.
[2024-05-31 20:51:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:51:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:51:11] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:51:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:51:11] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:51:11] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 7 ms.
[2024-05-31 20:51:12] [INFO ] Added : 5 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1996] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1996] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 20:51:12] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:12] [INFO ] Invariant cache hit.
[2024-05-31 20:51:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:51:12] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:12] [INFO ] Invariant cache hit.
[2024-05-31 20:51:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:51:12] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-31 20:51:12] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-31 20:51:12] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:12] [INFO ] Invariant cache hit.
[2024-05-31 20:51:12] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 186 unsolved in 2448 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 186/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 280 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4127 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6672ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6673ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6845 ms. Remains : 74/74 places, 188/188 transitions.
[2024-05-31 20:51:18] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[1996] Max Struct:[+inf]
[2024-05-31 20:51:18] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1996] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 867 ms. (1152 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 385 ms. (2590 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1996] Max Struct:[+inf]
[2024-05-31 20:51:20] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:20] [INFO ] Invariant cache hit.
[2024-05-31 20:51:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:51:20] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:51:20] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:51:20] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:51:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:51:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:51:20] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:51:20] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:51:20] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 6 ms.
[2024-05-31 20:51:20] [INFO ] Added : 5 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1996] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1996] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-31 20:51:20] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:20] [INFO ] Invariant cache hit.
[2024-05-31 20:51:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 20:51:20] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:20] [INFO ] Invariant cache hit.
[2024-05-31 20:51:20] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:51:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-31 20:51:20] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-31 20:51:20] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:20] [INFO ] Invariant cache hit.
[2024-05-31 20:51:20] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 186 unsolved in 2420 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 186/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 280 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4259 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6771ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6774ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6922 ms. Remains : 74/74 places, 188/188 transitions.
[2024-05-31 20:51:27] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:51:27] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:51:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 883 ms. (1131 steps per ms)
FORMULA FunctionPointer-PT-b004-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b004-UpperBounds-13 in 18139 ms.
[2024-05-31 20:51:28] [INFO ] Flatten gal took : 54 ms
[2024-05-31 20:51:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 20:51:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 251 transitions and 1020 arcs took 5 ms.
Total runtime 494250 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-b004-UpperBounds-01
Could not compute solution for formula : FunctionPointer-PT-b004-UpperBounds-03
Could not compute solution for formula : FunctionPointer-PT-b004-UpperBounds-05
Could not compute solution for formula : FunctionPointer-PT-b004-UpperBounds-07

BK_STOP 1717188688740

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FunctionPointer-PT-b004-UpperBounds-01
ub formula formula --maxsum=/tmp/1547/ub_0_
ub formula name FunctionPointer-PT-b004-UpperBounds-03
ub formula formula --maxsum=/tmp/1547/ub_1_
ub formula name FunctionPointer-PT-b004-UpperBounds-05
ub formula formula --maxsum=/tmp/1547/ub_2_
ub formula name FunctionPointer-PT-b004-UpperBounds-07
ub formula formula --maxsum=/tmp/1547/ub_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FunctionPointer-PT-b004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-b004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602900229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b004.tgz
mv FunctionPointer-PT-b004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;