Execution Chart

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

Trace from the execution

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

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

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:35:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 20:35:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:35:32] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-31 20:35:32] [INFO ] Transformed 306 places.
[2024-05-31 20:35:32] [INFO ] Transformed 840 transitions.
[2024-05-31 20:35:32] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 84 places in 11 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-31 20:35:32] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-31 20:35:32] [INFO ] Computed 4 invariants in 13 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 (21 resets) in 59 ms. (166 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-03 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (33 resets) in 86 ms. (919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 39, 3, 11, 1, 4, 3, 10] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, +inf, +inf]
[2024-05-31 20:35:32] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
[2024-05-31 20:35:32] [INFO ] Invariant cache hit.
[2024-05-31 20:35:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 20:35:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 20:35:32] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-31 20:35:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-31 20:35:33] [INFO ] [Real]Added 65 Read/Feed constraints in 11 ms returned sat
[2024-05-31 20:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Nat]Added 65 Read/Feed constraints in 15 ms returned sat
[2024-05-31 20:35:33] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 8 ms to minimize.
[2024-05-31 20:35:33] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 11 ms to minimize.
[2024-05-31 20:35:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2024-05-31 20:35:33] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 49 ms.
[2024-05-31 20:35:33] [INFO ] Added : 1 causal constraints over 1 iterations in 131 ms. Result :sat
Minimization took 85 ms.
[2024-05-31 20:35:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:35:34] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-31 20:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-31 20:35:34] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 48 ms.
[2024-05-31 20:35:34] [INFO ] Added : 1 causal constraints over 1 iterations in 91 ms. Result :sat
Minimization took 74 ms.
[2024-05-31 20:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Nat]Added 65 Read/Feed constraints in 9 ms returned sat
[2024-05-31 20:35:34] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 37 ms.
[2024-05-31 20:35:34] [INFO ] Added : 1 causal constraints over 1 iterations in 79 ms. Result :sat
Minimization took 72 ms.
[2024-05-31 20:35:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-31 20:35:34] [INFO ] [Real]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:35:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:35:35] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-31 20:35:35] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 35 ms.
[2024-05-31 20:35:35] [INFO ] Added : 2 causal constraints over 1 iterations in 84 ms. Result :sat
Minimization took 70 ms.
[2024-05-31 20:35:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:35:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:35:35] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 29 ms.
[2024-05-31 20:35:35] [INFO ] Added : 1 causal constraints over 1 iterations in 81 ms. Result :sat
Minimization took 80 ms.
[2024-05-31 20:35:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 20:35:35] [INFO ] [Real]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:35:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2024-05-31 20:35:36] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-31 20:35:36] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 4 ms to minimize.
[2024-05-31 20:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2024-05-31 20:35:36] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 27 ms.
[2024-05-31 20:35:36] [INFO ] Added : 1 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 80 ms.
[2024-05-31 20:35:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Real]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-31 20:35:36] [INFO ] [Nat]Added 65 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:35:36] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 3 ms to minimize.
[2024-05-31 20:35:36] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:35:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2024-05-31 20:35:37] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 31 ms.
[2024-05-31 20:35:37] [INFO ] Added : 2 causal constraints over 1 iterations in 77 ms. Result :sat
Minimization took 82 ms.
[2024-05-31 20:35:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:35:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 20:35:37] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-31 20:35:37] [INFO ] [Real]Added 65 Read/Feed constraints in 18 ms returned sat
[2024-05-31 20:35:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-31 20:35:37] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 20:35:37] [INFO ] [Nat]Added 65 Read/Feed constraints in 13 ms returned sat
[2024-05-31 20:35:37] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-31 20:35:37] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 28 ms.
[2024-05-31 20:35:37] [INFO ] Added : 2 causal constraints over 1 iterations in 82 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 39, 3, 11, 1, 4, 3, 10] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 39, 3, 11, 1, 4, 3, 10] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, +inf, +inf]
Support contains 8 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 191 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.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 124 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 134 ms. Remains : 103/222 places, 257/648 transitions.
[2024-05-31 20:35:37] [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 5 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 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :[0, 0, 0, 0, 1, 3, 0, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 39, 3, 11, 1, 4, 3, 10] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, +inf, +inf]
[2024-05-31 20:35:38] [INFO ] Flow matrix only has 164 transitions (discarded 93 similar events)
// Phase 1: matrix 164 rows 103 cols
[2024-05-31 20:35:38] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 39, 3, 11, 1, 4, 3, 10] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1224 ms. (816 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 3262 ms. (2451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 39, 4, 1357, 1, 1600, 539, 1614] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, +inf, +inf]
[2024-05-31 20:35:42] [INFO ] Flow matrix only has 164 transitions (discarded 93 similar events)
[2024-05-31 20:35:42] [INFO ] Invariant cache hit.
[2024-05-31 20:35:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:42] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:35:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:35:42] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:42] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:42] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:35:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2024-05-31 20:35:42] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 12 ms.
[2024-05-31 20:35:42] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-31 20:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 20:35:43] [INFO ] Added : 8 causal constraints over 3 iterations in 122 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2024-05-31 20:35:43] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:35:43] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 9 ms.
[2024-05-31 20:35:43] [INFO ] Added : 7 causal constraints over 3 iterations in 48 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:35:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:35:43] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 9 ms.
[2024-05-31 20:35:43] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-31 20:35:43] [INFO ] Added : 9 causal constraints over 4 iterations in 126 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:43] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 12 ms.
[2024-05-31 20:35:43] [INFO ] Added : 11 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:43] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:44] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 14 ms.
[2024-05-31 20:35:44] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 20:35:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:35:44] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 9 ms.
[2024-05-31 20:35:44] [INFO ] Added : 19 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:35:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:35:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:35:44] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 9 ms.
[2024-05-31 20:35:44] [INFO ] Added : 17 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:35:44] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:35:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:44] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:44] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 11 ms.
[2024-05-31 20:35:44] [INFO ] Added : 7 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 39, 4, 1357, 1, 1600, 539, 1614] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, +inf, +inf]
FORMULA FunctionPointer-PT-b002-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 258, 9, 1357, 1600, 539, 1614] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 257/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 103 /103 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 103/103 places, 257/257 transitions.
[2024-05-31 20:35:54] [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 1 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 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :[0, 0, 0, 0, 0, 0, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 258, 9, 1357, 1600, 539, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:35:54] [INFO ] Flow matrix only has 164 transitions (discarded 93 similar events)
[2024-05-31 20:35:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 258, 9, 1357, 1600, 539, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1178 ms. (848 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6000006 steps (12 resets) in 2492 ms. (2406 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 258, 9, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:35:58] [INFO ] Flow matrix only has 164 transitions (discarded 93 similar events)
[2024-05-31 20:35:58] [INFO ] Invariant cache hit.
[2024-05-31 20:35:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:58] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:58] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:35:58] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:58] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:35:58] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:35:58] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-31 20:35:58] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 11 ms.
[2024-05-31 20:35:58] [INFO ] Added : 5 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:35:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:58] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:35:58] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:58] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:35:58] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:58] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:35:58] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 8 ms.
[2024-05-31 20:35:58] [INFO ] Added : 7 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:35:59] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 8 ms.
[2024-05-31 20:35:59] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-31 20:35:59] [INFO ] Added : 9 causal constraints over 4 iterations in 112 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:59] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 10 ms.
[2024-05-31 20:35:59] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:35:59] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 9 ms.
[2024-05-31 20:35:59] [INFO ] Added : 19 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:35:59] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:35:59] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 98 transitions) in 11 ms.
[2024-05-31 20:35:59] [INFO ] Added : 17 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 258, 9, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 525, 9, 1357, 1600, 539] 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 22 ms. Remains : 102/103 places, 253/257 transitions.
[2024-05-31 20:36:05] [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 1 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 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :[0, 0, 0, 0, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 525, 9, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:36:05] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
// Phase 1: matrix 162 rows 102 cols
[2024-05-31 20:36:05] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 525, 9, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1048 ms. (953 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2400 ms. (2498 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 525, 1785, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:36:09] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:09] [INFO ] Invariant cache hit.
[2024-05-31 20:36:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:09] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:36:09] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:36:09] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:36:09] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:36:09] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:36:09] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:36:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:36:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2024-05-31 20:36:09] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:36:09] [INFO ] Added : 7 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:36:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:09] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:36:09] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:36:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:36:09] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:09] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:36:10] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:36:10] [INFO ] Added : 13 causal constraints over 5 iterations in 130 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:36:10] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-31 20:36:10] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 12 ms.
[2024-05-31 20:36:10] [INFO ] Added : 10 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:36:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:10] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-31 20:36:10] [INFO ] Added : 26 causal constraints over 7 iterations in 89 ms. Result :sat
Minimization took 33 ms.
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:36:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:10] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:36:10] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:36:10] [INFO ] Added : 19 causal constraints over 5 iterations in 64 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:10] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:36:11] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:11] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:36:11] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:36:11] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:36:11] [INFO ] Added : 14 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 525, 1785, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 525, 1785, 1357, 1600, 539] 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 6 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 6 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-31 20:36:18] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:18] [INFO ] Invariant cache hit.
[2024-05-31 20:36:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-31 20:36:18] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:18] [INFO ] Invariant cache hit.
[2024-05-31 20:36:19] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:36:19] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-31 20:36:19] [INFO ] Redundant transitions in 13 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-31 20:36:19] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:19] [INFO ] Invariant cache hit.
[2024-05-31 20:36:19] [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 4868 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 6797 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 11975ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 11997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12293 ms. Remains : 102/102 places, 253/253 transitions.
[2024-05-31 20:36:31] [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 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :[1, 0, 2, 3, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 525, 1785, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:36:31] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 525, 1785, 1357, 1600, 539] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1114 ms. (896 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2430 ms. (2468 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 525, 1785, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:36:34] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:34] [INFO ] Invariant cache hit.
[2024-05-31 20:36:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:34] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:36:34] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:36:34] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:34] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-31 20:36:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:36:35] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:36:35] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:36:35] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:36:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2024-05-31 20:36:35] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-31 20:36:35] [INFO ] Added : 7 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:36:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:36:35] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:36:35] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:36:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-31 20:36:35] [INFO ] Added : 13 causal constraints over 5 iterations in 142 ms. Result :sat
Minimization took 32 ms.
[2024-05-31 20:36:35] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:36:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:36:35] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:36:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-31 20:36:35] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:36:35] [INFO ] Added : 10 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:36:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:36:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:36:35] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:36:35] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-31 20:36:36] [INFO ] Added : 26 causal constraints over 7 iterations in 87 ms. Result :sat
Minimization took 34 ms.
[2024-05-31 20:36:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:36:36] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-31 20:36:36] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:36:36] [INFO ] Added : 19 causal constraints over 5 iterations in 76 ms. Result :sat
Minimization took 35 ms.
[2024-05-31 20:36:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:36:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:36:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:36:36] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:36:36] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:36:36] [INFO ] Added : 14 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 525, 1785, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 525, 1785, 1357, 1600, 1378] 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 5 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 5 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 5 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 20:36:46] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:46] [INFO ] Invariant cache hit.
[2024-05-31 20:36:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 20:36:46] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:46] [INFO ] Invariant cache hit.
[2024-05-31 20:36:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:36:46] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-31 20:36:46] [INFO ] Redundant transitions in 4 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-31 20:36:46] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:46] [INFO ] Invariant cache hit.
[2024-05-31 20:36:46] [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 4862 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 6836 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 11905ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 11910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12133 ms. Remains : 102/102 places, 253/253 transitions.
[2024-05-31 20:36:58] [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 1 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 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 525, 1785, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:36:58] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:36:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 525, 1785, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1102 ms. (906 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 2298 ms. (2609 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4733, 1794, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:37:01] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:01] [INFO ] Invariant cache hit.
[2024-05-31 20:37:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:01] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:37:01] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:37:01] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:02] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 0 ms to minimize.
[2024-05-31 20:37:02] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:37:02] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-31 20:37:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 162 ms
[2024-05-31 20:37:02] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:37:02] [INFO ] Added : 7 causal constraints over 2 iterations in 33 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:02] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:37:02] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-31 20:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:37:02] [INFO ] Added : 13 causal constraints over 5 iterations in 124 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:37:02] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 4 ms to minimize.
[2024-05-31 20:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-31 20:37:02] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-31 20:37:02] [INFO ] Added : 10 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 33 ms.
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:37:02] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:37:03] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:37:03] [INFO ] Added : 26 causal constraints over 7 iterations in 78 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:37:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:03] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-31 20:37:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-31 20:37:03] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:37:03] [INFO ] Added : 19 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:37:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:37:03] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:37:03] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:37:03] [INFO ] Added : 14 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4733, 1794, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4733, 1794, 1357, 1600, 1378] 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 17 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 18 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 4 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 20:37:17] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:17] [INFO ] Invariant cache hit.
[2024-05-31 20:37:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 20:37:17] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:17] [INFO ] Invariant cache hit.
[2024-05-31 20:37:17] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:37:17] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-31 20:37:17] [INFO ] Redundant transitions in 2 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-31 20:37:17] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:17] [INFO ] Invariant cache hit.
[2024-05-31 20:37:17] [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 4910 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 6653 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 11730ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 11732ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11972 ms. Remains : 102/102 places, 253/253 transitions.
[2024-05-31 20:37:29] [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 1 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 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4733, 1794, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:37:29] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4733, 1794, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1038 ms. (962 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2318 ms. (2587 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4733, 1808, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:37:32] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:32] [INFO ] Invariant cache hit.
[2024-05-31 20:37:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:32] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:37:32] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:37:32] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:32] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:37:32] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:32] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:37:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-31 20:37:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:37:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2024-05-31 20:37:32] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:37:32] [INFO ] Added : 7 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 20:37:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:37:32] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:32] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:37:32] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:32] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:37:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:37:33] [INFO ] Added : 13 causal constraints over 5 iterations in 125 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:37:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:37:33] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-31 20:37:33] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-31 20:37:33] [INFO ] Added : 10 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 20:37:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:33] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:37:33] [INFO ] Added : 26 causal constraints over 7 iterations in 87 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:37:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:37:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:33] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:37:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 20:37:33] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:37:33] [INFO ] Added : 19 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:37:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:34] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 20:37:34] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:37:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:37:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:37:34] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:37:34] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 12 ms.
[2024-05-31 20:37:34] [INFO ] Added : 14 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4733, 1808, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4733, 1808, 1357, 1600, 1378] 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 5 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 5 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 4 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 20:37:48] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:48] [INFO ] Invariant cache hit.
[2024-05-31 20:37:48] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 20:37:48] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:48] [INFO ] Invariant cache hit.
[2024-05-31 20:37:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:37:48] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-31 20:37:48] [INFO ] Redundant transitions in 3 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-31 20:37:48] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:37:48] [INFO ] Invariant cache hit.
[2024-05-31 20:37:48] [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 4843 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 6502 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 11521ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 11523ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11729 ms. Remains : 102/102 places, 253/253 transitions.
[2024-05-31 20:38:00] [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 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4733, 1808, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:38:00] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:38:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4733, 1808, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1110 ms. (900 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2343 ms. (2559 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4733, 1897, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:38:03] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:38:03] [INFO ] Invariant cache hit.
[2024-05-31 20:38:03] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:38:03] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:03] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:38:03] [INFO ] [Nat]Added 27 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:38:03] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:38:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:38:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:38:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2024-05-31 20:38:04] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:38:04] [INFO ] Added : 7 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:04] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:38:04] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-31 20:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-31 20:38:04] [INFO ] Added : 13 causal constraints over 5 iterations in 127 ms. Result :sat
Minimization took 29 ms.
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:04] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:38:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 20:38:04] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:38:04] [INFO ] Added : 10 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:04] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 12 ms.
[2024-05-31 20:38:04] [INFO ] Added : 26 causal constraints over 7 iterations in 89 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:04] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:05] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 20:38:05] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 10 ms.
[2024-05-31 20:38:05] [INFO ] Added : 19 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 27 ms.
[2024-05-31 20:38:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:38:05] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:05] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:38:05] [INFO ] Added : 14 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4733, 1897, 1357, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4733, 1897, 1357, 1600, 1378] 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 5 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 5 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 4 ms. Remains 102 /102 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 20:38:18] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:38:18] [INFO ] Invariant cache hit.
[2024-05-31 20:38:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 20:38:18] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:38:18] [INFO ] Invariant cache hit.
[2024-05-31 20:38:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:38:18] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-31 20:38:18] [INFO ] Redundant transitions in 1 ms returned []
Running 251 sub problems to find dead transitions.
[2024-05-31 20:38:18] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:38:18] [INFO ] Invariant cache hit.
[2024-05-31 20:38:18] [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 4867 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 6466 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 11489ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 11491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11691 ms. Remains : 102/102 places, 253/253 transitions.
[2024-05-31 20:38:30] [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 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :[1, 0, 2147483647, 2147483647, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4733, +inf, +inf, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 20:38:30] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:38:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4733, +inf, +inf, 1600, 1378] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1019 ms. (980 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000004 steps (8 resets) in 1499 ms. (2666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-31 20:38:32] [INFO ] Flow matrix only has 162 transitions (discarded 91 similar events)
[2024-05-31 20:38:32] [INFO ] Invariant cache hit.
[2024-05-31 20:38:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:32] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:38:32] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:38:32] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:32] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:38:32] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:32] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-31 20:38:32] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 4 ms to minimize.
[2024-05-31 20:38:32] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
[2024-05-31 20:38:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2024-05-31 20:38:32] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:38:32] [INFO ] Added : 7 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:33] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 8 ms.
[2024-05-31 20:38:33] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:38:33] [INFO ] Added : 13 causal constraints over 5 iterations in 130 ms. Result :sat
Minimization took 30 ms.
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:33] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-31 20:38:33] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-31 20:38:33] [INFO ] Added : 19 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 28 ms.
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:33] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:33] [INFO ] Computed and/alt/rep : 68/344/64 causal constraints (skipped 96 transitions) in 9 ms.
[2024-05-31 20:38:33] [INFO ] Added : 14 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 253/253 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 100 transition count 247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 99 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 99 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 98 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 98 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 97 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 97 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 96 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 96 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 95 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 95 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 94 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 94 transition count 233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 93 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 93 transition count 231
Applied a total of 20 rules in 32 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 32 ms. Remains : 93/102 places, 231/253 transitions.
[2024-05-31 20:38:44] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
Found an invariant !
This invariant on transitions {30=1, 71=1, 105=1, 138=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {26=1, 67=1, 117=1, 143=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :[0, 4, 2, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-31 20:38:44] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
// Phase 1: matrix 147 rows 93 cols
[2024-05-31 20:38:44] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 962 ms. (1038 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 1499 ms. (2666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
[2024-05-31 20:38:46] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:38:46] [INFO ] Invariant cache hit.
[2024-05-31 20:38:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:46] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:38:46] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:38:46] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:46] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 20:38:46] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:38:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-31 20:38:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-31 20:38:46] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-31 20:38:46] [INFO ] Added : 7 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 25 ms.
[2024-05-31 20:38:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:46] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:46] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:38:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:47] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-31 20:38:47] [INFO ] Added : 9 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 26 ms.
[2024-05-31 20:38:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Nat]Added 24 Read/Feed constraints in 6 ms returned sat
[2024-05-31 20:38:47] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-31 20:38:47] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-31 20:38:47] [INFO ] Added : 23 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 31 ms.
[2024-05-31 20:38:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:38:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 20:38:47] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:38:47] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-31 20:38:47] [INFO ] Added : 26 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 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 4 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 4 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 11 ms. Remains 93 /93 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-31 20:38:57] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:38:57] [INFO ] Invariant cache hit.
[2024-05-31 20:38:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:38:57] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:38:57] [INFO ] Invariant cache hit.
[2024-05-31 20:38:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:38:57] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-31 20:38:57] [INFO ] Redundant transitions in 1 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-31 20:38:57] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:38:57] [INFO ] Invariant cache hit.
[2024-05-31 20:38:57] [INFO ] State equation strengthened by 24 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, 24/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 120 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3323 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 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, 24/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 229/349 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 349 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5705 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 9176ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 9179ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9386 ms. Remains : 93/93 places, 231/231 transitions.
[2024-05-31 20:39:06] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
Found an invariant !
This invariant on transitions {30=1, 71=1, 105=1, 138=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 67=1, 117=1, 143=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 4) seen :[1, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 40001 steps (8 resets) in 820 ms. (48 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 348115 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 4
Probabilistic random walk after 348115 steps, saw 216703 distinct states, run finished after 3019 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-31 20:39:10] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:39:10] [INFO ] Invariant cache hit.
[2024-05-31 20:39:10] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/109 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/116 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 107/223 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/229 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/239 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/240 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 120 constraints, problems are : Problem set: 0 solved, 4 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/109 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/116 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 107/223 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 22/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/229 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/239 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/239 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 4 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 4 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 5 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 5 ms. Remains : 93/93 places, 231/231 transitions.
RANDOM walk for 40001 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 370229 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 4
Probabilistic random walk after 370229 steps, saw 230754 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-31 20:39:13] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:39:13] [INFO ] Invariant cache hit.
[2024-05-31 20:39:13] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/109 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 7/116 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 107/223 variables, 63/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 22/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/229 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/239 variables, 10/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/240 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 120 constraints, problems are : Problem set: 0 solved, 4 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/109 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 7/116 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 107/223 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 22/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/229 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 10/239 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/239 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/240 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 4 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4 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 3 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 4 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 3 ms. Remains 93 /93 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-31 20:39:14] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:39:14] [INFO ] Invariant cache hit.
[2024-05-31 20:39:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 20:39:14] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:39:14] [INFO ] Invariant cache hit.
[2024-05-31 20:39:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:39:14] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-31 20:39:14] [INFO ] Redundant transitions in 1 ms returned []
Running 229 sub problems to find dead transitions.
[2024-05-31 20:39:14] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:39:14] [INFO ] Invariant cache hit.
[2024-05-31 20:39:14] [INFO ] State equation strengthened by 24 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, 24/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 0/240 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 120 constraints, problems are : Problem set: 0 solved, 229 unsolved in 3325 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 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, 24/120 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 229/349 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 349 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5565 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 9038ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 9041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9261 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 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 93 transition count 140
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 100 place count 86 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 84 transition count 138
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 102 place count 84 transition count 120
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 138 place count 66 transition count 120
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 168 place count 51 transition count 105
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 175 place count 44 transition count 91
Iterating global reduction 3 with 7 rules applied. Total rules applied 182 place count 44 transition count 91
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 189 place count 37 transition count 77
Iterating global reduction 3 with 7 rules applied. Total rules applied 196 place count 37 transition count 77
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 203 place count 30 transition count 63
Iterating global reduction 3 with 7 rules applied. Total rules applied 210 place count 30 transition count 63
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 217 place count 30 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 217 place count 30 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 29 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 223 place count 27 transition count 55
Applied a total of 223 rules in 21 ms. Remains 27 /93 variables (removed 66) and now considering 55/231 (removed 176) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 55 rows 27 cols
[2024-05-31 20:39:23] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:39:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:23] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 20:39:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:23] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 20:39:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:39:23] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 20:39:23] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 20:39:23] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 137 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4, 4733, 1631, 1378] Max Struct:[+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-31 20:39:23] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
// Phase 1: matrix 147 rows 93 cols
[2024-05-31 20:39:23] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 20:39:23] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:39:23] [INFO ] Invariant cache hit.
[2024-05-31 20:39:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 20:39:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:39:23] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:39:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:39:23] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 20:39:23] [INFO ] [Nat]Added 24 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:39:23] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:39:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-31 20:39:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-31 20:39:23] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 7 ms.
[2024-05-31 20:39:23] [INFO ] Added : 12 causal constraints over 4 iterations in 54 ms. Result :sat
Minimization took 30 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:[3] Max Struct:[+inf]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 231/231 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 91 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 91 transition count 225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 89 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 89 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 87 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 87 transition count 215
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 85 transition count 209
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 85 transition count 209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 83 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 83 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 81 transition count 201
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 81 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 79 transition count 197
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 79 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 78 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 78 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 77 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 77 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 76 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 76 transition count 191
Applied a total of 34 rules in 19 ms. Remains 76 /93 variables (removed 17) and now considering 191/231 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 76/93 places, 191/231 transitions.
[2024-05-31 20:39:23] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
Found an invariant !
This invariant on transitions {31=1, 56=1, 102=1, 115=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {31=1, 56=1, 86=1, 112=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 20:39:23] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2024-05-31 20:39:23] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 864 ms. (1156 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:[3] Max Struct:[+inf]
[2024-05-31 20:39:25] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:25] [INFO ] Invariant cache hit.
[2024-05-31 20:39:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:39:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:39:25] [INFO ] [Real]Added 18 Read/Feed constraints in 7 ms returned sat
[2024-05-31 20:39:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:39:25] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:39:25] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-31 20:39:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-31 20:39:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2024-05-31 20:39:25] [INFO ] Computed and/alt/rep : 61/197/52 causal constraints (skipped 63 transitions) in 6 ms.
[2024-05-31 20:39:25] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 20 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 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 5 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 5 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 20:39:25] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:25] [INFO ] Invariant cache hit.
[2024-05-31 20:39:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 20:39:25] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:25] [INFO ] Invariant cache hit.
[2024-05-31 20:39:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:39:25] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-31 20:39:25] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 20:39:25] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:25] [INFO ] Invariant cache hit.
[2024-05-31 20:39:25] [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 2559 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 4061 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 6713ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 6715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6894 ms. Remains : 76/76 places, 191/191 transitions.
[2024-05-31 20:39:32] [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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2068438 steps, run timeout after 3001 ms. (steps per millisecond=689 ) properties seen :0 out of 1
Probabilistic random walk after 2068438 steps, saw 1233590 distinct states, run finished after 3001 ms. (steps per millisecond=689 ) properties seen :0
[2024-05-31 20:39:35] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:35] [INFO ] Invariant cache hit.
[2024-05-31 20:39: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) 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 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
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 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 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.
RANDOM walk for 40000 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1966056 steps, run timeout after 3001 ms. (steps per millisecond=655 ) properties seen :0 out of 1
Probabilistic random walk after 1966056 steps, saw 1174254 distinct states, run finished after 3001 ms. (steps per millisecond=655 ) properties seen :0
[2024-05-31 20:39:38] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:38] [INFO ] Invariant cache hit.
[2024-05-31 20:39:38] [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 86 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 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 93 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 182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 7 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 7 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-31 20:39:38] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:38] [INFO ] Invariant cache hit.
[2024-05-31 20:39:38] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 20:39:38] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:38] [INFO ] Invariant cache hit.
[2024-05-31 20:39:38] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:39:39] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-31 20:39:39] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-31 20:39:39] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2024-05-31 20:39:39] [INFO ] Invariant cache hit.
[2024-05-31 20:39:39] [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 2524 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 4047 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 6664ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 6666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6853 ms. Remains : 76/76 places, 191/191 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 76 transition count 110
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 69 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 68 transition count 109
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 90 place count 68 transition count 97
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 114 place count 56 transition count 97
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 144 place count 41 transition count 82
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 151 place count 34 transition count 68
Iterating global reduction 3 with 7 rules applied. Total rules applied 158 place count 34 transition count 68
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 165 place count 27 transition count 54
Iterating global reduction 3 with 7 rules applied. Total rules applied 172 place count 27 transition count 54
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 179 place count 20 transition count 40
Iterating global reduction 3 with 7 rules applied. Total rules applied 186 place count 20 transition count 40
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 193 place count 20 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 193 place count 20 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 19 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 18 transition count 32
Applied a total of 197 rules in 9 ms. Remains 18 /76 variables (removed 58) and now considering 32/191 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 18 cols
[2024-05-31 20:39:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:39:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:45] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:39:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:45] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:39:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:39:45] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:39:45] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:39:45] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 62 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-00 in 22252 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-31 20:39:45] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
// Phase 1: matrix 147 rows 93 cols
[2024-05-31 20:39:45] [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 11 ms. (833 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:[56] Max Struct:[+inf]
[2024-05-31 20:39:45] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:39:45] [INFO ] Invariant cache hit.
[2024-05-31 20:39:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:39:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:39:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:39:45] [INFO ] [Real]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:39:45] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:39:45] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-31 20:39:45] [INFO ] Added : 9 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[56] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[56] Max Struct:[+inf]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 231/231 transitions.
Graph (complete) has 399 edges and 93 vertex of which 90 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 90 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 88 transition count 220
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 88 transition count 220
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 86 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 84 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 84 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 82 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 82 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 80 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 80 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 78 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 78 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 76 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 76 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 75 transition count 190
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 75 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 74 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 74 transition count 188
Applied a total of 38 rules in 14 ms. Remains 74 /93 variables (removed 19) and now considering 188/231 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 74/93 places, 188/231 transitions.
[2024-05-31 20:39:46] [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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[56] Max Struct:[+inf]
[2024-05-31 20:39:46] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
// Phase 1: matrix 115 rows 74 cols
[2024-05-31 20:39:46] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[56] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 879 ms. (1136 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 363 ms. (2747 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[27775] Max Struct:[+inf]
[2024-05-31 20:39:47] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:39:47] [INFO ] Invariant cache hit.
[2024-05-31 20:39:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:47] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:39:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:39:47] [INFO ] [Real]Added 17 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:39:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:39:47] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-31 20:39:47] [INFO ] [Nat]Added 17 Read/Feed constraints in 5 ms returned sat
[2024-05-31 20:39:47] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-31 20:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-31 20:39:47] [INFO ] Computed and/alt/rep : 60/195/52 causal constraints (skipped 61 transitions) in 7 ms.
[2024-05-31 20:39:47] [INFO ] Added : 4 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[27775] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[27775] Max Struct:[+inf]
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 188/188 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 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-31 20:40:02] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:40:02] [INFO ] Invariant cache hit.
[2024-05-31 20:40:03] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 20:40:03] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:40:03] [INFO ] Invariant cache hit.
[2024-05-31 20:40:03] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-31 20:40:03] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-31 20:40:03] [INFO ] Redundant transitions in 0 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-31 20:40:03] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:40:03] [INFO ] Invariant cache hit.
[2024-05-31 20:40:03] [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 2365 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 4080 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 6537ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 6541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6709 ms. Remains : 74/74 places, 188/188 transitions.
[2024-05-31 20:40:09] [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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:40:09] [INFO ] Flow matrix only has 115 transitions (discarded 73 similar events)
[2024-05-31 20:40:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 867 ms. (1152 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-02 in 24819 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-31 20:40:10] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
// Phase 1: matrix 147 rows 93 cols
[2024-05-31 20:40:10] [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 15 ms. (625 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:[0] Max Struct:[+inf]
[2024-05-31 20:40:10] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:40:10] [INFO ] Invariant cache hit.
[2024-05-31 20:40:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:40:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:40:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:40:10] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:40:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:40:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:40:10] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:40:10] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 9 ms.
[2024-05-31 20:40:10] [INFO ] Added : 18 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 231/231 transitions.
Graph (complete) has 399 edges and 93 vertex of which 90 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 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 89 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 89 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 88 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 87 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 86 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 85 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 84 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 83 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 82 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 81 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 81 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 80 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 80 transition count 202
Applied a total of 26 rules in 18 ms. Remains 80 /93 variables (removed 13) and now considering 202/231 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 80/93 places, 202/231 transitions.
[2024-05-31 20:40:10] [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 1 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 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 20:40:10] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
// Phase 1: matrix 124 rows 80 cols
[2024-05-31 20:40:10] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] 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 374 ms. (2666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1633] Max Struct:[+inf]
[2024-05-31 20:40:12] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:40:12] [INFO ] Invariant cache hit.
[2024-05-31 20:40:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:40:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:40:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:40:12] [INFO ] [Real]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:40:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:40:12] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-31 20:40:12] [INFO ] [Nat]Added 18 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:40:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:40:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-31 20:40:12] [INFO ] Computed and/alt/rep : 59/192/53 causal constraints (skipped 69 transitions) in 8 ms.
[2024-05-31 20:40:12] [INFO ] Added : 8 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1633] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1633] 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 4 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 9 ms. Remains 80 /80 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-31 20:40:12] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:40:12] [INFO ] Invariant cache hit.
[2024-05-31 20:40:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 20:40:12] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:40:12] [INFO ] Invariant cache hit.
[2024-05-31 20:40:12] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:40:12] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-31 20:40:12] [INFO ] Redundant transitions in 0 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-31 20:40:12] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:40:12] [INFO ] Invariant cache hit.
[2024-05-31 20:40:12] [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 3009 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 4430 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 7539ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 7541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7732 ms. Remains : 80/80 places, 202/202 transitions.
[2024-05-31 20:40:20] [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 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-31 20:40:20] [INFO ] Flow matrix only has 124 transitions (discarded 78 similar events)
[2024-05-31 20:40:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 874 ms. (1142 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-07 +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-07 in 10535 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-31 20:40:21] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
// Phase 1: matrix 147 rows 93 cols
[2024-05-31 20:40:21] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 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:[8] Max Struct:[+inf]
[2024-05-31 20:40:21] [INFO ] Flow matrix only has 147 transitions (discarded 84 similar events)
[2024-05-31 20:40:21] [INFO ] Invariant cache hit.
[2024-05-31 20:40:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:40:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 20:40:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:40:21] [INFO ] [Real]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-31 20:40:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:40:21] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 20:40:21] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:40:21] [INFO ] Computed and/alt/rep : 65/287/60 causal constraints (skipped 85 transitions) in 8 ms.
[2024-05-31 20:40:21] [INFO ] Added : 26 causal constraints over 7 iterations in 76 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8] Max Struct:[+inf]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 231/231 transitions.
Graph (complete) has 399 edges and 93 vertex of which 90 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 90 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 89 transition count 222
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 89 transition count 222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 88 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 88 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 87 transition count 218
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 87 transition count 218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 86 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 86 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 85 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 85 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 84 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 84 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 83 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 83 transition count 210
Applied a total of 20 rules in 8 ms. Remains 83 /93 variables (removed 10) and now considering 210/231 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 83/93 places, 210/231 transitions.
[2024-05-31 20:40:21] [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 1 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[8] Max Struct:[+inf]
[2024-05-31 20:40:21] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
// Phase 1: matrix 130 rows 83 cols
[2024-05-31 20:40:21] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[8] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 959 ms. (1041 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 408 ms. (2444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[541] Max Struct:[+inf]
[2024-05-31 20:40:22] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:22] [INFO ] Invariant cache hit.
[2024-05-31 20:40:22] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:40:22] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:40:22] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:40:22] [INFO ] [Real]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:40:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:40:23] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 20:40:23] [INFO ] [Nat]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:40:23] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:40:23] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-31 20:40:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-31 20:40:23] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 7 ms.
[2024-05-31 20:40:23] [INFO ] Added : 13 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[541] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[541] Max Struct:[+inf]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-31 20:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:23] [INFO ] Invariant cache hit.
[2024-05-31 20:40:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 20:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:23] [INFO ] Invariant cache hit.
[2024-05-31 20:40:23] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:40:23] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-31 20:40:23] [INFO ] Redundant transitions in 1 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-31 20:40:23] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:23] [INFO ] Invariant cache hit.
[2024-05-31 20:40:23] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 208 unsolved in 2813 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 208/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 312 constraints, problems are : Problem set: 0 solved, 208 unsolved in 4833 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 7771ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 7774ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7933 ms. Remains : 83/83 places, 210/210 transitions.
[2024-05-31 20:40:31] [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 1 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 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[541] Max Struct:[+inf]
[2024-05-31 20:40:31] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[541] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 929 ms. (1075 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 374 ms. (2666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[541] Max Struct:[+inf]
[2024-05-31 20:40:32] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:32] [INFO ] Invariant cache hit.
[2024-05-31 20:40:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:40:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:40:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:40:32] [INFO ] [Real]Added 18 Read/Feed constraints in 2 ms returned sat
[2024-05-31 20:40:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 20:40:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 20:40:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 20:40:32] [INFO ] [Nat]Added 18 Read/Feed constraints in 3 ms returned sat
[2024-05-31 20:40:32] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-31 20:40:32] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-31 20:40:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-31 20:40:32] [INFO ] Computed and/alt/rep : 61/202/55 causal constraints (skipped 73 transitions) in 7 ms.
[2024-05-31 20:40:32] [INFO ] Added : 13 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[541] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[541] Max Struct:[+inf]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-31 20:40:32] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:32] [INFO ] Invariant cache hit.
[2024-05-31 20:40:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 20:40:32] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:32] [INFO ] Invariant cache hit.
[2024-05-31 20:40:32] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-31 20:40:32] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-31 20:40:32] [INFO ] Redundant transitions in 0 ms returned []
Running 208 sub problems to find dead transitions.
[2024-05-31 20:40:32] [INFO ] Flow matrix only has 130 transitions (discarded 80 similar events)
[2024-05-31 20:40:32] [INFO ] Invariant cache hit.
[2024-05-31 20:40:32] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 208 unsolved in 2847 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 130/213 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 208/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 312 constraints, problems are : Problem set: 0 solved, 208 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 7604ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 7606ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7774 ms. Remains : 83/83 places, 210/210 transitions.
[2024-05-31 20:40:40] [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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[541] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 63099 steps, run visited all 1 properties in 98 ms. (steps per millisecond=643 )
Probabilistic random walk after 63099 steps, saw 39295 distinct states, run finished after 101 ms. (steps per millisecond=624 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[541] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-b002-UpperBounds-08 in 19635 ms.
[2024-05-31 20:40:40] [INFO ] Flatten gal took : 42 ms
[2024-05-31 20:40:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2024-05-31 20:40:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 93 places, 231 transitions and 940 arcs took 4 ms.
Total runtime 308750 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-b002-UpperBounds-00
Could not compute solution for formula : FunctionPointer-PT-b002-UpperBounds-08

BK_STOP 1717188041183

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-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 r496-tall-171640602900221"
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 ;