fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640603000245
Last Updated
July 7, 2024

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1569.739 307626.00 414364.00 475.50 ? inf inf 16 0 1 ? 0 0 16 0 ? 0 0 16 ? 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-171640603000245.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-b016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000245
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:06 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-b016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717188824135

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-b016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:53:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:53:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:53:45] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-31 20:53:45] [INFO ] Transformed 306 places.
[2024-05-31 20:53:45] [INFO ] Transformed 840 transitions.
[2024-05-31 20:53:45] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:53:45] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-31 20:53:45] [INFO ] Computed 4 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 16, 1, +inf, 16, +inf, +inf]
RANDOM walk for 10004 steps (8 resets) in 48 ms. (204 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-14 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-09 16 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (24 resets) in 79 ms. (875 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 6, 7, 15, 1, 5, 2] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
[2024-05-31 20:53:45] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-31 20:53:45] [INFO ] Invariant cache hit.
[2024-05-31 20:53:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 20:53:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:53:45] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-31 20:53:46] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 20:53:46] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-31 20:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Nat]Added 65 Read/Feed constraints in 15 ms returned sat
[2024-05-31 20:53:46] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 19 ms to minimize.
[2024-05-31 20:53:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2024-05-31 20:53:46] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 76 ms.
[2024-05-31 20:53:46] [INFO ] Added : 2 causal constraints over 1 iterations in 136 ms. Result :sat
Minimization took 88 ms.
[2024-05-31 20:53:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-31 20:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 20:53:46] [INFO ] [Nat]Added 65 Read/Feed constraints in 15 ms returned sat
[2024-05-31 20:53:47] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-31 20:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-31 20:53:47] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 56 ms.
[2024-05-31 20:53:47] [INFO ] Added : 1 causal constraints over 1 iterations in 96 ms. Result :sat
Minimization took 78 ms.
[2024-05-31 20:53:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:53:47] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:47] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-31 20:53:47] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-31 20:53:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:47] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-31 20:53:47] [INFO ] [Nat]Added 65 Read/Feed constraints in 16 ms returned sat
[2024-05-31 20:53:47] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:53:47] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-31 20:53:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2024-05-31 20:53:47] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2024-05-31 20:53:47] [INFO ] Added : 1 causal constraints over 1 iterations in 86 ms. Result :sat
Minimization took 78 ms.
[2024-05-31 20:53:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:53:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:53:48] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:53:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-31 20:53:48] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 33 ms.
[2024-05-31 20:53:48] [INFO ] Added : 2 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 84 ms.
[2024-05-31 20:53:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-31 20:53:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 20:53:48] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:53:48] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 5 ms to minimize.
[2024-05-31 20:53:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-31 20:53:48] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 27 ms.
[2024-05-31 20:53:49] [INFO ] Added : 2 causal constraints over 1 iterations in 77 ms. Result :sat
Minimization took 78 ms.
[2024-05-31 20:53:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-31 20:53:49] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 27 ms.
[2024-05-31 20:53:49] [INFO ] Added : 2 causal constraints over 1 iterations in 79 ms. Result :sat
Minimization took 80 ms.
[2024-05-31 20:53:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-31 20:53:49] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:53:49] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 30 ms.
[2024-05-31 20:53:49] [INFO ] Added : 1 causal constraints over 1 iterations in 75 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 6, 7, 15, 1, 5, 2] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 6, 7, 15, 1, 5, 2] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
Support contains 7 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 191 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.7 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 191 transition count 605
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 70 place count 165 transition count 463
Iterating global reduction 1 with 26 rules applied. Total rules applied 96 place count 165 transition count 463
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 132 place count 165 transition count 427
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 145 place count 152 transition count 401
Iterating global reduction 2 with 13 rules applied. Total rules applied 158 place count 152 transition count 401
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 145 transition count 387
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 145 transition count 387
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 178 place count 139 transition count 363
Iterating global reduction 2 with 6 rules applied. Total rules applied 184 place count 139 transition count 363
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 133 transition count 351
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 133 transition count 351
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 201 place count 128 transition count 331
Iterating global reduction 2 with 5 rules applied. Total rules applied 206 place count 128 transition count 331
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 211 place count 123 transition count 311
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 123 transition count 311
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 221 place count 118 transition count 301
Iterating global reduction 2 with 5 rules applied. Total rules applied 226 place count 118 transition count 301
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 231 place count 113 transition count 291
Iterating global reduction 2 with 5 rules applied. Total rules applied 236 place count 113 transition count 291
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 241 place count 108 transition count 281
Iterating global reduction 2 with 5 rules applied. Total rules applied 246 place count 108 transition count 281
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 251 place count 103 transition count 271
Iterating global reduction 2 with 5 rules applied. Total rules applied 256 place count 103 transition count 271
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 261 place count 98 transition count 261
Iterating global reduction 2 with 5 rules applied. Total rules applied 266 place count 98 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 272 place count 98 transition count 255
Applied a total of 272 rules in 133 ms. Remains 98 /222 variables (removed 124) and now considering 255/648 (removed 393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 98/222 places, 255/648 transitions.
[2024-05-31 20:53:50] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :[5, 8, 3, 1, 3, 2, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 8, 7, 15, 3, 5, 7] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
[2024-05-31 20:53:50] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-31 20:53:50] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16, 8, 7, 15, 3, 5, 7] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1254 ms. (796 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4445 ms. (1574 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 485, 529, 15, 146, 139, 350] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
[2024-05-31 20:53:56] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:53:56] [INFO ] Invariant cache hit.
[2024-05-31 20:53:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:53:56] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 20:53:56] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-31 20:53:56] [INFO ] Added : 8 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 33 ms.
[2024-05-31 20:53:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 20:53:56] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:53:56] [INFO ] Added : 17 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:53:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:56] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:53:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:53:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 20:53:56] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:53:57] [INFO ] Added : 15 causal constraints over 4 iterations in 59 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:53:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:53:57] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-31 20:53:57] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:53:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2024-05-31 20:53:57] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-31 20:53:57] [INFO ] Added : 22 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 32 ms.
[2024-05-31 20:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:53:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:57] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:53:57] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 20:53:57] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-31 20:53:57] [INFO ] Added : 36 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 40 ms.
[2024-05-31 20:53:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:53:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:53:58] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:53:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:53:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:53:58] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:53:58] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:53:58] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:53:58] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:53:58] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:53:58] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:53:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 165 ms
[2024-05-31 20:53:58] [INFO ] Added : 12 causal constraints over 5 iterations in 236 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 485, 529, 15, 146, 139, 350] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-b016-UpperBounds-03 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 485, 529, 146, 139, 350] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-31 20:54:03] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :[2, 7, 2, 2, 2, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 485, 529, 146, 139, 350] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:54:03] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 485, 529, 146, 139, 350] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1129 ms. (884 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3886 ms. (1543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:54:08] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:08] [INFO ] Invariant cache hit.
[2024-05-31 20:54:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:08] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:54:08] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:54:08] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-31 20:54:09] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 13 ms.
[2024-05-31 20:54:09] [INFO ] Added : 8 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:54:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 20:54:09] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 24 ms.
[2024-05-31 20:54:09] [INFO ] Added : 17 causal constraints over 5 iterations in 85 ms. Result :sat
Minimization took 32 ms.
[2024-05-31 20:54:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 20:54:09] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:54:09] [INFO ] Added : 15 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:54:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:09] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:54:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-31 20:54:10] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-31 20:54:10] [INFO ] Added : 22 causal constraints over 8 iterations in 80 ms. Result :sat
Minimization took 32 ms.
[2024-05-31 20:54:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:10] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 20:54:10] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-31 20:54:10] [INFO ] Added : 36 causal constraints over 9 iterations in 99 ms. Result :sat
Minimization took 35 ms.
[2024-05-31 20:54:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:54:10] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:10] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:54:10] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:54:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 176 ms
[2024-05-31 20:54:10] [INFO ] Added : 12 causal constraints over 5 iterations in 237 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 20:54:16] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:16] [INFO ] Invariant cache hit.
[2024-05-31 20:54:16] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 20:54:16] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:16] [INFO ] Invariant cache hit.
[2024-05-31 20:54:16] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:54:16] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-31 20:54:16] [INFO ] Redundant transitions in 10 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-31 20:54:16] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:16] [INFO ] Invariant cache hit.
[2024-05-31 20:54:16] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 253 unsolved in 5468 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 253/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7440 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 13172ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 13183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13422 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-31 20:54:30] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :[4, 8, 3, 2, 2, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:54:30] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 1016 ms. (983 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3887 ms. (1543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:54:35] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:35] [INFO ] Invariant cache hit.
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:35] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:54:35] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:54:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:35] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-31 20:54:35] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 11 ms.
[2024-05-31 20:54:35] [INFO ] Added : 8 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:54:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:35] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 20:54:35] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:54:35] [INFO ] Added : 17 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:35] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:54:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-31 20:54:35] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 11 ms.
[2024-05-31 20:54:35] [INFO ] Added : 15 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:54:35] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:54:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-31 20:54:36] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:54:36] [INFO ] Added : 22 causal constraints over 8 iterations in 80 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:54:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-31 20:54:36] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-31 20:54:36] [INFO ] Added : 36 causal constraints over 9 iterations in 97 ms. Result :sat
Minimization took 35 ms.
[2024-05-31 20:54:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:54:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:54:36] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:54:36] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:54:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 190 ms
[2024-05-31 20:54:36] [INFO ] Added : 12 causal constraints over 5 iterations in 252 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/98 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 20:54:42] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:42] [INFO ] Invariant cache hit.
[2024-05-31 20:54:42] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 20:54:42] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:42] [INFO ] Invariant cache hit.
[2024-05-31 20:54:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:54:42] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-31 20:54:42] [INFO ] Redundant transitions in 3 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-31 20:54:42] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:42] [INFO ] Invariant cache hit.
[2024-05-31 20:54:42] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 253 unsolved in 5234 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 158/256 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 253/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 378 constraints, problems are : Problem set: 0 solved, 253 unsolved in 7296 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 12698ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 12702ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12928 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-31 20:54:55] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
Found an invariant !
This invariant on transitions {31=1, 34=1, 37=1, 84=1, 117=1, 150=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 86=1, 135=1, 155=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 6) seen :[3, 7, 3, 3, 3, 7]
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40003 steps (8 resets) in 1087 ms. (36 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
[2024-05-31 20:54:56] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:54:56] [INFO ] Invariant cache hit.
[2024-05-31 20:54:56] [INFO ] State equation strengthened by 24 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) 17/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 97/119 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/128 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 110/238 variables, 64/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 22/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/244 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 12/256 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/256 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 125 constraints, problems are : Problem set: 0 solved, 5 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 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) 17/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 97/119 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/128 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 110/238 variables, 64/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 22/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/244 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/244 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 12/256 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/256 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/256 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 130 constraints, problems are : Problem set: 0 solved, 5 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22983 ms.
Support contains 5 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Graph (complete) has 419 edges and 98 vertex of which 95 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 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 95 transition count 250
Applied a total of 6 rules in 12 ms. Remains 95 /98 variables (removed 3) and now considering 250/255 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 95/98 places, 250/255 transitions.
RANDOM walk for 40000 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 420581 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 5
Probabilistic random walk after 420581 steps, saw 261810 distinct states, run finished after 3004 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-31 20:55:22] [INFO ] Flow matrix only has 153 transitions (discarded 97 similar events)
// Phase 1: matrix 153 rows 95 cols
[2024-05-31 20:55:22] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:55:22] [INFO ] State equation strengthened by 21 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) 17/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 95/117 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/126 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 107/233 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/239 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/248 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 119 constraints, problems are : Problem set: 0 solved, 5 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 21/21 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) 17/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 95/117 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/126 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 107/233 variables, 63/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/239 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 9/248 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/248 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/248 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 124 constraints, problems are : Problem set: 0 solved, 5 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22306 ms.
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 95 /95 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 95/95 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 95 /95 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2024-05-31 20:55:45] [INFO ] Flow matrix only has 153 transitions (discarded 97 similar events)
[2024-05-31 20:55:45] [INFO ] Invariant cache hit.
[2024-05-31 20:55:45] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 20:55:45] [INFO ] Flow matrix only has 153 transitions (discarded 97 similar events)
[2024-05-31 20:55:45] [INFO ] Invariant cache hit.
[2024-05-31 20:55:45] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-31 20:55:45] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-31 20:55:45] [INFO ] Redundant transitions in 3 ms returned []
Running 248 sub problems to find dead transitions.
[2024-05-31 20:55:45] [INFO ] Flow matrix only has 153 transitions (discarded 97 similar events)
[2024-05-31 20:55:45] [INFO ] Invariant cache hit.
[2024-05-31 20:55:45] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 153/248 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 21/119 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 0/248 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 119 constraints, problems are : Problem set: 0 solved, 248 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 153/248 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 21/119 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 248/367 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 367 constraints, problems are : Problem set: 0 solved, 248 unsolved in 7119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 0/0 constraints]
After SMT, in 12285ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 12288ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12475 ms. Remains : 95/95 places, 250/250 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 95 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 93 transition count 151
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 101 place count 93 transition count 130
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 143 place count 72 transition count 130
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 177 place count 55 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 184 place count 48 transition count 99
Iterating global reduction 2 with 7 rules applied. Total rules applied 191 place count 48 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 198 place count 41 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 205 place count 41 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 212 place count 34 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 219 place count 34 transition count 71
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 226 place count 34 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 226 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 3 with 2 rules applied. Total rules applied 228 place count 33 transition count 63
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 234 place count 30 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 30 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 237 place count 29 transition count 60
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 29 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 240 place count 29 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 241 place count 29 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 29 transition count 57
Applied a total of 242 rules in 23 ms. Remains 29 /95 variables (removed 66) and now considering 57/250 (removed 193) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 57 rows 29 cols
[2024-05-31 20:55:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:55:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:55:58] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 20:55:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:55:58] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-31 20:55:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:55:58] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 20:55:58] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 20:55:58] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 178 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[16, 485, 598, 146, 216, 404] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-00
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:55:58] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-31 20:55:58] [INFO ] Computed 3 invariants in 1 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 (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2024-05-31 20:55:58] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:55:58] [INFO ] Invariant cache hit.
[2024-05-31 20:55:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:55:58] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:55:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:55:58] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:55:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:55:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:55:58] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:55:58] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:55:58] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:55:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 20:55:58] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-31 20:55:58] [INFO ] Added : 5 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 94 transition count 239
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 94 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 94 transition count 235
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 90 transition count 227
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 90 transition count 227
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 90 transition count 223
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 88 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 88 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 86 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 86 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 84 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 84 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 82 transition count 203
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 82 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 80 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 80 transition count 199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 78 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 78 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 76 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 76 transition count 191
Applied a total of 52 rules in 40 ms. Remains 76 /98 variables (removed 22) and now considering 191/255 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 76/98 places, 191/255 transitions.
[2024-05-31 20:55:58] [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 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-31 20:55:58] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-31 20:55:58] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 858 ms. (1164 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 538 ms. (1855 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17] Max Struct:[+inf]
[2024-05-31 20:55:59] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:55:59] [INFO ] Invariant cache hit.
[2024-05-31 20:56:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:00] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:56:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:00] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:56:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:56:00] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:56:00] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:56:00] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:56:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:56:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-05-31 20:56:00] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-31 20:56:00] [INFO ] Added : 7 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17] 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 4 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 20:56:00] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:00] [INFO ] Invariant cache hit.
[2024-05-31 20:56:00] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:56:00] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:00] [INFO ] Invariant cache hit.
[2024-05-31 20:56:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-31 20:56:00] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 20:56:00] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:00] [INFO ] Invariant cache hit.
[2024-05-31 20:56:00] [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 2833 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 4593 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 7532ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7703 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-31 20:56:07] [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 1 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 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[17] Max Struct:[+inf]
[2024-05-31 20:56:08] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[17] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 923 ms. (1082 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17] Max Struct:[+inf]
[2024-05-31 20:56:09] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:09] [INFO ] Invariant cache hit.
[2024-05-31 20:56:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:56:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:09] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:56:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:56:09] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 20:56:09] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:56:09] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-31 20:56:09] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:56:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2024-05-31 20:56:09] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-31 20:56:09] [INFO ] Added : 7 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17] 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 4 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.
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:56:09] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:09] [INFO ] Invariant cache hit.
[2024-05-31 20:56:09] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:56:09] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:09] [INFO ] Invariant cache hit.
[2024-05-31 20:56:09] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:09] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-31 20:56:09] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 20:56:09] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:56:09] [INFO ] Invariant cache hit.
[2024-05-31 20:56:09] [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 2742 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 4628 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 7467ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7637 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-31 20:56:17] [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 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[17] Max Struct:[+inf]
RANDOM walk for 27702 steps (6 resets) in 95 ms. (288 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[17] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-00 in 19382 ms.
Starting property specific reduction for FunctionPointer-PT-b016-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:56:17] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-31 20:56:17] [INFO ] Computed 3 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 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2024-05-31 20:56:17] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:56:17] [INFO ] Invariant cache hit.
[2024-05-31 20:56:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:17] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:56:17] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:56:17] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:56:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:17] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:56:17] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:56:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-05-31 20:56:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-31 20:56:17] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:56:17] [INFO ] Added : 17 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Graph (complete) has 419 edges and 98 vertex of which 95 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 95 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 92 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 92 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 92 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 90 transition count 230
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 90 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 88 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 88 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 86 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 86 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 84 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 84 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 82 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 82 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 80 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 80 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 78 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 78 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 76 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 76 transition count 198
Applied a total of 46 rules in 13 ms. Remains 76 /98 variables (removed 22) and now considering 198/255 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 76/98 places, 198/255 transitions.
[2024-05-31 20:56:17] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {26=1, 57=1, 86=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 58=1, 103=1, 117=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:56:17] [INFO ] Flow matrix only has 118 transitions (discarded 80 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-31 20:56:17] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 924 ms. (1081 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-01 +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-b016-UpperBounds-01 in 1350 ms.
Starting property specific reduction for FunctionPointer-PT-b016-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:56:18] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-31 20:56:18] [INFO ] Computed 3 invariants in 5 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 (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2024-05-31 20:56:18] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:56:18] [INFO ] Invariant cache hit.
[2024-05-31 20:56:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:18] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:56:18] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:56:18] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:56:19] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:56:19] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:56:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-31 20:56:19] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-31 20:56:19] [INFO ] Added : 15 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Graph (complete) has 419 edges and 98 vertex of which 95 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 95 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 92 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 92 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 92 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 88 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 88 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 88 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 86 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 84 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 84 transition count 210
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 82 transition count 206
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 82 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 80 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 80 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 78 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 78 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 76 transition count 194
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 76 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 74 transition count 190
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 74 transition count 190
Applied a total of 54 rules in 15 ms. Remains 74 /98 variables (removed 24) and now considering 190/255 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 74/98 places, 190/255 transitions.
[2024-05-31 20:56:19] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {24=1, 51=1, 80=1, 111=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 54=1, 99=1, 113=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 :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2024-05-31 20:56:19] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
// Phase 1: matrix 114 rows 74 cols
[2024-05-31 20:56:19] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 933 ms. (1070 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 477 ms. (2092 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1168] Max Struct:[+inf]
[2024-05-31 20:56:20] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:20] [INFO ] Invariant cache hit.
[2024-05-31 20:56:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:56:20] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:56:20] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:56:20] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:56:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:20] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:56:20] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:56:20] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:56:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-31 20:56:20] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 61 transitions) in 6 ms.
[2024-05-31 20:56:20] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1168] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1168] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 190/190 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 74/74 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-31 20:56:23] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:23] [INFO ] Invariant cache hit.
[2024-05-31 20:56:23] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 20:56:23] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:23] [INFO ] Invariant cache hit.
[2024-05-31 20:56:23] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:56:23] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-31 20:56:23] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-31 20:56:23] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:23] [INFO ] Invariant cache hit.
[2024-05-31 20:56:23] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 92 constraints, problems are : Problem set: 0 solved, 188 unsolved in 2966 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 188/280 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 280 constraints, problems are : Problem set: 0 solved, 188 unsolved in 4720 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 7777ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 7779ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7943 ms. Remains : 74/74 places, 190/190 transitions.
[2024-05-31 20:56:31] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {24=1, 51=1, 80=1, 111=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {27=1, 54=1, 99=1, 113=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:[1168] Max Struct:[+inf]
[2024-05-31 20:56:31] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1168] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 999 ms. (1000 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 457 ms. (2183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1255] Max Struct:[+inf]
[2024-05-31 20:56:32] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:32] [INFO ] Invariant cache hit.
[2024-05-31 20:56:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:32] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:56:32] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:56:32] [INFO ] [Real]Added 15 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:56:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:56:32] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:56:32] [INFO ] [Nat]Added 15 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:56:32] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:56:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-31 20:56:32] [INFO ] Computed and/alt/rep : 60/163/51 causal constraints (skipped 61 transitions) in 11 ms.
[2024-05-31 20:56:32] [INFO ] Added : 21 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1255] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1255] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 74/74 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-31 20:56:35] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:35] [INFO ] Invariant cache hit.
[2024-05-31 20:56:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 20:56:35] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:35] [INFO ] Invariant cache hit.
[2024-05-31 20:56:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-31 20:56:35] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-31 20:56:35] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2024-05-31 20:56:35] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:35] [INFO ] Invariant cache hit.
[2024-05-31 20:56:35] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 92 constraints, problems are : Problem set: 0 solved, 188 unsolved in 3019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 188/280 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 280 constraints, problems are : Problem set: 0 solved, 188 unsolved in 4846 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints]
After SMT, in 7975ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 7978ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8139 ms. Remains : 74/74 places, 190/190 transitions.
[2024-05-31 20:56:43] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
Found an invariant !
This invariant on transitions {24=1, 51=1, 80=1, 111=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 54=1, 99=1, 113=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:56:43] [INFO ] Flow matrix only has 114 transitions (discarded 76 similar events)
[2024-05-31 20:56:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000007 steps (2 resets) in 936 ms. (1067 steps per ms)
FORMULA FunctionPointer-PT-b016-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-b016-UpperBounds-02 in 25664 ms.
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-06
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:56:44] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-31 20:56:44] [INFO ] Computed 3 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 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 20:56:44] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:56:44] [INFO ] Invariant cache hit.
[2024-05-31 20:56:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:44] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:56:44] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:56:44] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:56:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:56:44] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:56:44] [INFO ] [Nat]Added 24 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:56:44] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 20:56:44] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:56:44] [INFO ] Added : 20 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 30 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:[1] Max Struct:[+inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Graph (complete) has 419 edges and 98 vertex of which 95 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 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 95 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 92 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 92 transition count 238
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 92 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 89 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 89 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 88 transition count 220
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 87 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 86 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 85 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 84 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 83 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 82 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 82 transition count 208
Applied a total of 40 rules in 12 ms. Remains 82 /98 variables (removed 16) and now considering 208/255 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 82/98 places, 208/255 transitions.
[2024-05-31 20:56:44] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=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 :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 20:56:44] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-31 20:56:44] [INFO ] Computed 3 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 1060 ms. (942 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 614 ms. (1626 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[+inf]
[2024-05-31 20:56:46] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:46] [INFO ] Invariant cache hit.
[2024-05-31 20:56:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:56:46] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:56:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:46] [INFO ] [Real]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:56:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:46] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:56:46] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:56:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-31 20:56:46] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 7 ms.
[2024-05-31 20:56:46] [INFO ] Added : 16 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-31 20:56:46] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:46] [INFO ] Invariant cache hit.
[2024-05-31 20:56:46] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 20:56:46] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:46] [INFO ] Invariant cache hit.
[2024-05-31 20:56:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:47] [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:56:47] [INFO ] Redundant transitions in 0 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-31 20:56:47] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:47] [INFO ] Invariant cache hit.
[2024-05-31 20:56:47] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 4027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 9463ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9635 ms. Remains : 82/82 places, 208/208 transitions.
[2024-05-31 20:56:56] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=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 :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[249] Max Struct:[+inf]
[2024-05-31 20:56:56] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 967 ms. (1033 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 589 ms. (1694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[+inf]
[2024-05-31 20:56:58] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:58] [INFO ] Invariant cache hit.
[2024-05-31 20:56:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:56:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:58] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:56:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:56:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:56:58] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:56:58] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:56:58] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-31 20:56:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-31 20:56:58] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2024-05-31 20:56:58] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-31 20:56:58] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:58] [INFO ] Invariant cache hit.
[2024-05-31 20:56:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 20:56:58] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:58] [INFO ] Invariant cache hit.
[2024-05-31 20:56:58] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:56:58] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-31 20:56:58] [INFO ] Redundant transitions in 0 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-31 20:56:58] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:56:58] [INFO ] Invariant cache hit.
[2024-05-31 20:56:58] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 3951 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 9102ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9266 ms. Remains : 82/82 places, 208/208 transitions.
[2024-05-31 20:57:07] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 32=1, 34=1, 63=1, 94=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 60=1, 91=1, 123=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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[249] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1966292 steps, run timeout after 3001 ms. (steps per millisecond=655 ) properties seen :0 out of 1
Probabilistic random walk after 1966292 steps, saw 1223813 distinct states, run finished after 3001 ms. (steps per millisecond=655 ) properties seen :0
[2024-05-31 20:57:10] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:57:10] [INFO ] Invariant cache hit.
[2024-05-31 20:57:10] [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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 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 398 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 208/208 transitions.
RANDOM walk for 40002 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1963874 steps, run timeout after 3001 ms. (steps per millisecond=654 ) properties seen :0 out of 1
Probabilistic random walk after 1963874 steps, saw 1222310 distinct states, run finished after 3001 ms. (steps per millisecond=654 ) properties seen :0
[2024-05-31 20:57:14] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:57:14] [INFO ] Invariant cache hit.
[2024-05-31 20:57:14] [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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/85 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 100/185 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 18/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/191 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/205 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/209 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/210 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/75 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/85 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 100/185 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/191 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/205 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/209 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/210 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/210 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 406 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-31 20:57:14] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:57:14] [INFO ] Invariant cache hit.
[2024-05-31 20:57:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 20:57:15] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:57:15] [INFO ] Invariant cache hit.
[2024-05-31 20:57:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:57:15] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-31 20:57:15] [INFO ] Redundant transitions in 0 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-31 20:57:15] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-31 20:57:15] [INFO ] Invariant cache hit.
[2024-05-31 20:57:15] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (OVERLAPS) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 103 constraints, problems are : Problem set: 0 solved, 206 unsolved in 4028 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 128/210 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 206/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 0/210 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 309 constraints, problems are : Problem set: 0 solved, 206 unsolved in 5378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints]
After SMT, in 9515ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9518ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9687 ms. Remains : 82/82 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 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 87 rules applied. Total rules applied 87 place count 82 transition count 121
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 94 place count 75 transition count 121
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 94 place count 75 transition count 105
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 59 transition count 105
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 156 place count 44 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 37 transition count 76
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 37 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 30 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 30 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 23 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 23 transition count 48
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 205 place count 23 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 23 transition count 40
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 207 place count 22 transition count 40
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 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 40
Applied a total of 211 rules in 20 ms. Remains 20 /82 variables (removed 62) and now considering 40/208 (removed 168) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 20 cols
[2024-05-31 20:57:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:57:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:57:24] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 20:57:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:57:24] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:57:24] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:57:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:57:24] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:57:24] [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:57:24] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:57:24] [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 103 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[249] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-06 in 40227 ms.
Starting property specific reduction for FunctionPointer-PT-b016-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:57:24] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-31 20:57:24] [INFO ] Computed 3 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 (2 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:57:24] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:57:24] [INFO ] Invariant cache hit.
[2024-05-31 20:57:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:57:24] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:57:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:57:24] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:57:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:57:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:57:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:57:24] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:57:24] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:57:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 20:57:24] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 12 ms.
[2024-05-31 20:57:25] [INFO ] Added : 36 causal constraints over 9 iterations in 108 ms. Result :sat
Minimization took 38 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 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Graph (complete) has 419 edges and 98 vertex of which 95 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 95 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 92 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 92 transition count 242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 18 place count 92 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 89 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 89 transition count 230
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 32 place count 89 transition count 222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 88 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 88 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 87 transition count 216
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 86 transition count 214
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 85 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 84 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 83 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 82 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 82 transition count 206
Applied a total of 46 rules in 11 ms. Remains 82 /98 variables (removed 16) and now considering 206/255 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/98 places, 206/255 transitions.
[2024-05-31 20:57:25] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=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 :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2024-05-31 20:57:25] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
// Phase 1: matrix 126 rows 82 cols
[2024-05-31 20:57:25] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1020 ms. (979 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299] Max Struct:[+inf]
[2024-05-31 20:57:26] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:26] [INFO ] Invariant cache hit.
[2024-05-31 20:57:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:57:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:57:26] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:57:26] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:57:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:57:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:57:26] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:57:26] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:57:26] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 71 transitions) in 6 ms.
[2024-05-31 20:57:26] [INFO ] Added : 8 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-31 20:57:27] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:27] [INFO ] Invariant cache hit.
[2024-05-31 20:57:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 20:57:27] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:27] [INFO ] Invariant cache hit.
[2024-05-31 20:57:27] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:57:27] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-31 20:57:27] [INFO ] Redundant transitions in 0 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-31 20:57:27] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:27] [INFO ] Invariant cache hit.
[2024-05-31 20:57:27] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 204 unsolved in 3159 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 204/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 307 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5364 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 8631ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8801 ms. Remains : 82/82 places, 206/206 transitions.
[2024-05-31 20:57:35] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=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 :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[299] Max Struct:[+inf]
[2024-05-31 20:57:35] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[299] 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 581 ms. (1718 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299] Max Struct:[+inf]
[2024-05-31 20:57:37] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:37] [INFO ] Invariant cache hit.
[2024-05-31 20:57:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 20:57:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:57:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:57:37] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:57:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:57:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:57:37] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:57:37] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:57:37] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 71 transitions) in 7 ms.
[2024-05-31 20:57:37] [INFO ] Added : 8 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-31 20:57:37] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:37] [INFO ] Invariant cache hit.
[2024-05-31 20:57:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 20:57:37] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:37] [INFO ] Invariant cache hit.
[2024-05-31 20:57:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:57:37] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-31 20:57:37] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-31 20:57:37] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:37] [INFO ] Invariant cache hit.
[2024-05-31 20:57:37] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 204 unsolved in 3090 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 204/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 307 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 8311ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8476 ms. Remains : 82/82 places, 206/206 transitions.
[2024-05-31 20:57:46] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {30=1, 63=1, 93=1, 121=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {24=1, 57=1, 87=1, 122=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[299] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 70 ms. (563 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 2081966 steps, run timeout after 3001 ms. (steps per millisecond=693 ) properties seen :0 out of 1
Probabilistic random walk after 2081966 steps, saw 1295815 distinct states, run finished after 3001 ms. (steps per millisecond=693 ) properties seen :0
[2024-05-31 20:57:49] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:49] [INFO ] Invariant cache hit.
[2024-05-31 20:57: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) 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) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/105 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 91/196 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/202 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/202 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/208 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 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) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/105 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/105 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 91/196 variables, 53/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/202 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/202 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/208 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 443 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 82/82 places, 206/206 transitions.
RANDOM walk for 40000 steps (8 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2062540 steps, run timeout after 3001 ms. (steps per millisecond=687 ) properties seen :0 out of 1
Probabilistic random walk after 2062540 steps, saw 1283724 distinct states, run finished after 3001 ms. (steps per millisecond=687 ) properties seen :0
[2024-05-31 20:57:52] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:52] [INFO ] Invariant cache hit.
[2024-05-31 20:57:52] [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) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 7/105 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 91/196 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/202 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/202 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/208 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 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) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/98 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/105 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/105 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 91/196 variables, 53/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/202 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/202 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/208 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/208 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 435 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-31 20:57:53] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:53] [INFO ] Invariant cache hit.
[2024-05-31 20:57:53] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:57:53] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:53] [INFO ] Invariant cache hit.
[2024-05-31 20:57:53] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:57:53] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-31 20:57:53] [INFO ] Redundant transitions in 0 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-31 20:57:53] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-31 20:57:53] [INFO ] Invariant cache hit.
[2024-05-31 20:57:53] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/208 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 103 constraints, problems are : Problem set: 0 solved, 204 unsolved in 2959 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 126/208 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 204/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 307 constraints, problems are : Problem set: 0 solved, 204 unsolved in 5136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 8202ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8380 ms. Remains : 82/82 places, 206/206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 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 86 rules applied. Total rules applied 86 place count 82 transition count 120
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 76 transition count 120
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 92 place count 76 transition count 103
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 126 place count 59 transition count 103
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 156 place count 44 transition count 88
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 163 place count 37 transition count 74
Iterating global reduction 2 with 7 rules applied. Total rules applied 170 place count 37 transition count 74
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 177 place count 30 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 184 place count 30 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 191 place count 23 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 198 place count 23 transition count 46
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 205 place count 23 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 205 place count 23 transition count 38
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 207 place count 22 transition count 38
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 3 with 4 rules applied. Total rules applied 211 place count 20 transition count 38
Applied a total of 211 rules in 11 ms. Remains 20 /82 variables (removed 62) and now considering 38/206 (removed 168) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 38 rows 20 cols
[2024-05-31 20:58:01] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:58:01] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:58:01] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 20:58:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:58:01] [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:58:01] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:58:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:01] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:58:01] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:58:01] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:58:01] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 84 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[299] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-11 in 37114 ms.
Starting property specific reduction for FunctionPointer-PT-b016-UpperBounds-15
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:58:01] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-31 20:58:01] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 14 ms. (666 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:58:01] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-31 20:58:01] [INFO ] Invariant cache hit.
[2024-05-31 20:58:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:58:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:58:01] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:58:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:58:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:02] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:58:02] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:58:02] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-31 20:58:02] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:58:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-31 20:58:02] [INFO ] Added : 8 causal constraints over 4 iterations in 124 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 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Graph (complete) has 419 edges and 98 vertex of which 95 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 95 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 91 transition count 234
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 91 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 18 place count 91 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 87 transition count 222
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 87 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 85 transition count 210
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 85 transition count 210
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 36 place count 83 transition count 206
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 83 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 40 place count 81 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 79 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 78 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 77 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 76 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 76 transition count 192
Applied a total of 52 rules in 12 ms. Remains 76 /98 variables (removed 22) and now considering 192/255 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 76/98 places, 192/255 transitions.
[2024-05-31 20:58:02] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=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 :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[9] Max Struct:[+inf]
[2024-05-31 20:58:02] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-31 20:58:02] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 999 ms. (1000 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 520 ms. (1919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[852] Max Struct:[+inf]
[2024-05-31 20:58:03] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:03] [INFO ] Invariant cache hit.
[2024-05-31 20:58:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:58:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:58:03] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:58:03] [INFO ] [Real]Added 17 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:58:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:58:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:03] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:58:03] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:58:04] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 20:58:04] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 8 ms.
[2024-05-31 20:58:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:58:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:58:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-31 20:58:04] [INFO ] Added : 5 causal constraints over 3 iterations in 137 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[852] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[852] 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 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:58:05] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:05] [INFO ] Invariant cache hit.
[2024-05-31 20:58:05] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 20:58:05] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:05] [INFO ] Invariant cache hit.
[2024-05-31 20:58:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:58:05] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-31 20:58:05] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:58:05] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:05] [INFO ] Invariant cache hit.
[2024-05-31 20:58:05] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (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 2901 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 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/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (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 4783 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7795ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7797ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7961 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-31 20:58:13] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=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 :[17]
Current structural bounds on expressions (after cover walk) : Max Seen:[852] Max Struct:[+inf]
[2024-05-31 20:58:13] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[852] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 904 ms. (1104 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[934] Max Struct:[+inf]
[2024-05-31 20:58:14] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:14] [INFO ] Invariant cache hit.
[2024-05-31 20:58:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:14] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:58:14] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:58:14] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:58:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:14] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:58:14] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:58:14] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-31 20:58:14] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 8 ms.
[2024-05-31 20:58:15] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:58:15] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:58:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-31 20:58:15] [INFO ] Added : 5 causal constraints over 3 iterations in 130 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[934] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[934] 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 4 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 4 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:58:16] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:16] [INFO ] Invariant cache hit.
[2024-05-31 20:58:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:58:16] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:16] [INFO ] Invariant cache hit.
[2024-05-31 20:58:16] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:58:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-31 20:58:16] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:58:16] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:16] [INFO ] Invariant cache hit.
[2024-05-31 20:58:16] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (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 3035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 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/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (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 4816 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7949ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7952ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8111 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-31 20:58:24] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[934] Max Struct:[+inf]
[2024-05-31 20:58:24] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[934] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 916 ms. (1090 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 560 ms. (1782 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[934] Max Struct:[+inf]
[2024-05-31 20:58:26] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:26] [INFO ] Invariant cache hit.
[2024-05-31 20:58:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-31 20:58:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:58:26] [INFO ] [Real]Added 17 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:58:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:58:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:58:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:58:26] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:58:26] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:58:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-31 20:58:26] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 7 ms.
[2024-05-31 20:58:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:58:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-31 20:58:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2024-05-31 20:58:26] [INFO ] Added : 5 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[934] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[934] 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 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:58:27] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:27] [INFO ] Invariant cache hit.
[2024-05-31 20:58:27] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 20:58:27] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:27] [INFO ] Invariant cache hit.
[2024-05-31 20:58:27] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:58:27] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-31 20:58:27] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:58:27] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:27] [INFO ] Invariant cache hit.
[2024-05-31 20:58:27] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (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 2902 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 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/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (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 4786 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7788ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7790ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7961 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-31 20:58:35] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {26=1, 54=1, 84=1, 114=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 55=1, 101=1, 116=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 :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[934] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2122870 steps, run timeout after 3001 ms. (steps per millisecond=707 ) properties seen :0 out of 1
Probabilistic random walk after 2122870 steps, saw 1321244 distinct states, run finished after 3002 ms. (steps per millisecond=707 ) properties seen :0
[2024-05-31 20:58:38] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:38] [INFO ] Invariant cache hit.
[2024-05-31 20:58:38] [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) 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/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) 94/170 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (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 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 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) 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 3/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) 94/170 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (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 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 677 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 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2065244 steps, run timeout after 3001 ms. (steps per millisecond=688 ) properties seen :0 out of 1
Probabilistic random walk after 2065244 steps, saw 1285389 distinct states, run finished after 3001 ms. (steps per millisecond=688 ) properties seen :0
[2024-05-31 20:58:42] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:42] [INFO ] Invariant cache hit.
[2024-05-31 20:58:42] [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) 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/76 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 3/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) 94/170 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/176 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/176 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/187 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/187 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/194 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (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 80 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 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) 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) 67/71 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 3/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) 94/170 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/176 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/176 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/187 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/194 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (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 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 673 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:58:43] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:43] [INFO ] Invariant cache hit.
[2024-05-31 20:58:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:58:43] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:43] [INFO ] Invariant cache hit.
[2024-05-31 20:58:43] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:58:43] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-31 20:58:43] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-31 20:58:43] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-31 20:58:43] [INFO ] Invariant cache hit.
[2024-05-31 20:58:43] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (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 2840 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 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/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 118/194 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 190/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (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 4781 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 7716ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7718ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7875 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.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 69 transition count 111
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 98
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 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 2 with 30 rules applied. Total rules applied 144 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 34 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 27 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 179 place count 20 transition count 41
Iterating global reduction 2 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 2 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 3 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 3 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 3 with 2 rules applied. Total rules applied 197 place count 18 transition count 33
Applied a total of 197 rules in 4 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:58:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:58:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:58:51] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:58:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 20:58:51] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:58:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:58:51] [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:58:51] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:58:51] [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 74 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[934] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-15 in 49417 ms.
[2024-05-31 20:58:51] [INFO ] Flatten gal took : 47 ms
[2024-05-31 20:58:51] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 20:58:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 255 transitions and 1036 arcs took 5 ms.
Total runtime 306270 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-b016-UpperBounds-00
Could not compute solution for formula : FunctionPointer-PT-b016-UpperBounds-06
Could not compute solution for formula : FunctionPointer-PT-b016-UpperBounds-11
Could not compute solution for formula : FunctionPointer-PT-b016-UpperBounds-15

BK_STOP 1717189131761

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.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-b016-UpperBounds-00
ub formula formula --maxsum=/tmp/1441/ub_0_
ub formula name FunctionPointer-PT-b016-UpperBounds-06
ub formula formula --maxsum=/tmp/1441/ub_1_
ub formula name FunctionPointer-PT-b016-UpperBounds-11
ub formula formula --maxsum=/tmp/1441/ub_2_
ub formula name FunctionPointer-PT-b016-UpperBounds-15
ub formula formula --maxsum=/tmp/1441/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-b016"
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-b016, 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-171640603000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 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 ;