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-171640601100221.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-b002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716431424069

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-b002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:30:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 02:30:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:30:25] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-23 02:30:25] [INFO ] Transformed 306 places.
[2024-05-23 02:30:25] [INFO ] Transformed 840 transitions.
[2024-05-23 02:30:25] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 84 places in 12 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:30:25] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 02:30:25] [INFO ] Computed 4 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 2, +inf, +inf, 2, +inf, +inf, 2, +inf, 2, 1]
RANDOM walk for 10000 steps (18 resets) in 56 ms. (175 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (32 resets) in 80 ms. (864 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 29, 53, 6, 7, 2, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:30:25] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-23 02:30:25] [INFO ] Invariant cache hit.
[2024-05-23 02:30:25] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-23 02:30:25] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-23 02:30:26] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-23 02:30:26] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-23 02:30:26] [INFO ] [Real]Added 65 Read/Feed constraints in 14 ms returned sat
[2024-05-23 02:30:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:30:26] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:30:26] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-23 02:30:26] [INFO ] [Nat]Added 65 Read/Feed constraints in 16 ms returned sat
[2024-05-23 02:30:26] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 21 ms to minimize.
[2024-05-23 02:30:26] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
[2024-05-23 02:30:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2024-05-23 02:30:26] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 51 ms.
[2024-05-23 02:30:26] [INFO ] Added : 1 causal constraints over 1 iterations in 99 ms. Result :sat
Minimization took 84 ms.
[2024-05-23 02:30:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 02:30:26] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:30:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:30:27] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-23 02:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-23 02:30:27] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 62 ms.
[2024-05-23 02:30:27] [INFO ] Added : 1 causal constraints over 1 iterations in 121 ms. Result :sat
Minimization took 81 ms.
[2024-05-23 02:30:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Real]Added 65 Read/Feed constraints in 13 ms returned sat
[2024-05-23 02:30:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-23 02:30:27] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-23 02:30:27] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 38 ms.
[2024-05-23 02:30:27] [INFO ] Added : 1 causal constraints over 1 iterations in 90 ms. Result :sat
Minimization took 79 ms.
[2024-05-23 02:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Real]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:30:28] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-23 02:30:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-23 02:30:28] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 38 ms.
[2024-05-23 02:30:28] [INFO ] Added : 2 causal constraints over 1 iterations in 84 ms. Result :sat
Minimization took 81 ms.
[2024-05-23 02:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-23 02:30:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-23 02:30:28] [INFO ] [Nat]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-23 02:30:29] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-23 02:30:29] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-23 02:30:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2024-05-23 02:30:29] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 46 ms.
[2024-05-23 02:30:29] [INFO ] Added : 1 causal constraints over 1 iterations in 94 ms. Result :sat
Minimization took 84 ms.
[2024-05-23 02:30:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 02:30:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:30:29] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-23 02:30:29] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:30:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:29] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:30:29] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-23 02:30:29] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:30:29] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-23 02:30:29] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-23 02:30:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2024-05-23 02:30:29] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 34 ms.
[2024-05-23 02:30:29] [INFO ] Added : 2 causal constraints over 1 iterations in 73 ms. Result :sat
Minimization took 80 ms.
[2024-05-23 02:30:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:30:30] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-23 02:30:30] [INFO ] [Real]Added 65 Read/Feed constraints in 17 ms returned sat
[2024-05-23 02:30:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:30:30] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-23 02:30:30] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
[2024-05-23 02:30:30] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-05-23 02:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-23 02:30:30] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-23 02:30:30] [INFO ] Added : 2 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 29, 53, 6, 7, 2, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 29, 53, 6, 7, 2, 13] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 191 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.3 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 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 71 place count 164 transition count 445
Iterating global reduction 1 with 27 rules applied. Total rules applied 98 place count 164 transition count 445
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 124 place count 164 transition count 419
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 140 place count 148 transition count 387
Iterating global reduction 2 with 16 rules applied. Total rules applied 156 place count 148 transition count 387
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 160 place count 148 transition count 383
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 166 place count 142 transition count 371
Iterating global reduction 3 with 6 rules applied. Total rules applied 172 place count 142 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 178 place count 136 transition count 347
Iterating global reduction 3 with 6 rules applied. Total rules applied 184 place count 136 transition count 347
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 189 place count 131 transition count 337
Iterating global reduction 3 with 5 rules applied. Total rules applied 194 place count 131 transition count 337
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 198 place count 127 transition count 321
Iterating global reduction 3 with 4 rules applied. Total rules applied 202 place count 127 transition count 321
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 206 place count 123 transition count 305
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 123 transition count 305
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 214 place count 119 transition count 297
Iterating global reduction 3 with 4 rules applied. Total rules applied 218 place count 119 transition count 297
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 222 place count 115 transition count 289
Iterating global reduction 3 with 4 rules applied. Total rules applied 226 place count 115 transition count 289
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 230 place count 111 transition count 281
Iterating global reduction 3 with 4 rules applied. Total rules applied 234 place count 111 transition count 281
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 238 place count 107 transition count 273
Iterating global reduction 3 with 4 rules applied. Total rules applied 242 place count 107 transition count 273
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 246 place count 103 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 250 place count 103 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 258 place count 103 transition count 257
Applied a total of 258 rules in 115 ms. Remains 103 /222 variables (removed 119) and now considering 257/648 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 103/222 places, 257/648 transitions.
[2024-05-23 02:30:30] [INFO ] Flow matrix only has 164 transitions (discarded 93 similar events)
Found an invariant !
This invariant on transitions {26=1, 78=1, 129=1, 160=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {28=1, 80=1, 115=1, 154=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :[1, 3, 3, 2, 0, 3, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 29, 53, 6, 7, 3, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:30:30] [INFO ] Flow matrix only has 164 transitions (discarded 93 similar events)
// Phase 1: matrix 164 rows 103 cols
[2024-05-23 02:30:30] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 29, 53, 6, 7, 3, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1221 ms. (818 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6000005 steps (12 resets) in 2367 ms. (2533 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4472, 1853, 1225, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:30:34] [INFO ] Flow matrix only has 164 transitions (discarded 93 similar events)
[2024-05-23 02:30:34] [INFO ] Invariant cache hit.
[2024-05-23 02:30:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:34] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:30:34] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:30:34] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:34] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:30:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:30:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-23 02:30:34] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-23 02:30:34] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:30:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2024-05-23 02:30:34] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 9 ms.
[2024-05-23 02:30:34] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-23 02:30:34] [INFO ] Added : 8 causal constraints over 3 iterations in 123 ms. Result :sat
Minimization took 30 ms.
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Added 27 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:30:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:35] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-23 02:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-23 02:30:35] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 10 ms.
[2024-05-23 02:30:35] [INFO ] Added : 7 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:30:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:30:35] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 12 ms.
[2024-05-23 02:30:35] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-23 02:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-23 02:30:35] [INFO ] Added : 9 causal constraints over 4 iterations in 133 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:30:35] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 10 ms.
[2024-05-23 02:30:35] [INFO ] Added : 11 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:30:35] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:30:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:36] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:30:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:36] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 9 ms.
[2024-05-23 02:30:36] [INFO ] Added : 19 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 34 ms.
[2024-05-23 02:30:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:30:36] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:30:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:30:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:30:36] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 10 ms.
[2024-05-23 02:30:36] [INFO ] Added : 17 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4472, 1853, 1225, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4472, 1853, 1225, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 253
Applied a total of 4 rules in 22 ms. Remains 102 /103 variables (removed 1) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 102/103 places, 253/257 transitions.
[2024-05-23 02:30:46] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
Found an invariant !
This invariant on transitions {24=1, 26=1, 76=1, 93=1, 127=1, 157=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 77=1, 112=1, 153=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :[1, 4, 2, 2, 4, 4]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 4472, 1853, 1225, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:30:46] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-23 02:30:46] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4472, 1853, 1225, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1099 ms. (909 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 2333 ms. (2570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:30:50] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:30:50] [INFO ] Invariant cache hit.
[2024-05-23 02:30:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:30:50] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:30:50] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:50] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2024-05-23 02:30:50] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-23 02:30:50] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-23 02:30:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 232 ms
[2024-05-23 02:30:50] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 15 ms.
[2024-05-23 02:30:50] [INFO ] Added : 7 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:30:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:30:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:50] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-23 02:30:50] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-23 02:30:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 02:30:50] [INFO ] Added : 13 causal constraints over 5 iterations in 130 ms. Result :sat
Minimization took 53 ms.
[2024-05-23 02:30:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:50] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:30:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:30:51] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:30:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 02:30:51] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-23 02:30:51] [INFO ] Added : 10 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 02:30:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:30:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:51] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-23 02:30:51] [INFO ] Added : 26 causal constraints over 7 iterations in 85 ms. Result :sat
Minimization took 32 ms.
[2024-05-23 02:30:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:30:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:51] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:30:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-23 02:30:51] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-23 02:30:51] [INFO ] Added : 19 causal constraints over 5 iterations in 65 ms. Result :sat
Minimization took 29 ms.
[2024-05-23 02:30:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-23 02:30:51] [INFO ] [Real]Added 27 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:30:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:30:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 02:30:52] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:30:52] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:30:52] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-23 02:30:52] [INFO ] Added : 14 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 102/102 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-23 02:31:03] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:03] [INFO ] Invariant cache hit.
[2024-05-23 02:31:03] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 02:31:03] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:03] [INFO ] Invariant cache hit.
[2024-05-23 02:31:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:31:03] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-23 02:31:03] [INFO ] Redundant transitions in 11 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-23 02:31:03] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:03] [INFO ] Invariant cache hit.
[2024-05-23 02:31:03] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 162/264 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 27/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 132 constraints, problems are : Problem set: 0 solved, 251 unsolved in 4982 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 162/264 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 27/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 251/383 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 383 constraints, problems are : Problem set: 0 solved, 251 unsolved in 6445 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 11682ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 11694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11967 ms. Remains : 102/102 places, 253/253 transitions.
[2024-05-23 02:31:15] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
Found an invariant !
This invariant on transitions {24=1, 26=1, 76=1, 93=1, 127=1, 157=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 77=1, 112=1, 153=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 6) seen :[1, 3, 2, 3, 3, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:31:15] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1049 ms. (952 steps per ms)
BEST_FIRST walk for 6000004 steps (12 resets) in 2331 ms. (2572 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 02:31:19] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:19] [INFO ] Invariant cache hit.
[2024-05-23 02:31:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:31:19] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:31:19] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:31:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:31:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:31:19] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-23 02:31:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-23 02:31:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-23 02:31:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 168 ms
[2024-05-23 02:31:19] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-23 02:31:19] [INFO ] Added : 7 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 27 ms.
[2024-05-23 02:31:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:31:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:31:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:31:19] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-23 02:31:19] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-23 02:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-23 02:31:19] [INFO ] Added : 13 causal constraints over 5 iterations in 123 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 02:31:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:31:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:31:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:31:19] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:31:19] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-23 02:31:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-23 02:31:19] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-23 02:31:20] [INFO ] Added : 10 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 26 ms.
[2024-05-23 02:31:20] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:31:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:31:20] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 15 ms.
[2024-05-23 02:31:20] [INFO ] Added : 26 causal constraints over 7 iterations in 88 ms. Result :sat
Minimization took 31 ms.
[2024-05-23 02:31:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:31:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:31:20] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-23 02:31:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-23 02:31:20] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-23 02:31:20] [INFO ] Added : 19 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 28 ms.
[2024-05-23 02:31:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:31:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:31:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-23 02:31:20] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:31:20] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-23 02:31:20] [INFO ] Added : 14 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 102/102 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-23 02:31:31] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:31] [INFO ] Invariant cache hit.
[2024-05-23 02:31:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-23 02:31:31] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:31] [INFO ] Invariant cache hit.
[2024-05-23 02:31:31] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:31:31] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-23 02:31:31] [INFO ] Redundant transitions in 3 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-23 02:31:31] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:31] [INFO ] Invariant cache hit.
[2024-05-23 02:31:31] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 162/264 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 27/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (OVERLAPS) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 132 constraints, problems are : Problem set: 0 solved, 251 unsolved in 4656 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 162/264 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 27/132 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 251/383 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 383 constraints, problems are : Problem set: 0 solved, 251 unsolved in 6606 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 11474ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 11478ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11707 ms. Remains : 102/102 places, 253/253 transitions.
[2024-05-23 02:31:43] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
Found an invariant !
This invariant on transitions {24=1, 26=1, 76=1, 93=1, 127=1, 157=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {27=1, 77=1, 112=1, 153=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 6) seen :[1, 0, 2, 3, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 1194 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 279631 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :1 out of 6
Probabilistic random walk after 279631 steps, saw 174074 distinct states, run finished after 3005 ms. (steps per millisecond=93 ) properties seen :1
[2024-05-23 02:31:46] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:31:46] [INFO ] Invariant cache hit.
[2024-05-23 02:31:46] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 103/122 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 12/134 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 112/246 variables, 69/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 26/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/252 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 11/263 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/264 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/264 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 132 constraints, problems are : Problem set: 0 solved, 5 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 103/122 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 12/134 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 112/246 variables, 69/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 26/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/252 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 11/263 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/264 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/264 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/264 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 137 constraints, problems are : Problem set: 0 solved, 5 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 100 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 100 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 99 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 99 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 98 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 98 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 97 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 97 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 96 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 96 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 95 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 95 transition count 235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 94 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 94 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 93 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 93 transition count 231
Applied a total of 18 rules in 20 ms. Remains 93 /102 variables (removed 9) and now considering 231/253 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 93/102 places, 231/253 transitions.
RANDOM walk for 40002 steps (8 resets) in 208 ms. (191 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 367879 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 5
Probabilistic random walk after 367879 steps, saw 229345 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-23 02:31:50] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
// Phase 1: matrix 147 rows 93 cols
[2024-05-23 02:31:50] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:31:50] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 95/114 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/124 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 100/224 variables, 62/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 25/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/230 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 9/239 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/240 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/240 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 122 constraints, problems are : Problem set: 0 solved, 5 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 95/114 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/124 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 100/224 variables, 62/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 25/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/224 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/230 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 9/239 variables, 9/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/240 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/240 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/240 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 127 constraints, problems are : Problem set: 0 solved, 5 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 93/93 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 231/231 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-23 02:31:51] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-23 02:31:51] [INFO ] Invariant cache hit.
[2024-05-23 02:31:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 02:31:51] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-23 02:31:51] [INFO ] Invariant cache hit.
[2024-05-23 02:31:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-23 02:31:51] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-23 02:31:51] [INFO ] Redundant transitions in 2 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-23 02:31:51] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-23 02:31:51] [INFO ] Invariant cache hit.
[2024-05-23 02:31:51] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 147/240 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 229 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 26/122 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/240 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 122 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 147/240 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 26/122 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 229/351 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 351 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5623 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 9073ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 9075ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9278 ms. Remains : 93/93 places, 231/231 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 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 90 rules applied. Total rules applied 90 place count 93 transition count 141
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 97 place count 87 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 86 transition count 140
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 98 place count 86 transition count 123
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 132 place count 69 transition count 123
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 166 place count 52 transition count 106
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 173 place count 45 transition count 92
Iterating global reduction 3 with 7 rules applied. Total rules applied 180 place count 45 transition count 92
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 187 place count 38 transition count 78
Iterating global reduction 3 with 7 rules applied. Total rules applied 194 place count 38 transition count 78
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 201 place count 31 transition count 64
Iterating global reduction 3 with 7 rules applied. Total rules applied 208 place count 31 transition count 64
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 215 place count 31 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 215 place count 31 transition count 56
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 217 place count 30 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 29 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 222 place count 29 transition count 53
Applied a total of 222 rules in 22 ms. Remains 29 /93 variables (removed 64) and now considering 53/231 (removed 178) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 53 rows 29 cols
[2024-05-23 02:32:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:32:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:00] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 02:32:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:32:00] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 02:32:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:32:00] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-23 02:32:00] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-23 02:32:00] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 162 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 4472, 1853, 1332, 1546, 553] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-b002-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:32:00] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-23 02:32:00] [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 13 ms. (714 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:[0] Max Struct:[+inf]
[2024-05-23 02:32:00] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:32:00] [INFO ] Invariant cache hit.
[2024-05-23 02:32:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:00] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:32:00] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:32:00] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:32:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:32:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:32:00] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-23 02:32:00] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:32:00] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 27 ms.
[2024-05-23 02:32:00] [INFO ] Added : 2 causal constraints over 1 iterations in 43 ms. Result :sat
Minimization took 26 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:[1] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 98 transition count 243
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 243
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 98 transition count 241
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 95 transition count 231
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 95 transition count 231
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 92 transition count 225
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 92 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 89 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 89 transition count 217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 86 transition count 211
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 86 transition count 211
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 83 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 83 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 80 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 80 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 78 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 77 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 76 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 76 transition count 191
Applied a total of 54 rules in 20 ms. Remains 76 /102 variables (removed 26) and now considering 191/253 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 76/102 places, 191/253 transitions.
[2024-05-23 02:32:00] [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 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 02:32:00] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-23 02:32:00] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 828 ms. (1206 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 348 ms. (2865 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 02:32:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:32:02] [INFO ] Invariant cache hit.
[2024-05-23 02:32:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:32:02] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:32:02] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:32:02] [INFO ] [Real]Added 18 Read/Feed constraints in 7 ms returned sat
[2024-05-23 02:32:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:32:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:02] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-23 02:32:02] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:32:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-23 02:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-23 02:32:02] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 02:32:02] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 02:32:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-23 02:32:02] [INFO ] Added : 14 causal constraints over 6 iterations in 105 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-23 02:32:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:32:02] [INFO ] Invariant cache hit.
[2024-05-23 02:32:02] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-23 02:32:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:32:02] [INFO ] Invariant cache hit.
[2024-05-23 02:32:02] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:32:02] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-23 02:32:02] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-23 02:32:02] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:32:02] [INFO ] Invariant cache hit.
[2024-05-23 02:32:02] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 117/193 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 189 unsolved in 2584 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 4197 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 6872ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 6875ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7028 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-23 02:32:09] [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 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2043626 steps, run timeout after 3001 ms. (steps per millisecond=680 ) properties seen :0 out of 1
Probabilistic random walk after 2043626 steps, saw 1219209 distinct states, run finished after 3001 ms. (steps per millisecond=680 ) properties seen :0
[2024-05-23 02:32:12] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-23 02:32:12] [INFO ] Invariant cache hit.
[2024-05-23 02:32:12] [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) 64/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/186 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/190 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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) 64/69 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/75 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 94/169 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/175 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/186 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/190 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/193 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
RANDOM walk for 30060 steps (6 resets) in 73 ms. (406 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-00 in 12191 ms.
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:32:12] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-23 02:32:12] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[47] Max Struct:[+inf]
[2024-05-23 02:32:12] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:32:12] [INFO ] Invariant cache hit.
[2024-05-23 02:32:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:12] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-23 02:32:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:32:12] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:32:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:32:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:32:12] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-23 02:32:12] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:32:12] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 12 ms.
[2024-05-23 02:32:12] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-23 02:32:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-23 02:32:13] [INFO ] Added : 13 causal constraints over 5 iterations in 136 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[47] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[47] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Graph (complete) has 432 edges and 102 vertex of which 99 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 99 transition count 248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 95 transition count 238
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 95 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 95 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 92 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 92 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 89 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 89 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 86 transition count 212
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 86 transition count 212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 83 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 83 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 80 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 80 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 77 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 77 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 75 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 74 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 74 transition count 188
Applied a total of 58 rules in 27 ms. Remains 74 /102 variables (removed 28) and now considering 188/253 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 74/102 places, 188/253 transitions.
[2024-05-23 02:32:13] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[47] Max Struct:[+inf]
[2024-05-23 02:32:13] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-23 02:32:13] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[47] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 883 ms. (1131 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 380 ms. (2624 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[47] Max Struct:[+inf]
[2024-05-23 02:32:14] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 02:32:14] [INFO ] Invariant cache hit.
[2024-05-23 02:32:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-23 02:32:14] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:32:14] [INFO ] [Real]Added 17 Read/Feed constraints in 6 ms returned sat
[2024-05-23 02:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:32:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:14] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:32:14] [INFO ] [Nat]Added 17 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:32:14] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-23 02:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-23 02:32:14] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 6 ms.
[2024-05-23 02:32:14] [INFO ] Added : 4 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[47] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[47] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 74/74 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-23 02:32:14] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 02:32:14] [INFO ] Invariant cache hit.
[2024-05-23 02:32:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:32:14] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 02:32:14] [INFO ] Invariant cache hit.
[2024-05-23 02:32:14] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:32:14] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-23 02:32:14] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-23 02:32:14] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 02:32:14] [INFO ] Invariant cache hit.
[2024-05-23 02:32:14] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 186 unsolved in 2393 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 115/189 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 186/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 280 constraints, problems are : Problem set: 0 solved, 186 unsolved in 3992 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 6503ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6506ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6682 ms. Remains : 74/74 places, 188/188 transitions.
[2024-05-23 02:32:21] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
Found an invariant !
This invariant on transitions {24=1, 50=1, 95=1, 113=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 55=1, 100=1, 114=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[47] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2088803 steps, run timeout after 3001 ms. (steps per millisecond=696 ) properties seen :0 out of 1
Probabilistic random walk after 2088803 steps, saw 1300183 distinct states, run finished after 3001 ms. (steps per millisecond=696 ) properties seen :0
[2024-05-23 02:32:24] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-23 02:32:24] [INFO ] Invariant cache hit.
[2024-05-23 02:32:24] [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) 64/68 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/166 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/172 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/182 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/186 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 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) 64/68 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 92/166 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/172 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/182 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/186 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/189 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/189 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/189 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 181ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 74/74 places, 188/188 transitions.
RANDOM walk for 40003 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25549 steps (4 resets) in 20 ms. (1216 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[47] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-02 in 12095 ms.
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:32:24] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-23 02:32:24] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 11 ms. (833 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:[28] Max Struct:[+inf]
[2024-05-23 02:32:24] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:32:24] [INFO ] Invariant cache hit.
[2024-05-23 02:32:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:24] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:32:24] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:32:24] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:32:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:24] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:32:24] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:32:25] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-23 02:32:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 02:32:25] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-23 02:32:25] [INFO ] Added : 10 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[28] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[28] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Graph (complete) has 432 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 99 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 96 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 96 transition count 240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 93 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 93 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 90 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 90 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 87 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 87 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 84 transition count 210
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 84 transition count 210
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 81 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 81 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 78 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 78 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 77 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 77 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 76 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 76 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 75 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 75 transition count 192
Applied a total of 54 rules in 15 ms. Remains 75 /102 variables (removed 27) and now considering 192/253 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 75/102 places, 192/253 transitions.
[2024-05-23 02:32:25] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[28] Max Struct:[+inf]
[2024-05-23 02:32:25] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
// Phase 1: matrix 117 rows 75 cols
[2024-05-23 02:32:25] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[28] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 905 ms. (1103 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 361 ms. (2762 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2322] Max Struct:[+inf]
[2024-05-23 02:32:26] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:26] [INFO ] Invariant cache hit.
[2024-05-23 02:32:26] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:26] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:32:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:32:26] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:32:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:32:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:32:26] [INFO ] [Nat]Added 17 Read/Feed constraints in 1 ms returned sat
[2024-05-23 02:32:26] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 02:32:26] [INFO ] Added : 7 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2322] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2322] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:32:28] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:28] [INFO ] Invariant cache hit.
[2024-05-23 02:32:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 02:32:28] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:28] [INFO ] Invariant cache hit.
[2024-05-23 02:32:28] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:32:28] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-23 02:32:28] [INFO ] Redundant transitions in 0 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:32:28] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:28] [INFO ] Invariant cache hit.
[2024-05-23 02:32:28] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6683ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6853 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-23 02:32:35] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2322] Max Struct:[+inf]
[2024-05-23 02:32:35] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2322] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 875 ms. (1141 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 359 ms. (2777 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2322] Max Struct:[+inf]
[2024-05-23 02:32:36] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:36] [INFO ] Invariant cache hit.
[2024-05-23 02:32:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:32:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:32:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:32:36] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:32:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:32:36] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-23 02:32:36] [INFO ] [Nat]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-23 02:32:36] [INFO ] Computed and/alt/rep : 60/196/52 causal constraints (skipped 63 transitions) in 7 ms.
[2024-05-23 02:32:36] [INFO ] Added : 7 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2322] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2322] Max Struct:[+inf]
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:32:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:38] [INFO ] Invariant cache hit.
[2024-05-23 02:32:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 02:32:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:38] [INFO ] Invariant cache hit.
[2024-05-23 02:32:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:32:38] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-23 02:32:38] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:32:38] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:38] [INFO ] Invariant cache hit.
[2024-05-23 02:32:38] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2412 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6629ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6805 ms. Remains : 75/75 places, 192/192 transitions.
[2024-05-23 02:32:45] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
Found an invariant !
This invariant on transitions {27=1, 55=1, 100=1, 116=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {25=1, 53=1, 98=1, 115=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2322] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2112407 steps, run timeout after 3001 ms. (steps per millisecond=703 ) properties seen :0 out of 1
Probabilistic random walk after 2112407 steps, saw 1314872 distinct states, run finished after 3001 ms. (steps per millisecond=703 ) properties seen :0
[2024-05-23 02:32:48] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:48] [INFO ] Invariant cache hit.
[2024-05-23 02:32:48] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1373 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
RANDOM walk for 40000 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2121829 steps, run timeout after 3001 ms. (steps per millisecond=707 ) properties seen :0 out of 1
Probabilistic random walk after 2121829 steps, saw 1320739 distinct states, run finished after 3002 ms. (steps per millisecond=706 ) properties seen :0
[2024-05-23 02:32:52] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:52] [INFO ] Invariant cache hit.
[2024-05-23 02:32:52] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/79 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 90/169 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 16/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/175 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/185 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/189 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/76 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/79 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/169 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/169 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/175 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/175 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/185 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/189 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/192 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/192 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1369 ms.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 75/75 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-23 02:32:54] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:54] [INFO ] Invariant cache hit.
[2024-05-23 02:32:54] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-23 02:32:54] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:54] [INFO ] Invariant cache hit.
[2024-05-23 02:32:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-23 02:32:54] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-23 02:32:54] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-23 02:32:54] [INFO ] Flow matrix only has 117 transitions (discarded 75 similar events)
[2024-05-23 02:32:54] [INFO ] Invariant cache hit.
[2024-05-23 02:32:54] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 190 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 117/192 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 190/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/192 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 285 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4173 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 6712ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 6715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6896 ms. Remains : 75/75 places, 192/192 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 75 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 69 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 87 place count 69 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 109 place count 58 transition count 100
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 143 place count 41 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 34 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 34 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 27 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 27 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 178 place count 20 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 185 place count 20 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 20 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 192 place count 20 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 19 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 18 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 18 transition count 30
Applied a total of 199 rules in 13 ms. Remains 18 /75 variables (removed 57) and now considering 30/192 (removed 162) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-23 02:33:01] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:33:01] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:33:01] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:33:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:33:01] [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:33:01] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:33:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:33:01] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:33:01] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:33:01] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:33:01] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2322] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-04 in 36610 ms.
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:33:01] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-23 02:33:01] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10005 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-23 02:33:01] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:33:01] [INFO ] Invariant cache hit.
[2024-05-23 02:33:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:33:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-23 02:33:01] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:33:01] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:33:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:33:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:33:01] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-23 02:33:01] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:33:01] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-23 02:33:01] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-23 02:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-23 02:33:01] [INFO ] Added : 22 causal constraints over 7 iterations in 160 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Graph (complete) has 432 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 99 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 96 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 96 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 94 transition count 232
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 94 transition count 232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 92 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 90 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 90 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 88 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 88 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 86 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 84 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 83 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 82 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 81 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 81 transition count 204
Applied a total of 44 rules in 16 ms. Remains 81 /102 variables (removed 21) and now considering 204/253 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 81/102 places, 204/253 transitions.
[2024-05-23 02:33:01] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=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 :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-23 02:33:01] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
// Phase 1: matrix 125 rows 81 cols
[2024-05-23 02:33:01] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 894 ms. (1117 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 354 ms. (2816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1616] Max Struct:[+inf]
[2024-05-23 02:33:03] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:03] [INFO ] Invariant cache hit.
[2024-05-23 02:33:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:33:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:33:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:03] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:33:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:33:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:33:03] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-23 02:33:03] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:33:03] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-23 02:33:03] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 4 ms to minimize.
[2024-05-23 02:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-23 02:33:03] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 11 ms.
[2024-05-23 02:33:03] [INFO ] Added : 19 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1616] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1616] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-23 02:33:05] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:05] [INFO ] Invariant cache hit.
[2024-05-23 02:33:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 02:33:06] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:06] [INFO ] Invariant cache hit.
[2024-05-23 02:33:06] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:06] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-23 02:33:06] [INFO ] Redundant transitions in 0 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-23 02:33:06] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:06] [INFO ] Invariant cache hit.
[2024-05-23 02:33:06] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 3308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 4505 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 7923ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 7927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8120 ms. Remains : 81/81 places, 204/204 transitions.
[2024-05-23 02:33:14] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=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 :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1616] Max Struct:[+inf]
[2024-05-23 02:33:14] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1616] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1045 ms. (956 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 353 ms. (2824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1616] Max Struct:[+inf]
[2024-05-23 02:33:15] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:15] [INFO ] Invariant cache hit.
[2024-05-23 02:33:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:33:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-23 02:33:15] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:15] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:33:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:33:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:33:15] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-23 02:33:15] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:33:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-23 02:33:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-23 02:33:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-23 02:33:15] [INFO ] Computed and/alt/rep : 59/193/53 causal constraints (skipped 70 transitions) in 7 ms.
[2024-05-23 02:33:15] [INFO ] Added : 19 causal constraints over 6 iterations in 52 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1616] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1616] Max Struct:[+inf]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 11 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-23 02:33:18] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:18] [INFO ] Invariant cache hit.
[2024-05-23 02:33:18] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 02:33:18] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:18] [INFO ] Invariant cache hit.
[2024-05-23 02:33:18] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:18] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-23 02:33:18] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-23 02:33:18] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:18] [INFO ] Invariant cache hit.
[2024-05-23 02:33:18] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 3352 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 4446 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 7934ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 7937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8133 ms. Remains : 81/81 places, 204/204 transitions.
[2024-05-23 02:33:26] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
Found an invariant !
This invariant on transitions {31=1, 63=1, 109=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {31=1, 63=1, 109=1, 123=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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1616] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2041785 steps, run timeout after 3001 ms. (steps per millisecond=680 ) properties seen :0 out of 1
Probabilistic random walk after 2041785 steps, saw 1270915 distinct states, run finished after 3001 ms. (steps per millisecond=680 ) properties seen :0
[2024-05-23 02:33:29] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:29] [INFO ] Invariant cache hit.
[2024-05-23 02:33:29] [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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/92 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 97/189 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/195 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/205 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/206 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/189 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/195 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/205 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/206 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 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: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2292 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
RANDOM walk for 40000 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1802624 steps, run timeout after 3001 ms. (steps per millisecond=600 ) properties seen :0 out of 1
Probabilistic random walk after 1802624 steps, saw 1122051 distinct states, run finished after 3001 ms. (steps per millisecond=600 ) properties seen :0
[2024-05-23 02:33:35] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:35] [INFO ] Invariant cache hit.
[2024-05-23 02:33:35] [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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/92 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 97/189 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/195 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/205 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/206 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 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) 8/11 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 71/82 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/92 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 97/189 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/195 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/205 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/206 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2307 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-23 02:33:37] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:37] [INFO ] Invariant cache hit.
[2024-05-23 02:33:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:33:37] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:37] [INFO ] Invariant cache hit.
[2024-05-23 02:33:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:37] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-23 02:33:37] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-23 02:33:37] [INFO ] Flow matrix only has 125 transitions (discarded 79 similar events)
[2024-05-23 02:33:37] [INFO ] Invariant cache hit.
[2024-05-23 02:33:37] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 102 constraints, problems are : Problem set: 0 solved, 202 unsolved in 3284 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/102 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 202/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 0/206 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 304 constraints, problems are : Problem set: 0 solved, 202 unsolved in 4493 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 81/81 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 7895ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 7898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8083 ms. Remains : 81/81 places, 204/204 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 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 86 rules applied. Total rules applied 86 place count 81 transition count 118
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 74 transition count 118
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 93 place count 74 transition count 102
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 125 place count 58 transition count 102
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 155 place count 43 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 36 transition count 73
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 36 transition count 73
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 29 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 29 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 190 place count 22 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 197 place count 22 transition count 45
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 204 place count 22 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 204 place count 22 transition count 37
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 206 place count 21 transition count 37
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 208 place count 20 transition count 37
Applied a total of 208 rules in 13 ms. Remains 20 /81 variables (removed 61) and now considering 37/204 (removed 167) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 20 cols
[2024-05-23 02:33:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:33:45] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:33:45] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:33:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:33:45] [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:33:45] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:33:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:33:45] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:33:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 02:33:45] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:33:45] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1616] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-05 in 44546 ms.
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 02:33:45] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-23 02:33:45] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (2 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[+inf]
[2024-05-23 02:33:45] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:33:45] [INFO ] Invariant cache hit.
[2024-05-23 02:33:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:33:46] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-23 02:33:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:33:46] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-23 02:33:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:33:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:33:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-23 02:33:46] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:33:46] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-23 02:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-23 02:33:46] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 17 ms.
[2024-05-23 02:33:46] [INFO ] Added : 19 causal constraints over 5 iterations in 74 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[19] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Graph (complete) has 432 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 99 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 96 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 96 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 96 transition count 240
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 94 transition count 232
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 94 transition count 232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 92 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 90 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 90 transition count 222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 88 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 88 transition count 218
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 86 transition count 214
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 84 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 84 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 82 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 81 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 80 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 80 transition count 202
Applied a total of 46 rules in 13 ms. Remains 80 /102 variables (removed 22) and now considering 202/253 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 80/102 places, 202/253 transitions.
[2024-05-23 02:33:46] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[19] Max Struct:[+inf]
[2024-05-23 02:33:46] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2024-05-23 02:33:46] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[19] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 876 ms. (1140 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 349 ms. (2857 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1620] Max Struct:[+inf]
[2024-05-23 02:33:47] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:47] [INFO ] Invariant cache hit.
[2024-05-23 02:33:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:33:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 02:33:47] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:47] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:33:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:33:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:33:47] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:33:47] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:33:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-23 02:33:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 02:33:47] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 6 ms.
[2024-05-23 02:33:47] [INFO ] Added : 8 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1620] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1620] Max Struct:[+inf]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-23 02:33:47] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:47] [INFO ] Invariant cache hit.
[2024-05-23 02:33:47] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-23 02:33:47] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:47] [INFO ] Invariant cache hit.
[2024-05-23 02:33:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:48] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-23 02:33:48] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-23 02:33:48] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:48] [INFO ] Invariant cache hit.
[2024-05-23 02:33:48] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 3046 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 301 constraints, problems are : Problem set: 0 solved, 200 unsolved in 4495 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 7645ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 7648ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7831 ms. Remains : 80/80 places, 202/202 transitions.
[2024-05-23 02:33:55] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[1620] Max Struct:[+inf]
[2024-05-23 02:33:55] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1620] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 886 ms. (1127 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 354 ms. (2816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1620] Max Struct:[+inf]
[2024-05-23 02:33:57] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:57] [INFO ] Invariant cache hit.
[2024-05-23 02:33:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:33:57] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-23 02:33:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:57] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:33:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:33:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:33:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-23 02:33:57] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:33:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-23 02:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-23 02:33:57] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 6 ms.
[2024-05-23 02:33:57] [INFO ] Added : 8 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1620] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1620] Max Struct:[+inf]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-23 02:33:57] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:57] [INFO ] Invariant cache hit.
[2024-05-23 02:33:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 02:33:57] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:57] [INFO ] Invariant cache hit.
[2024-05-23 02:33:57] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:33:57] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-23 02:33:57] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-23 02:33:57] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:33:57] [INFO ] Invariant cache hit.
[2024-05-23 02:33:57] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 3039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 301 constraints, problems are : Problem set: 0 solved, 200 unsolved in 4427 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 7573ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 7576ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7748 ms. Remains : 80/80 places, 202/202 transitions.
[2024-05-23 02:34:05] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
Found an invariant !
This invariant on transitions {27=1, 58=1, 104=1, 123=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 60=1, 90=1, 119=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1620] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2044443 steps, run timeout after 3001 ms. (steps per millisecond=681 ) properties seen :0 out of 1
Probabilistic random walk after 2044443 steps, saw 1272535 distinct states, run finished after 3002 ms. (steps per millisecond=681 ) properties seen :0
[2024-05-23 02:34:08] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:34:08] [INFO ] Invariant cache hit.
[2024-05-23 02:34:08] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/93 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/189 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/195 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/204 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/93 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 96/189 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 17/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/195 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/204 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 202/202 transitions.
RANDOM walk for 40000 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1942054 steps, run timeout after 3001 ms. (steps per millisecond=647 ) properties seen :0 out of 1
Probabilistic random walk after 1942054 steps, saw 1208807 distinct states, run finished after 3003 ms. (steps per millisecond=646 ) properties seen :0
[2024-05-23 02:34:11] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:34:11] [INFO ] Invariant cache hit.
[2024-05-23 02:34:11] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/93 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 96/189 variables, 55/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/195 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/204 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/86 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/93 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 96/189 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 17/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/195 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/204 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/204 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 80/80 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-23 02:34:11] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:34:11] [INFO ] Invariant cache hit.
[2024-05-23 02:34:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 02:34:11] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:34:11] [INFO ] Invariant cache hit.
[2024-05-23 02:34:11] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:34:11] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-23 02:34:11] [INFO ] Redundant transitions in 0 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-23 02:34:11] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-23 02:34:11] [INFO ] Invariant cache hit.
[2024-05-23 02:34:11] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 0/204 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 101 constraints, problems are : Problem set: 0 solved, 200 unsolved in 3044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 18/101 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 200/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 301 constraints, problems are : Problem set: 0 solved, 200 unsolved in 4448 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 7605ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 7611ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7791 ms. Remains : 80/80 places, 202/202 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 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 84 rules applied. Total rules applied 84 place count 80 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 74 transition count 118
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 90 place count 74 transition count 102
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 122 place count 58 transition count 102
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 152 place count 43 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 36 transition count 73
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 36 transition count 73
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 173 place count 29 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 29 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 187 place count 22 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 194 place count 22 transition count 45
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 201 place count 22 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 201 place count 22 transition count 37
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 203 place count 21 transition count 37
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 205 place count 20 transition count 37
Applied a total of 205 rules in 10 ms. Remains 20 /80 variables (removed 60) and now considering 37/202 (removed 165) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 37 rows 20 cols
[2024-05-23 02:34:19] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:34:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:34:19] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:34:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:34:19] [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:34:19] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:34:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:34:19] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:34:19] [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:34:19] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 02:34:19] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1620] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-07 in 33490 ms.
Starting property specific reduction for FunctionPointer-PT-b002-UpperBounds-08
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:34:19] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-23 02:34:19] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10005 steps (2 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 02:34:19] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-23 02:34:19] [INFO ] Invariant cache hit.
[2024-05-23 02:34:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:34:19] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:34:19] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-23 02:34:19] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-23 02:34:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:34:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 02:34:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-23 02:34:19] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-23 02:34:19] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-23 02:34:19] [INFO ] Added : 14 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Graph (complete) has 432 edges and 102 vertex of which 99 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 99 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 96 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 96 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 94 transition count 232
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 94 transition count 232
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 92 transition count 228
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 90 transition count 224
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 90 transition count 224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 88 transition count 220
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 88 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 86 transition count 216
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 86 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 84 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 83 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 83 transition count 210
Applied a total of 40 rules in 16 ms. Remains 83 /102 variables (removed 19) and now considering 210/253 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 83/102 places, 210/253 transitions.
[2024-05-23 02:34:19] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
Found an invariant !
This invariant on transitions {29=1, 64=1, 96=1, 126=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 64=1, 112=1, 128=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 :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 02:34:19] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2024-05-23 02:34:19] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 906 ms. (1102 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-08 in 1271 ms.
[2024-05-23 02:34:20] [INFO ] Flatten gal took : 44 ms
[2024-05-23 02:34:20] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-23 02:34:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 253 transitions and 1028 arcs took 4 ms.
Total runtime 235682 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b002

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 1340
MODEL NAME: /home/mcc/execution/411/model
102 places, 253 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.
Start RS construction.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716431661721

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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-b002"
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-b002, 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-171640601100221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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