MCC'2024- Execution of r179-tall-171640601100245

About the Execution of GreatSPN+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
1419.500	266921.00	326827.00	779.20	? 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.r179-tall-171640601100245.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 greatspnxred
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 r179-tall-171640601100245
=====================================================================

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

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:46:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 02:46:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:46:29] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-23 02:46:29] [INFO ] Transformed 306 places.
[2024-05-23 02:46:29] [INFO ] Transformed 840 transitions.
[2024-05-23 02:46:29] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 233 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 11 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-23 02:46:29] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 02:46:29] [INFO ] Computed 4 invariants in 25 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 10000 steps (11 resets) in 46 ms. (212 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (25 resets) in 85 ms. (930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 7, 4, 10, 6, 3, 1, 11] Max Struct:[+inf, +inf, +inf, 16, +inf, 16, +inf, +inf]
[2024-05-23 02:46:29] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-23 02:46:29] [INFO ] Invariant cache hit.
[2024-05-23 02:46:30] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-23 02:46:30] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-23 02:46:30] [INFO ] [Real]Added 65 Read/Feed constraints in 16 ms returned sat
[2024-05-23 02:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-23 02:46:30] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 9 ms to minimize.
[2024-05-23 02:46:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-23 02:46:30] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 60 ms.
[2024-05-23 02:46:30] [INFO ] Added : 2 causal constraints over 1 iterations in 111 ms. Result :sat
Minimization took 86 ms.
[2024-05-23 02:46:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Real]Added 65 Read/Feed constraints in 21 ms returned sat
[2024-05-23 02:46:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Nat]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-23 02:46:31] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-23 02:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2024-05-23 02:46:31] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 64 ms.
[2024-05-23 02:46:31] [INFO ] Added : 1 causal constraints over 1 iterations in 126 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 02:46:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-23 02:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-23 02:46:31] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-23 02:46:31] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-23 02:46:31] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-23 02:46:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2024-05-23 02:46:32] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 39 ms.
[2024-05-23 02:46:32] [INFO ] Added : 1 causal constraints over 1 iterations in 104 ms. Result :sat
Minimization took 75 ms.
[2024-05-23 02:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:46:32] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 35 ms.
[2024-05-23 02:46:32] [INFO ] Added : 3 causal constraints over 1 iterations in 87 ms. Result :sat
Minimization took 104 ms.
[2024-05-23 02:46:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:46:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-23 02:46:32] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:46:33] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-05-23 02:46:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-05-23 02:46:33] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-23 02:46:33] [INFO ] Added : 2 causal constraints over 1 iterations in 78 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 02:46:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Nat]Added 65 Read/Feed constraints in 30 ms returned sat
[2024-05-23 02:46:33] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 30 ms.
[2024-05-23 02:46:33] [INFO ] Added : 2 causal constraints over 1 iterations in 83 ms. Result :sat
Minimization took 84 ms.
[2024-05-23 02:46:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:46:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 02:46:34] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 30 ms.
[2024-05-23 02:46:34] [INFO ] Added : 2 causal constraints over 1 iterations in 81 ms. Result :sat
Minimization took 77 ms.
[2024-05-23 02:46:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:46:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-23 02:46:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:46:34] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 25 ms.
[2024-05-23 02:46:34] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 7, 4, 10, 6, 3, 1, 11] Max Struct:[+inf, +inf, +inf, 16, +inf, 16, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15, 7, 4, 10, 6, 3, 1, 11] Max Struct:[+inf, +inf, +inf, 16, +inf, 16, +inf, +inf]
Support contains 8 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.6 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 140 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 156 ms. Remains : 98/222 places, 255/648 transitions.
[2024-05-23 02:46:34] [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 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :[7, 6, 3, 5, 2, 2, 2, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 7, 4, 10, 6, 3, 2, 11] Max Struct:[+inf, +inf, +inf, 16, +inf, 16, +inf, +inf]
[2024-05-23 02:46:35] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
// Phase 1: matrix 158 rows 98 cols
[2024-05-23 02:46:35] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[15, 7, 4, 10, 6, 3, 2, 11] Max Struct:[+inf, +inf, +inf, 16, +inf, 16, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1108 ms. (901 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
BEST_FIRST walk for 7000006 steps (14 resets) in 4322 ms. (1619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15, 397, 672, 15, 229, 133, 305] Max Struct:[+inf, +inf, +inf, 16, +inf, +inf, +inf]
[2024-05-23 02:46:40] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:46:40] [INFO ] Invariant cache hit.
[2024-05-23 02:46:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:40] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:46:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:46:40] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:40] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:46:40] [INFO ] [Nat]Added 24 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:46:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 02:46:40] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 02:46:40] [INFO ] Added : 3 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:46:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:40] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:46:40] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:40] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:46:40] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:41] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:46:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-23 02:46:41] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:41] [INFO ] Added : 17 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 02:46:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:41] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-23 02:46:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-23 02:46:41] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:41] [INFO ] Added : 15 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 02:46:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:41] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:41] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 02:46:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:46:41] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:41] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-23 02:46:41] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:46:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-23 02:46:41] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 02:46:42] [INFO ] Added : 22 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:46:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:42] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-23 02:46:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-23 02:46:42] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:42] [INFO ] Added : 36 causal constraints over 9 iterations in 102 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 02:46:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:46:42] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:42] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:42] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-23 02:46:42] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:46:42] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-23 02:46:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2024-05-23 02:46:42] [INFO ] Added : 12 causal constraints over 5 iterations in 261 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15, 397, 672, 15, 229, 133, 305] 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:[15, 397, 672, 229, 133, 305] 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-23 02:46:48] [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 112 ms. (steps per millisecond=89 ) properties (out of 6) seen :[1, 11, 3, 3, 1, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[15, 397, 672, 229, 133, 305] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:46:48] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:46:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15, 397, 672, 229, 133, 305] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (2 resets) in 1075 ms. (929 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3842 ms. (1561 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 397, 673, 229, 221, 482] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:46:53] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:46:53] [INFO ] Invariant cache hit.
[2024-05-23 02:46:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:46:53] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-23 02:46:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:46:53] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:46:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:46:53] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:53] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:46:53] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2024-05-23 02:46:53] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:46:53] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-23 02:46:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 226 ms
[2024-05-23 02:46:53] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 11 ms.
[2024-05-23 02:46:53] [INFO ] Added : 7 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 02:46:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:54] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-23 02:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-23 02:46:54] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:54] [INFO ] Added : 17 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:46:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:46:54] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:46:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 02:46:54] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:54] [INFO ] Added : 15 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 33 ms.
[2024-05-23 02:46:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:46:54] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:46:54] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:46:54] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:46:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2024-05-23 02:46:54] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:46:54] [INFO ] Added : 22 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:46:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:55] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:46:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-23 02:46:55] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 12 ms.
[2024-05-23 02:46:55] [INFO ] Added : 36 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 02:46:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:46:55] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:46:55] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 02:46:55] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2024-05-23 02:46:55] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:46:55] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-23 02:46:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 196 ms
[2024-05-23 02:46:55] [INFO ] Added : 12 causal constraints over 5 iterations in 262 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 397, 673, 229, 221, 482] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 397, 673, 229, 221, 482] 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-23 02:47:01] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:01] [INFO ] Invariant cache hit.
[2024-05-23 02:47:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 02:47:01] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:01] [INFO ] Invariant cache hit.
[2024-05-23 02:47:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:47:01] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-23 02:47:01] [INFO ] Redundant transitions in 10 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 02:47:01] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:01] [INFO ] Invariant cache hit.
[2024-05-23 02:47:01] [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 5363 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 7202 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 12832ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 12844ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13091 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 02:47:14] [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 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :[3, 9, 3, 3, 1, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[20, 397, 673, 229, 221, 482] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:47:14] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20, 397, 673, 229, 221, 482] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1138 ms. (877 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3722 ms. (1611 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 410, 673, 229, 221, 774] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:47:19] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:19] [INFO ] Invariant cache hit.
[2024-05-23 02:47:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:19] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:47:19] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:47:19] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:47:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:47:19] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:19] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-23 02:47:19] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:47:20] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:47:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:47:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 226 ms
[2024-05-23 02:47:20] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 02:47:20] [INFO ] Added : 7 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:20] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-05-23 02:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 02:47:20] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 02:47:20] [INFO ] Added : 17 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:20] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-23 02:47:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-23 02:47:20] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:47:20] [INFO ] Added : 15 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:47:20] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:20] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:47:21] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:47:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-23 02:47:21] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 10 ms.
[2024-05-23 02:47:21] [INFO ] Added : 22 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 42 ms.
[2024-05-23 02:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:21] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 4 ms to minimize.
[2024-05-23 02:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-23 02:47:21] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 11 ms.
[2024-05-23 02:47:21] [INFO ] Added : 36 causal constraints over 9 iterations in 98 ms. Result :sat
Minimization took 38 ms.
[2024-05-23 02:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:47:21] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:21] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 8 ms.
[2024-05-23 02:47:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-23 02:47:21] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:47:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:47:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 175 ms
[2024-05-23 02:47:21] [INFO ] Added : 12 causal constraints over 5 iterations in 232 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 410, 673, 229, 221, 774] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 410, 673, 229, 221, 774] 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 21 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 21 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-23 02:47:28] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:28] [INFO ] Invariant cache hit.
[2024-05-23 02:47:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 02:47:28] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:28] [INFO ] Invariant cache hit.
[2024-05-23 02:47:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:47:28] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-23 02:47:28] [INFO ] Redundant transitions in 3 ms returned []
Running 253 sub problems to find dead transitions.
[2024-05-23 02:47:28] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:28] [INFO ] Invariant cache hit.
[2024-05-23 02:47:28] [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 5125 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 7278 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 12603ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 12606ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12817 ms. Remains : 98/98 places, 255/255 transitions.
[2024-05-23 02:47:41] [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 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :[1, 2147483647, 2147483647, 3, 2, 6]
Current structural bounds on expressions (after cover walk) : Max Seen:[20, +inf, +inf, 229, 221, 774] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:47:41] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20, +inf, +inf, 229, 221, 774] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1162 ms. (859 steps per ms)
FORMULA FunctionPointer-PT-b016-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b016-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000004 steps (8 resets) in 2518 ms. (1587 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-23 02:47:45] [INFO ] Flow matrix only has 158 transitions (discarded 97 similar events)
[2024-05-23 02:47:45] [INFO ] Invariant cache hit.
[2024-05-23 02:47:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:45] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:47:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:47:45] [INFO ] [Real]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:45] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:47:45] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:45] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:47:45] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:47:45] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:47:45] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-23 02:47:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 238 ms
[2024-05-23 02:47:45] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 12 ms.
[2024-05-23 02:47:45] [INFO ] Added : 7 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:47:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:45] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:47:45] [INFO ] [Real]Added 24 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:47:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:45] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:47:45] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:45] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-23 02:47:45] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:47:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-05-23 02:47:45] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:47:45] [INFO ] Added : 22 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:47:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-23 02:47:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-23 02:47:46] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:47:46] [INFO ] Added : 36 causal constraints over 9 iterations in 98 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 02:47:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:47:46] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:46] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 97 transitions) in 9 ms.
[2024-05-23 02:47:46] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-23 02:47:46] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:47:46] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-23 02:47:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2024-05-23 02:47:46] [INFO ] Added : 12 causal constraints over 5 iterations in 238 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 255/255 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 251
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 10 place count 96 transition count 245
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 94 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 94 transition count 241
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 94 transition count 233
Applied a total of 22 rules in 14 ms. Remains 94 /98 variables (removed 4) and now considering 233/255 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 94/98 places, 233/255 transitions.
[2024-05-23 02:47:49] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
Found an invariant !
This invariant on transitions {27=1, 69=1, 118=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {27=1, 69=1, 118=1, 143=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :[2, 3, 5, 8]
Current structural bounds on expressions (after cover walk) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-23 02:47:49] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
// Phase 1: matrix 147 rows 94 cols
[2024-05-23 02:47:49] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000004 steps (2 resets) in 1017 ms. (982 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2464 ms. (1622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-23 02:47:53] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:47:53] [INFO ] Invariant cache hit.
[2024-05-23 02:47:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:47:53] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:47:53] [INFO ] [Real]Added 24 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:47:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Nat]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:47:53] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2024-05-23 02:47:53] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:47:53] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:47:53] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:47:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 211 ms
[2024-05-23 02:47:53] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-23 02:47:53] [INFO ] Added : 8 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 02:47:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:53] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 16 ms.
[2024-05-23 02:47:53] [INFO ] Added : 35 causal constraints over 10 iterations in 112 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:47:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:47:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:47:53] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:53] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 9 ms.
[2024-05-23 02:47:53] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 25 ms.
[2024-05-23 02:47:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:47:54] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:47:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:47:54] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:47:54] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:47:54] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:47:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 02:47:54] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-23 02:47:54] [INFO ] Added : 9 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 94/94 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-23 02:47:56] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:47:56] [INFO ] Invariant cache hit.
[2024-05-23 02:47:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 02:47:56] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:47:56] [INFO ] Invariant cache hit.
[2024-05-23 02:47:56] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:47:56] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-23 02:47:56] [INFO ] Redundant transitions in 2 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-23 02:47:56] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:47:56] [INFO ] Invariant cache hit.
[2024-05-23 02:47:56] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 147/241 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 24/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 121 constraints, problems are : Problem set: 0 solved, 231 unsolved in 4340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 147/241 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 24/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 231/352 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 352 constraints, problems are : Problem set: 0 solved, 231 unsolved in 6503 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 11005ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 11008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11211 ms. Remains : 94/94 places, 233/233 transitions.
[2024-05-23 02:48:07] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
Found an invariant !
This invariant on transitions {27=1, 69=1, 118=1, 145=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 69=1, 118=1, 143=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 4) seen :[5, 3, 3, 10]
Current structural bounds on expressions (after cover walk) : Max Seen:[20, 229, 221, 871] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 40003 steps (8 resets) in 568 ms. (70 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 351269 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 4
Probabilistic random walk after 351269 steps, saw 218664 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-23 02:48:11] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:48:11] [INFO ] Invariant cache hit.
[2024-05-23 02:48:11] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/107 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/114 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 109/223 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/229 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 12/241 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/107 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/114 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 109/223 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 22/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/229 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 12/241 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/241 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/241 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 125 constraints, problems are : Problem set: 0 solved, 4 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 94/94 places, 233/233 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 354366 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 4
Probabilistic random walk after 354366 steps, saw 220593 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-23 02:48:14] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:48:14] [INFO ] Invariant cache hit.
[2024-05-23 02:48:14] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/107 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/114 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 109/223 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/229 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 12/241 variables, 12/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/107 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/114 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 109/223 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 22/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/229 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 12/241 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/241 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/241 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 125 constraints, problems are : Problem set: 0 solved, 4 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 317ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 94/94 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-23 02:48:15] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:48:15] [INFO ] Invariant cache hit.
[2024-05-23 02:48:15] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 02:48:15] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:48:15] [INFO ] Invariant cache hit.
[2024-05-23 02:48:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:48:15] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-23 02:48:15] [INFO ] Redundant transitions in 2 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-23 02:48:15] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:48:15] [INFO ] Invariant cache hit.
[2024-05-23 02:48:15] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 147/241 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 24/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 0/241 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 121 constraints, problems are : Problem set: 0 solved, 231 unsolved in 4298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 147/241 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 24/121 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 231/352 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 352 constraints, problems are : Problem set: 0 solved, 231 unsolved in 6342 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 94/94 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 10820ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 10823ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11020 ms. Remains : 94/94 places, 233/233 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 94 transition count 142
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 97 place count 89 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 88 transition count 141
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 98 place count 88 transition count 121
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 138 place count 68 transition count 121
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 170 place count 52 transition count 105
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 177 place count 45 transition count 91
Iterating global reduction 3 with 7 rules applied. Total rules applied 184 place count 45 transition count 91
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 191 place count 38 transition count 77
Iterating global reduction 3 with 7 rules applied. Total rules applied 198 place count 38 transition count 77
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 205 place count 31 transition count 63
Iterating global reduction 3 with 7 rules applied. Total rules applied 212 place count 31 transition count 63
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 219 place count 31 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 219 place count 31 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 30 transition count 55
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 4 with 6 rules applied. Total rules applied 227 place count 27 transition count 55
Applied a total of 227 rules in 17 ms. Remains 27 /94 variables (removed 67) and now considering 55/233 (removed 178) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 55 rows 27 cols
[2024-05-23 02:48:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:48:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:48:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 02:48:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:48:26] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 02:48:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:48:26] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 02:48:26] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 02:48:26] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 152 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[20, 229, 221, 871] Max Struct:[+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-23 02:48:26] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
// Phase 1: matrix 147 rows 94 cols
[2024-05-23 02:48:26] [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 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2024-05-23 02:48:26] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:48:26] [INFO ] Invariant cache hit.
[2024-05-23 02:48:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:48:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:48:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:48:26] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:48:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:48:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:48:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:48:26] [INFO ] [Nat]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:48:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-23 02:48:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-23 02:48:26] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-23 02:48:26] [INFO ] Added : 5 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 92 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 92 transition count 227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 90 transition count 223
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 90 transition count 223
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 88 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 88 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 86 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 86 transition count 211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 84 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 84 transition count 207
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 82 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 82 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 80 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 80 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 78 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 78 transition count 195
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 76 transition count 191
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 76 transition count 191
Applied a total of 36 rules in 25 ms. Remains 76 /94 variables (removed 18) and now considering 191/233 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 76/94 places, 191/233 transitions.
[2024-05-23 02:48:26] [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 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[8]
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
[2024-05-23 02:48:26] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-23 02:48:26] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 1000006 steps (2 resets) in 897 ms. (1113 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 532 ms. (1876 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2024-05-23 02:48:28] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:48:28] [INFO ] Invariant cache hit.
[2024-05-23 02:48:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:48:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:48:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:48:28] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:48:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:48:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:48:28] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:48:28] [INFO ] [Nat]Added 18 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:48:28] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-23 02:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 02:48:28] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 02:48:28] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-23 02:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-23 02:48:28] [INFO ] Added : 8 causal constraints over 3 iterations in 91 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 02:48:28] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:48:28] [INFO ] Invariant cache hit.
[2024-05-23 02:48:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 02:48:28] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:48:28] [INFO ] Invariant cache hit.
[2024-05-23 02:48:28] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:48:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-23 02:48:28] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 02:48:28] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:48:28] [INFO ] Invariant cache hit.
[2024-05-23 02:48:28] [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 2749 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 4686 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 7529ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 7531ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7709 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-23 02:48:36] [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 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32489 steps (6 resets) in 30 ms. (1048 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[16] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-00 in 9981 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-23 02:48:36] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
// Phase 1: matrix 147 rows 94 cols
[2024-05-23 02:48:36] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 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:[1] Max Struct:[+inf]
[2024-05-23 02:48:36] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:48:36] [INFO ] Invariant cache hit.
[2024-05-23 02:48:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:48:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:48:36] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:48:36] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:48:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:48:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:48:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:48:36] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:48:36] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 11 ms.
[2024-05-23 02:48:36] [INFO ] Added : 32 causal constraints over 8 iterations in 84 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 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Graph (complete) has 400 edges and 94 vertex of which 91 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 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 90 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 89 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 88 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 87 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 86 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 85 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 84 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 83 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 83 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 82 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 82 transition count 208
Applied a total of 24 rules in 19 ms. Remains 82 /94 variables (removed 12) and now considering 208/233 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 82/94 places, 208/233 transitions.
[2024-05-23 02:48:36] [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 :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 02:48:36] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
// Phase 1: matrix 128 rows 82 cols
[2024-05-23 02:48:36] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000003 steps (2 resets) in 941 ms. (1061 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 601 ms. (1661 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[234] Max Struct:[+inf]
[2024-05-23 02:48:38] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:38] [INFO ] Invariant cache hit.
[2024-05-23 02:48:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:48:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 02:48:38] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:48:38] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:48:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:48:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:48:38] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:48:38] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:48:38] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-23 02:48:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-23 02:48:38] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 11 ms.
[2024-05-23 02:48:38] [INFO ] Added : 16 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[234] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[234] 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 5 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-23 02:48:38] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:38] [INFO ] Invariant cache hit.
[2024-05-23 02:48:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 02:48:38] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:38] [INFO ] Invariant cache hit.
[2024-05-23 02:48:38] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:48:38] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-23 02:48:38] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 02:48:38] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:38] [INFO ] Invariant cache hit.
[2024-05-23 02:48:38] [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 3964 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 5302 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 9375ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9378ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9549 ms. Remains : 82/82 places, 208/208 transitions.
[2024-05-23 02:48:47] [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 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[234] Max Struct:[+inf]
[2024-05-23 02:48:48] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[234] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 980 ms. (1019 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 611 ms. (1633 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[258] Max Struct:[+inf]
[2024-05-23 02:48:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:49] [INFO ] Invariant cache hit.
[2024-05-23 02:48:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:48:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:48:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:48:49] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:48:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:48:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:48:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:48:49] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:48:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:48:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-23 02:48:49] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 6 ms.
[2024-05-23 02:48:49] [INFO ] Added : 16 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[258] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[258] 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 5 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 3 ms. Remains 82 /82 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-23 02:48:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:49] [INFO ] Invariant cache hit.
[2024-05-23 02:48:49] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 02:48:49] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:49] [INFO ] Invariant cache hit.
[2024-05-23 02:48:50] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:48:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-23 02:48:50] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 02:48:50] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:50] [INFO ] Invariant cache hit.
[2024-05-23 02:48:50] [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 3923 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 5167 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 9208ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9210ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9392 ms. Remains : 82/82 places, 208/208 transitions.
[2024-05-23 02:48:59] [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 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[258] Max Struct:[+inf]
[2024-05-23 02:48:59] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:48:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[258] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1011 ms. (988 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 590 ms. (1692 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[258] Max Struct:[+inf]
[2024-05-23 02:49:00] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:00] [INFO ] Invariant cache hit.
[2024-05-23 02:49:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:01] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:49:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:01] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:49:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:49:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:49:01] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:49:01] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:49:01] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:49:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-23 02:49:01] [INFO ] Computed and/alt/rep : 60/196/54 causal constraints (skipped 72 transitions) in 8 ms.
[2024-05-23 02:49:01] [INFO ] Added : 16 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[258] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[258] 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 5 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-23 02:49:01] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:01] [INFO ] Invariant cache hit.
[2024-05-23 02:49:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 02:49:01] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:01] [INFO ] Invariant cache hit.
[2024-05-23 02:49:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:01] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-23 02:49:01] [INFO ] Redundant transitions in 0 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 02:49:01] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:01] [INFO ] Invariant cache hit.
[2024-05-23 02:49:01] [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 3831 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 5183 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 9157ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9330 ms. Remains : 82/82 places, 208/208 transitions.
[2024-05-23 02:49:10] [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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[258] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 103 ms. (384 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 1887540 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :0 out of 1
Probabilistic random walk after 1887540 steps, saw 1174794 distinct states, run finished after 3001 ms. (steps per millisecond=628 ) properties seen :0
[2024-05-23 02:49:13] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:13] [INFO ] Invariant cache hit.
[2024-05-23 02:49:13] [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 83 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 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]
After SMT, in 170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 474 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 40006 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1937382 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :0 out of 1
Probabilistic random walk after 1937382 steps, saw 1205818 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
[2024-05-23 02:49:17] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:17] [INFO ] Invariant cache hit.
[2024-05-23 02:49:17] [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 83 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 89 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 220ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 385 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.
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-23 02:49:18] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:18] [INFO ] Invariant cache hit.
[2024-05-23 02:49:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 02:49:18] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:18] [INFO ] Invariant cache hit.
[2024-05-23 02:49:18] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:18] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-23 02:49:18] [INFO ] Redundant transitions in 0 ms returned []
Running 206 sub problems to find dead transitions.
[2024-05-23 02:49:18] [INFO ] Flow matrix only has 128 transitions (discarded 80 similar events)
[2024-05-23 02:49:18] [INFO ] Invariant cache hit.
[2024-05-23 02:49:18] [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 3893 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 5183 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 9224ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 9227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9441 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 15 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-23 02:49:27] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:49:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:27] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:49:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:49:27] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:49:27] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:49:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:27] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:49:27] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:49:27] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:49:27] [INFO ] After 35ms 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:[258] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-06 in 51332 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-23 02:49:27] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
// Phase 1: matrix 147 rows 94 cols
[2024-05-23 02:49:27] [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:[0] Max Struct:[+inf]
[2024-05-23 02:49:27] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:49:27] [INFO ] Invariant cache hit.
[2024-05-23 02:49:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:27] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:49:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:49:27] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:49:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:49:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:27] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:49:27] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:49:27] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-23 02:49:27] [INFO ] Added : 13 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Graph (complete) has 400 edges and 94 vertex of which 91 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 91 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 90 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 90 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 89 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 89 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 88 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 88 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 87 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 86 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 85 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 84 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 83 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 82 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 82 transition count 206
Applied a total of 24 rules in 12 ms. Remains 82 /94 variables (removed 12) and now considering 206/233 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 82/94 places, 206/233 transitions.
[2024-05-23 02:49:27] [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 1 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 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 02:49:27] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
// Phase 1: matrix 126 rows 82 cols
[2024-05-23 02:49:27] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 971 ms. (1028 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 582 ms. (1715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[281] Max Struct:[+inf]
[2024-05-23 02:49:29] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:29] [INFO ] Invariant cache hit.
[2024-05-23 02:49:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:29] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 02:49:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:29] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:49:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:49:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:29] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-23 02:49:29] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:49:29] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 71 transitions) in 6 ms.
[2024-05-23 02:49:29] [INFO ] Added : 8 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[281] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[281] 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-23 02:49:29] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:29] [INFO ] Invariant cache hit.
[2024-05-23 02:49:29] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:49:29] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:29] [INFO ] Invariant cache hit.
[2024-05-23 02:49:29] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:29] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-23 02:49:29] [INFO ] Redundant transitions in 1 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-23 02:49:29] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:29] [INFO ] Invariant cache hit.
[2024-05-23 02:49:29] [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 3033 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 5194 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 8339ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8346ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8519 ms. Remains : 82/82 places, 206/206 transitions.
[2024-05-23 02:49:38] [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 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[281] Max Struct:[+inf]
[2024-05-23 02:49:38] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[281] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 947 ms. (1054 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 555 ms. (1798 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[281] Max Struct:[+inf]
[2024-05-23 02:49:39] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:39] [INFO ] Invariant cache hit.
[2024-05-23 02:49:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:39] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:49:39] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:39] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:49:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:49:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:49:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:49:39] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:49:39] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 71 transitions) in 11 ms.
[2024-05-23 02:49:39] [INFO ] Added : 8 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[281] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[281] 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 3 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 3 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-23 02:49:39] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:39] [INFO ] Invariant cache hit.
[2024-05-23 02:49:40] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-23 02:49:40] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:40] [INFO ] Invariant cache hit.
[2024-05-23 02:49:40] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:40] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-23 02:49:40] [INFO ] Redundant transitions in 0 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-23 02:49:40] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:40] [INFO ] Invariant cache hit.
[2024-05-23 02:49:40] [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 3120 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 5151 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 8373ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8589 ms. Remains : 82/82 places, 206/206 transitions.
[2024-05-23 02:49:48] [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 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[281] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 79 ms. (500 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 1844957 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :0 out of 1
Probabilistic random walk after 1844957 steps, saw 1148288 distinct states, run finished after 3001 ms. (steps per millisecond=614 ) properties seen :0
[2024-05-23 02:49:51] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:51] [INFO ] Invariant cache hit.
[2024-05-23 02:49:51] [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 75 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 156ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 415 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 9 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 9 ms. Remains : 82/82 places, 206/206 transitions.
RANDOM walk for 40006 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 1838808 steps, run timeout after 3026 ms. (steps per millisecond=607 ) properties seen :0 out of 1
Probabilistic random walk after 1838808 steps, saw 1144462 distinct states, run finished after 3026 ms. (steps per millisecond=607 ) properties seen :0
[2024-05-23 02:49:55] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:55] [INFO ] Invariant cache hit.
[2024-05-23 02:49:55] [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 69 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 109 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 184ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 434 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 3 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-23 02:49:55] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:55] [INFO ] Invariant cache hit.
[2024-05-23 02:49:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 02:49:56] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:56] [INFO ] Invariant cache hit.
[2024-05-23 02:49:56] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:49:56] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-23 02:49:56] [INFO ] Redundant transitions in 0 ms returned []
Running 204 sub problems to find dead transitions.
[2024-05-23 02:49:56] [INFO ] Flow matrix only has 126 transitions (discarded 80 similar events)
[2024-05-23 02:49:56] [INFO ] Invariant cache hit.
[2024-05-23 02:49:56] [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 2982 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 5174 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 8283ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 8287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8463 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 18 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-23 02:50:04] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:50:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:04] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:50:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:50:04] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:50:04] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:50:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:04] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:50:04] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:50:04] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:50:04] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 94 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[281] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-11 in 36998 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-23 02:50:04] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
// Phase 1: matrix 147 rows 94 cols
[2024-05-23 02:50:04] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 16 ms. (588 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:[17] Max Struct:[+inf]
[2024-05-23 02:50:04] [INFO ] Flow matrix only has 147 transitions (discarded 86 similar events)
[2024-05-23 02:50:04] [INFO ] Invariant cache hit.
[2024-05-23 02:50:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:50:04] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-23 02:50:04] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-23 02:50:04] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:50:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:50:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:50:04] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:50:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-23 02:50:04] [INFO ] Computed and/alt/rep : 64/279/59 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-23 02:50:04] [INFO ] Added : 14 causal constraints over 5 iterations in 55 ms. Result :sat
Minimization took 25 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 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 233/233 transitions.
Graph (complete) has 400 edges and 94 vertex of which 91 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 91 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 89 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 87 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 87 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 85 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 85 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 83 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 83 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 81 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 81 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 79 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 79 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 78 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 78 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 77 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 77 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 76 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 76 transition count 192
Applied a total of 36 rules in 14 ms. Remains 76 /94 variables (removed 18) and now considering 192/233 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 76/94 places, 192/233 transitions.
[2024-05-23 02:50:04] [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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[17] Max Struct:[+inf]
[2024-05-23 02:50:05] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
// Phase 1: matrix 118 rows 76 cols
[2024-05-23 02:50:05] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[17] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 883 ms. (1131 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 513 ms. (1945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[844] Max Struct:[+inf]
[2024-05-23 02:50:06] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:06] [INFO ] Invariant cache hit.
[2024-05-23 02:50:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:50:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:50:06] [INFO ] [Real]Added 17 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:50:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:50:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:50:06] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:50:06] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:50:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 02:50:06] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 6 ms.
[2024-05-23 02:50:06] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:50:06] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-23 02:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-23 02:50:06] [INFO ] Added : 5 causal constraints over 3 iterations in 129 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[844] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[844] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:50:07] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:07] [INFO ] Invariant cache hit.
[2024-05-23 02:50:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 02:50:07] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:07] [INFO ] Invariant cache hit.
[2024-05-23 02:50:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:50:07] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-23 02:50:07] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:50:07] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:07] [INFO ] Invariant cache hit.
[2024-05-23 02:50:07] [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 2975 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 4732 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 7815ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7817ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7995 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-23 02:50:15] [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 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[6]
Current structural bounds on expressions (after cover walk) : Max Seen:[844] Max Struct:[+inf]
[2024-05-23 02:50:15] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[844] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 951 ms. (1050 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 564 ms. (1769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[938] Max Struct:[+inf]
[2024-05-23 02:50:17] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:17] [INFO ] Invariant cache hit.
[2024-05-23 02:50:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:50:17] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:50:17] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:50:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:50:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:50:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:50:17] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:50:17] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-23 02:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-23 02:50:17] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 10 ms.
[2024-05-23 02:50:17] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:50:17] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-23 02:50:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2024-05-23 02:50:17] [INFO ] Added : 5 causal constraints over 3 iterations in 134 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[938] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[938] 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 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:50:18] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:18] [INFO ] Invariant cache hit.
[2024-05-23 02:50:18] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:50:18] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:18] [INFO ] Invariant cache hit.
[2024-05-23 02:50:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:50:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-23 02:50:19] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:50:19] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:19] [INFO ] Invariant cache hit.
[2024-05-23 02:50:19] [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 2945 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 4782 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 7841ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7845ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8014 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-23 02:50:26] [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 :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[938] Max Struct:[+inf]
[2024-05-23 02:50:27] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[938] 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 517 ms. (1930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[938] Max Struct:[+inf]
[2024-05-23 02:50:28] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:28] [INFO ] Invariant cache hit.
[2024-05-23 02:50:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:28] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:50:28] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:50:28] [INFO ] [Real]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:50:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:50:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:28] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:50:28] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:50:28] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-23 02:50:28] [INFO ] Computed and/alt/rep : 57/184/51 causal constraints (skipped 65 transitions) in 9 ms.
[2024-05-23 02:50:28] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-23 02:50:28] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-23 02:50:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2024-05-23 02:50:28] [INFO ] Added : 5 causal constraints over 3 iterations in 152 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[938] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[938] 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 8 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 9 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 7 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:50:29] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:29] [INFO ] Invariant cache hit.
[2024-05-23 02:50:30] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 02:50:30] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:30] [INFO ] Invariant cache hit.
[2024-05-23 02:50:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:50:30] [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-23 02:50:30] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:50:30] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:30] [INFO ] Invariant cache hit.
[2024-05-23 02:50:30] [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 2995 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 4724 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 7837ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7841ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8014 ms. Remains : 76/76 places, 192/192 transitions.
[2024-05-23 02:50:37] [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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[11]
Current structural bounds on expressions (after cover walk) : Max Seen:[938] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1929557 steps, run timeout after 3001 ms. (steps per millisecond=642 ) properties seen :0 out of 1
Probabilistic random walk after 1929557 steps, saw 1200946 distinct states, run finished after 3002 ms. (steps per millisecond=642 ) properties seen :0
[2024-05-23 02:50:41] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:41] [INFO ] Invariant cache hit.
[2024-05-23 02:50:41] [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 90 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 81 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 176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 682 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 3 ms. Remains : 76/76 places, 192/192 transitions.
RANDOM walk for 40006 steps (8 resets) in 76 ms. (519 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 1928750 steps, run timeout after 3001 ms. (steps per millisecond=642 ) properties seen :0 out of 1
Probabilistic random walk after 1928750 steps, saw 1200442 distinct states, run finished after 3001 ms. (steps per millisecond=642 ) properties seen :0
[2024-05-23 02:50:44] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:44] [INFO ] Invariant cache hit.
[2024-05-23 02:50:45] [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 102 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 89 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 197ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 662 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 3 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:50:45] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:45] [INFO ] Invariant cache hit.
[2024-05-23 02:50:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:50:45] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:45] [INFO ] Invariant cache hit.
[2024-05-23 02:50:45] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:50:46] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-23 02:50:46] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:50:46] [INFO ] Flow matrix only has 118 transitions (discarded 74 similar events)
[2024-05-23 02:50:46] [INFO ] Invariant cache hit.
[2024-05-23 02:50:46] [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 2950 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 4802 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 7866ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 7869ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8033 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 12 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-23 02:50:53] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:50:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:50:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:53] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:50:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:50:53] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:50:54] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:50:54] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 111 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[938] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b016-UpperBounds-15 in 49471 ms.
[2024-05-23 02:50:54] [INFO ] Flatten gal took : 47 ms
[2024-05-23 02:50:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-23 02:50:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 233 transitions and 948 arcs took 4 ms.
Total runtime 264870 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b016

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 94
TRANSITIONS: 233
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]

SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1502
MODEL NAME: /home/mcc/execution/403/model
94 places, 233 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716432655109

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

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="greatspnxred"
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 greatspnxred"
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 r179-tall-171640601100245"
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 ;