About the Execution of LTSMin+red for DoubleLock-PT-p2s2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5306.584 | 935938.00 | 1065366.00 | 1885.10 | 10 ? 1 0 1 0 0 ? 1 1 10 1 1 ? 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r488-tall-171631133100621.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 DoubleLock-PT-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631133100621
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 12 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 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 813K 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 DoubleLock-PT-p2s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717202377166
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:39:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 00:39:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:39:38] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-06-01 00:39:38] [INFO ] Transformed 184 places.
[2024-06-01 00:39:38] [INFO ] Transformed 1832 transitions.
[2024-06-01 00:39:38] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 36 places in 8 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 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-06-01 00:39:38] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2024-06-01 00:39:38] [INFO ] Computed 4 invariants in 38 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:[10, +inf, 1, 1, +inf, 1, 1, 10, 1, 1, +inf, 1, 1]
RANDOM walk for 10000 steps (99 resets) in 43 ms. (227 steps per ms)
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30002 steps (60 resets) in 45 ms. (652 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 1] Max Struct:[+inf, +inf, +inf]
[2024-06-01 00:39:38] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2024-06-01 00:39:38] [INFO ] Invariant cache hit.
[2024-06-01 00:39:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 00:39:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:39:39] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-06-01 00:39:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:39:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:39:39] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-06-01 00:39:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:39:39] [INFO ] [Nat]Added 116 Read/Feed constraints in 184 ms returned sat
[2024-06-01 00:39:39] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 167 ms.
[2024-06-01 00:39:40] [INFO ] Added : 1 causal constraints over 1 iterations in 331 ms. Result :sat
Minimization took 609 ms.
[2024-06-01 00:39:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:39:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:39:40] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-06-01 00:39:41] [INFO ] [Real]Added 116 Read/Feed constraints in 80 ms returned sat
[2024-06-01 00:39:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:39:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:39:41] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-06-01 00:39:41] [INFO ] [Nat]Added 116 Read/Feed constraints in 124 ms returned sat
[2024-06-01 00:39:41] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 14 ms to minimize.
[2024-06-01 00:39:41] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 2 ms to minimize.
[2024-06-01 00:39:42] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 1 ms to minimize.
[2024-06-01 00:39:42] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 1 ms to minimize.
[2024-06-01 00:39:42] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 1 ms to minimize.
[2024-06-01 00:39:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1162 ms
[2024-06-01 00:39:42] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 89 ms.
[2024-06-01 00:39:42] [INFO ] Added : 0 causal constraints over 0 iterations in 166 ms. Result :sat
Minimization took 785 ms.
[2024-06-01 00:39:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 00:39:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:39:43] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-01 00:39:43] [INFO ] [Real]Added 116 Read/Feed constraints in 31 ms returned sat
[2024-06-01 00:39:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:39:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:39:43] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-06-01 00:39:44] [INFO ] [Nat]Added 116 Read/Feed constraints in 83 ms returned sat
[2024-06-01 00:39:44] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 1 ms to minimize.
[2024-06-01 00:39:44] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 2 ms to minimize.
[2024-06-01 00:39:44] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 1 ms to minimize.
[2024-06-01 00:39:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 681 ms
[2024-06-01 00:39:44] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 93 ms.
[2024-06-01 00:39:44] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :sat
Minimization took 775 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 1] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 1, 1] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 144 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 143 transition count 1720
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 143 transition count 1720
Applied a total of 19 rules in 105 ms. Remains 143 /148 variables (removed 5) and now considering 1720/1768 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 143/148 places, 1720/1768 transitions.
[2024-06-01 00:39:45] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 157 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :[1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 1, 1] Max Struct:[+inf, +inf, +inf]
[2024-06-01 00:39:46] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2024-06-01 00:39:46] [INFO ] Computed 2 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 1, 1] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000004 steps (10208 resets) in 1316 ms. (759 steps per ms)
BEST_FIRST walk for 3000003 steps (5831 resets) in 1464 ms. (2047 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
[2024-06-01 00:39:49] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-06-01 00:39:49] [INFO ] Invariant cache hit.
[2024-06-01 00:39:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:39:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:39:49] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-06-01 00:39:49] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:39:49] [INFO ] [Real]Added 116 Read/Feed constraints in 85 ms returned sat
[2024-06-01 00:39:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:39:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:39:49] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-06-01 00:39:50] [INFO ] [Nat]Added 116 Read/Feed constraints in 268 ms returned sat
[2024-06-01 00:39:50] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 89 ms.
[2024-06-01 00:39:50] [INFO ] Added : 1 causal constraints over 1 iterations in 249 ms. Result :sat
Minimization took 1176 ms.
[2024-06-01 00:39:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:39:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:39:51] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-06-01 00:39:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:39:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:39:52] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-06-01 00:39:55] [INFO ] [Nat]Added 116 Read/Feed constraints in 3122 ms returned sat
[2024-06-01 00:39:55] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 89 ms.
[2024-06-01 00:39:55] [INFO ] Added : 0 causal constraints over 0 iterations in 174 ms. Result :sat
Minimization took 1210 ms.
[2024-06-01 00:39:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:39:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:39:56] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-06-01 00:39:56] [INFO ] [Real]Added 116 Read/Feed constraints in 72 ms returned sat
[2024-06-01 00:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:39:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:39:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 00:39:57] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-06-01 00:39:57] [INFO ] [Nat]Added 116 Read/Feed constraints in 204 ms returned sat
[2024-06-01 00:39:57] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 75 ms.
[2024-06-01 00:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 149 ms. Result :sat
Minimization took 1396 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 29 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 33 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2024-06-01 00:39:59] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-06-01 00:39:59] [INFO ] Invariant cache hit.
[2024-06-01 00:39:59] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 00:39:59] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-06-01 00:39:59] [INFO ] Invariant cache hit.
[2024-06-01 00:40:00] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:40:00] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2024-06-01 00:40:00] [INFO ] Redundant transitions in 79 ms returned []
Running 1718 sub problems to find dead transitions.
[2024-06-01 00:40:00] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2024-06-01 00:40:00] [INFO ] Invariant cache hit.
[2024-06-01 00:40:00] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 261 constraints, problems are : Problem set: 0 solved, 1718 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1320 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 1718/1979 constraints. Problems are: Problem set: 91 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 1979 constraints, problems are : Problem set: 91 solved, 1627 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1718/1718 constraints, Known Traps: 0/0 constraints]
After SMT, in 62756ms problems are : Problem set: 91 solved, 1627 unsolved
Search for dead transitions found 91 dead transitions in 62797ms
Found 91 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 91 transitions
Dead transitions reduction (with SMT) removed 91 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1629/1720 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
[2024-06-01 00:41:03] [INFO ] Redundant transitions in 82 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64112 ms. Remains : 143/143 places, 1629/1720 transitions.
[2024-06-01 00:41:03] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 708=1, 709=1, 1060=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 699=1, 700=1, 1051=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 161 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :[1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
[2024-06-01 00:41:04] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
// Phase 1: matrix 1102 rows 143 cols
[2024-06-01 00:41:04] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 2, 3] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (10206 resets) in 1274 ms. (784 steps per ms)
BEST_FIRST walk for 3000003 steps (5823 resets) in 1512 ms. (1982 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
[2024-06-01 00:41:07] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:41:07] [INFO ] Invariant cache hit.
[2024-06-01 00:41:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:41:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:41:07] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-01 00:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:41:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:41:07] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:41:07] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-06-01 00:41:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:41:07] [INFO ] [Nat]Added 116 Read/Feed constraints in 257 ms returned sat
[2024-06-01 00:41:08] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 79 ms.
[2024-06-01 00:41:08] [INFO ] Added : 0 causal constraints over 0 iterations in 146 ms. Result :sat
Minimization took 927 ms.
[2024-06-01 00:41:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:41:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:41:09] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-01 00:41:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:41:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:41:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:41:09] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-06-01 00:41:09] [INFO ] [Nat]Added 116 Read/Feed constraints in 213 ms returned sat
[2024-06-01 00:41:09] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 107 ms.
[2024-06-01 00:41:09] [INFO ] Added : 0 causal constraints over 0 iterations in 175 ms. Result :sat
Minimization took 825 ms.
[2024-06-01 00:41:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:41:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 00:41:11] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-06-01 00:41:11] [INFO ] [Real]Added 116 Read/Feed constraints in 94 ms returned sat
[2024-06-01 00:41:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:41:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:41:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:41:11] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-01 00:41:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 145 ms returned sat
[2024-06-01 00:41:11] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 71 ms.
[2024-06-01 00:41:11] [INFO ] Added : 2 causal constraints over 2 iterations in 225 ms. Result :sat
Minimization took 1113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 143/143 places, 1629/1629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
[2024-06-01 00:41:13] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:41:13] [INFO ] Invariant cache hit.
[2024-06-01 00:41:13] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-01 00:41:13] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:41:13] [INFO ] Invariant cache hit.
[2024-06-01 00:41:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:41:13] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2024-06-01 00:41:14] [INFO ] Redundant transitions in 34 ms returned []
Running 1627 sub problems to find dead transitions.
[2024-06-01 00:41:14] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:41:14] [INFO ] Invariant cache hit.
[2024-06-01 00:41:14] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 1627/1888 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
After SMT, in 62259ms problems are : Problem set: 0 solved, 1627 unsolved
Search for dead transitions found 0 dead transitions in 62274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63257 ms. Remains : 143/143 places, 1629/1629 transitions.
[2024-06-01 00:42:16] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 708=1, 709=1, 1060=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 699=1, 700=1, 1051=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 160 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :[1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
[2024-06-01 00:42:16] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:42:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (10200 resets) in 1252 ms. (798 steps per ms)
BEST_FIRST walk for 3000003 steps (5829 resets) in 1507 ms. (1989 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
[2024-06-01 00:42:19] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:42:19] [INFO ] Invariant cache hit.
[2024-06-01 00:42:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:42:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:42:19] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-06-01 00:42:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:42:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:42:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:42:20] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-06-01 00:42:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:42:20] [INFO ] [Nat]Added 116 Read/Feed constraints in 265 ms returned sat
[2024-06-01 00:42:20] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 69 ms.
[2024-06-01 00:42:20] [INFO ] Added : 0 causal constraints over 0 iterations in 136 ms. Result :sat
Minimization took 950 ms.
[2024-06-01 00:42:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:42:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:42:21] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-06-01 00:42:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:42:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:42:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:42:21] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-01 00:42:22] [INFO ] [Nat]Added 116 Read/Feed constraints in 218 ms returned sat
[2024-06-01 00:42:22] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 69 ms.
[2024-06-01 00:42:22] [INFO ] Added : 0 causal constraints over 0 iterations in 135 ms. Result :sat
Minimization took 821 ms.
[2024-06-01 00:42:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:42:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:42:23] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-06-01 00:42:23] [INFO ] [Real]Added 116 Read/Feed constraints in 90 ms returned sat
[2024-06-01 00:42:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:42:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:42:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:42:23] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-06-01 00:42:23] [INFO ] [Nat]Added 116 Read/Feed constraints in 143 ms returned sat
[2024-06-01 00:42:23] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 133 ms.
[2024-06-01 00:42:24] [INFO ] Added : 2 causal constraints over 2 iterations in 276 ms. Result :sat
Minimization took 1139 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1629/1629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
[2024-06-01 00:42:25] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:42:25] [INFO ] Invariant cache hit.
[2024-06-01 00:42:25] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 00:42:25] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:42:25] [INFO ] Invariant cache hit.
[2024-06-01 00:42:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:42:26] [INFO ] Implicit Places using invariants and state equation in 668 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2024-06-01 00:42:26] [INFO ] Redundant transitions in 22 ms returned []
Running 1627 sub problems to find dead transitions.
[2024-06-01 00:42:26] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:42:26] [INFO ] Invariant cache hit.
[2024-06-01 00:42:26] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 1627/1888 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
After SMT, in 62029ms problems are : Problem set: 0 solved, 1627 unsolved
Search for dead transitions found 0 dead transitions in 62043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62919 ms. Remains : 143/143 places, 1629/1629 transitions.
[2024-06-01 00:43:28] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 708=1, 709=1, 1060=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 699=1, 700=1, 1051=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 152 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :[1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40016 steps (402 resets) in 552 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (75 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (71 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 263438 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 3
Probabilistic random walk after 263438 steps, saw 181105 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
[2024-06-01 00:43:32] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:43:32] [INFO ] Invariant cache hit.
[2024-06-01 00:43:32] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1016/1152 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1152 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/1167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 78/1245 variables, 69/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1245 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 80/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1016/1152 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1152 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1152 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/1167 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1167 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 78/1245 variables, 69/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 80/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1245 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1245 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 264 constraints, problems are : Problem set: 0 solved, 3 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1432ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 143/143 places, 1629/1629 transitions.
RANDOM walk for 40010 steps (402 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (72 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (74 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 319466 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 3
Probabilistic random walk after 319466 steps, saw 218602 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-06-01 00:43:37] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:43:37] [INFO ] Invariant cache hit.
[2024-06-01 00:43:37] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1016/1152 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1152 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 15/1167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 78/1245 variables, 69/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1245 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 80/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 133/136 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1016/1152 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1152 variables, 36/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1152 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1152 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 15/1167 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1167 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1167 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 78/1245 variables, 69/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 80/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1245 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1245 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 264 constraints, problems are : Problem set: 0 solved, 3 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1410ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 143/143 places, 1629/1629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
[2024-06-01 00:43:38] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:43:38] [INFO ] Invariant cache hit.
[2024-06-01 00:43:38] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 00:43:38] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:43:38] [INFO ] Invariant cache hit.
[2024-06-01 00:43:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:43:39] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2024-06-01 00:43:39] [INFO ] Redundant transitions in 22 ms returned []
Running 1627 sub problems to find dead transitions.
[2024-06-01 00:43:39] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:43:39] [INFO ] Invariant cache hit.
[2024-06-01 00:43:39] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 1627/1888 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
After SMT, in 61994ms problems are : Problem set: 0 solved, 1627 unsolved
Search for dead transitions found 0 dead transitions in 62008ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62786 ms. Remains : 143/143 places, 1629/1629 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 0 with 527 rules applied. Total rules applied 527 place count 143 transition count 1102
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 527 place count 143 transition count 1092
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 547 place count 133 transition count 1092
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 551 place count 131 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 552 place count 130 transition count 1058
Iterating global reduction 1 with 1 rules applied. Total rules applied 553 place count 130 transition count 1058
Applied a total of 553 rules in 45 ms. Remains 130 /143 variables (removed 13) and now considering 1058/1629 (removed 571) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1058 rows 130 cols
[2024-06-01 00:44:41] [INFO ] Computed 2 invariants in 8 ms
[2024-06-01 00:44:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 00:44:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:44:41] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 00:44:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 00:44:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:44:41] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 00:44:42] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 00:44:42] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 845 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5, 3, 3] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 00:44:42] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
// Phase 1: matrix 1102 rows 143 cols
[2024-06-01 00:44:42] [INFO ] Computed 2 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (104 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 00:44:42] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:44:42] [INFO ] Invariant cache hit.
[2024-06-01 00:44:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:44:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:44:42] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-06-01 00:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:44:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:44:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:44:42] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-06-01 00:44:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:44:42] [INFO ] [Nat]Added 116 Read/Feed constraints in 145 ms returned sat
[2024-06-01 00:44:42] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 70 ms.
[2024-06-01 00:44:42] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Minimization took 563 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 29 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 143/143 places, 1629/1629 transitions.
[2024-06-01 00:44:43] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 708=1, 709=1, 1060=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 699=1, 700=1, 1051=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 160 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:44:44] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:44:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10206 resets) in 1150 ms. (868 steps per ms)
BEST_FIRST walk for 1000001 steps (1943 resets) in 478 ms. (2087 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-06-01 00:44:45] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:44:45] [INFO ] Invariant cache hit.
[2024-06-01 00:44:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:44:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:44:45] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2024-06-01 00:44:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:44:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:44:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:44:46] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-06-01 00:44:46] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:44:46] [INFO ] [Nat]Added 116 Read/Feed constraints in 500 ms returned sat
[2024-06-01 00:44:46] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 66 ms.
[2024-06-01 00:44:46] [INFO ] Added : 1 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 996 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1629/1629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
[2024-06-01 00:44:48] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:44:48] [INFO ] Invariant cache hit.
[2024-06-01 00:44:48] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-01 00:44:48] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:44:48] [INFO ] Invariant cache hit.
[2024-06-01 00:44:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:44:48] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2024-06-01 00:44:48] [INFO ] Redundant transitions in 27 ms returned []
Running 1627 sub problems to find dead transitions.
[2024-06-01 00:44:48] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:44:48] [INFO ] Invariant cache hit.
[2024-06-01 00:44:48] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 1627/1888 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
After SMT, in 61973ms problems are : Problem set: 0 solved, 1627 unsolved
Search for dead transitions found 0 dead transitions in 61987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62836 ms. Remains : 143/143 places, 1629/1629 transitions.
[2024-06-01 00:45:50] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 708=1, 709=1, 1060=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 699=1, 700=1, 1051=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 161 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-06-01 00:45:51] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:45:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10197 resets) in 1322 ms. (755 steps per ms)
BEST_FIRST walk for 1000001 steps (1934 resets) in 520 ms. (1919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-06-01 00:45:53] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:45:53] [INFO ] Invariant cache hit.
[2024-06-01 00:45:53] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:45:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:45:53] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-06-01 00:45:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:45:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 00:45:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:45:53] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-06-01 00:45:53] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:45:54] [INFO ] [Nat]Added 116 Read/Feed constraints in 516 ms returned sat
[2024-06-01 00:45:54] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 81 ms.
[2024-06-01 00:45:54] [INFO ] Added : 1 causal constraints over 1 iterations in 198 ms. Result :sat
Minimization took 1021 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1629/1629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
[2024-06-01 00:45:55] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:45:55] [INFO ] Invariant cache hit.
[2024-06-01 00:45:55] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 00:45:55] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:45:55] [INFO ] Invariant cache hit.
[2024-06-01 00:45:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:45:56] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2024-06-01 00:45:56] [INFO ] Redundant transitions in 29 ms returned []
Running 1627 sub problems to find dead transitions.
[2024-06-01 00:45:56] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:45:56] [INFO ] Invariant cache hit.
[2024-06-01 00:45:56] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 1627/1888 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
After SMT, in 62056ms problems are : Problem set: 0 solved, 1627 unsolved
Search for dead transitions found 0 dead transitions in 62070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62929 ms. Remains : 143/143 places, 1629/1629 transitions.
[2024-06-01 00:46:58] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {12=2, 19=1, 30=1, 708=1, 709=1, 1060=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 699=1, 700=1, 1051=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 156 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40005 steps (412 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (77 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 550519 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 550519 steps, saw 373212 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-06-01 00:47:02] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:47:02] [INFO ] Invariant cache hit.
[2024-06-01 00:47:02] [INFO ] State equation strengthened by 116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1142 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1142 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1142 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1160 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1160 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1160 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1245 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1245 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1142 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1142 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1142 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1142 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1160 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1160 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1160 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1245 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1245 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1245 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 878ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 143/143 places, 1629/1629 transitions.
RANDOM walk for 40006 steps (415 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (75 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548657 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548657 steps, saw 371966 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-06-01 00:47:06] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:47:06] [INFO ] Invariant cache hit.
[2024-06-01 00:47:06] [INFO ] State equation strengthened by 116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1142 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1142 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1142 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1160 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1160 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1160 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1245 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1245 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1245 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1142 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1142 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1142 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1142 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1160 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1160 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1160 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1245 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1245 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1245 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1245 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1245 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 143/143 places, 1629/1629 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1629/1629 (removed 0) transitions.
[2024-06-01 00:47:07] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:47:07] [INFO ] Invariant cache hit.
[2024-06-01 00:47:07] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 00:47:07] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:47:07] [INFO ] Invariant cache hit.
[2024-06-01 00:47:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:47:07] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-06-01 00:47:07] [INFO ] Redundant transitions in 27 ms returned []
Running 1627 sub problems to find dead transitions.
[2024-06-01 00:47:07] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:47:07] [INFO ] Invariant cache hit.
[2024-06-01 00:47:07] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 261 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 3 (OVERLAPS) 1102/1245 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1245 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1245 variables, 1627/1888 constraints. Problems are: Problem set: 0 solved, 1627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 1888 constraints, problems are : Problem set: 0 solved, 1627 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1627/1627 constraints, Known Traps: 0/0 constraints]
After SMT, in 61956ms problems are : Problem set: 0 solved, 1627 unsolved
Search for dead transitions found 0 dead transitions in 61969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62758 ms. Remains : 143/143 places, 1629/1629 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Iterating post reduction 0 with 527 rules applied. Total rules applied 527 place count 143 transition count 1102
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 527 place count 143 transition count 1092
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 547 place count 133 transition count 1092
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 553 place count 130 transition count 1089
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 554 place count 129 transition count 1057
Iterating global reduction 1 with 1 rules applied. Total rules applied 555 place count 129 transition count 1057
Applied a total of 555 rules in 35 ms. Remains 129 /143 variables (removed 14) and now considering 1057/1629 (removed 572) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1057 rows 129 cols
[2024-06-01 00:48:09] [INFO ] Computed 2 invariants in 10 ms
[2024-06-01 00:48:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:48:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:48:10] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:48:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 00:48:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:48:10] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:48:10] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:48:10] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 572 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01 in 208316 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-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-06-01 00:48:10] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
// Phase 1: matrix 1102 rows 143 cols
[2024-06-01 00:48:10] [INFO ] Computed 2 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (99 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 00:48:10] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:48:10] [INFO ] Invariant cache hit.
[2024-06-01 00:48:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:48:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:48:10] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-01 00:48:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:48:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:48:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:48:10] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-06-01 00:48:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:48:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 154 ms returned sat
[2024-06-01 00:48:11] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 72 ms.
[2024-06-01 00:48:11] [INFO ] Added : 0 causal constraints over 0 iterations in 139 ms. Result :sat
Minimization took 562 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1613
Applied a total of 16 rules in 27 ms. Remains 143 /143 variables (removed 0) and now considering 1613/1629 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1613/1629 transitions.
[2024-06-01 00:48:11] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 638=1, 639=1, 990=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 665=1, 666=1, 1019=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 163 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 00:48:12] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
// Phase 1: matrix 1086 rows 143 cols
[2024-06-01 00:48:12] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000006 steps (10151 resets) in 1160 ms. (861 steps per ms)
BEST_FIRST walk for 1000000 steps (1946 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:48:14] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:48:14] [INFO ] Invariant cache hit.
[2024-06-01 00:48:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:48:14] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-06-01 00:48:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:48:14] [INFO ] [Real]Added 116 Read/Feed constraints in 40 ms returned sat
[2024-06-01 00:48:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:48:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 00:48:14] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-06-01 00:48:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 95 ms returned sat
[2024-06-01 00:48:14] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 2 ms to minimize.
[2024-06-01 00:48:14] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 1 ms to minimize.
[2024-06-01 00:48:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2024-06-01 00:48:15] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 972 transitions) in 64 ms.
[2024-06-01 00:48:15] [INFO ] Added : 0 causal constraints over 0 iterations in 122 ms. Result :sat
Minimization took 1385 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1613/1613 transitions.
Applied a total of 0 rules in 29 ms. Remains 143 /143 variables (removed 0) and now considering 1613/1613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 143/143 places, 1613/1613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1613/1613 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1613/1613 (removed 0) transitions.
[2024-06-01 00:48:16] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:48:16] [INFO ] Invariant cache hit.
[2024-06-01 00:48:16] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 00:48:16] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:48:16] [INFO ] Invariant cache hit.
[2024-06-01 00:48:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:48:17] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2024-06-01 00:48:17] [INFO ] Redundant transitions in 26 ms returned []
Running 1611 sub problems to find dead transitions.
[2024-06-01 00:48:17] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:48:17] [INFO ] Invariant cache hit.
[2024-06-01 00:48:17] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1611 unsolved
[2024-06-01 00:48:30] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
Problem TDEAD1276 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1293 is UNSAT
[2024-06-01 00:48:30] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 1 ms to minimize.
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 77 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 77 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1086/1229 variables, 143/148 constraints. Problems are: Problem set: 77 solved, 1534 unsolved
SMT process timed out in 32179ms, After SMT, problems are : Problem set: 77 solved, 1534 unsolved
Search for dead transitions found 77 dead transitions in 32192ms
Found 77 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 77 transitions
Dead transitions reduction (with SMT) removed 77 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1613 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:48:49] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33124 ms. Remains : 143/143 places, 1536/1613 transitions.
[2024-06-01 00:48:49] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 151 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:48:50] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2024-06-01 00:48:50] [INFO ] Computed 3 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10188 resets) in 1093 ms. (914 steps per ms)
BEST_FIRST walk for 1000001 steps (1950 resets) in 469 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 00:48:51] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:48:51] [INFO ] Invariant cache hit.
[2024-06-01 00:48:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:48:52] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-01 00:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:48:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:48:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-01 00:48:52] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:48:52] [INFO ] [Nat]Added 112 Read/Feed constraints in 92 ms returned sat
[2024-06-01 00:48:52] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 1 ms to minimize.
[2024-06-01 00:48:52] [INFO ] Deduced a trap composed of 64 places in 159 ms of which 1 ms to minimize.
[2024-06-01 00:48:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 394 ms
[2024-06-01 00:48:52] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 60 ms.
[2024-06-01 00:48:52] [INFO ] Added : 0 causal constraints over 0 iterations in 124 ms. Result :sat
Minimization took 1054 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:48:53] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:48:53] [INFO ] Invariant cache hit.
[2024-06-01 00:48:54] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 00:48:54] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:48:54] [INFO ] Invariant cache hit.
[2024-06-01 00:48:54] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:48:54] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2024-06-01 00:48:54] [INFO ] Redundant transitions in 26 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-06-01 00:48:54] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:48:54] [INFO ] Invariant cache hit.
[2024-06-01 00:48:54] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 61937ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62761 ms. Remains : 143/143 places, 1536/1536 transitions.
[2024-06-01 00:49:56] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 155 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40005 steps (406 resets) in 62 ms. (635 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (74 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 585642 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 1
Probabilistic random walk after 585642 steps, saw 396715 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
[2024-06-01 00:50:00] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:50:00] [INFO ] Invariant cache hit.
[2024-06-01 00:50:00] [INFO ] State equation strengthened by 112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40012 steps (395 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (76 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 589926 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 589926 steps, saw 399582 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
[2024-06-01 00:50:04] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:50:04] [INFO ] Invariant cache hit.
[2024-06-01 00:50:04] [INFO ] State equation strengthened by 112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:50:04] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:50:04] [INFO ] Invariant cache hit.
[2024-06-01 00:50:05] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-01 00:50:05] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:50:05] [INFO ] Invariant cache hit.
[2024-06-01 00:50:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:50:05] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2024-06-01 00:50:05] [INFO ] Redundant transitions in 23 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-06-01 00:50:05] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:50:05] [INFO ] Invariant cache hit.
[2024-06-01 00:50:05] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 61800ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62625 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 541 place count 130 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 542 place count 129 transition count 976
Iterating global reduction 1 with 1 rules applied. Total rules applied 543 place count 129 transition count 976
Applied a total of 543 rules in 37 ms. Remains 129 /143 variables (removed 14) and now considering 976/1536 (removed 560) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 976 rows 129 cols
[2024-06-01 00:51:07] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 00:51:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 00:51:07] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:51:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:51:08] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:51:08] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:51:08] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 501 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 177601 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-06-01 00:51:08] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
// Phase 1: matrix 1102 rows 143 cols
[2024-06-01 00:51:08] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (107 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 00:51:08] [INFO ] Flow matrix only has 1102 transitions (discarded 527 similar events)
[2024-06-01 00:51:08] [INFO ] Invariant cache hit.
[2024-06-01 00:51:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:51:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 00:51:08] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-06-01 00:51:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:51:08] [INFO ] [Real]Added 116 Read/Feed constraints in 92 ms returned sat
[2024-06-01 00:51:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:51:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 00:51:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 00:51:08] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-06-01 00:51:08] [INFO ] [Nat]Added 116 Read/Feed constraints in 147 ms returned sat
[2024-06-01 00:51:08] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 988 transitions) in 68 ms.
[2024-06-01 00:51:09] [INFO ] Added : 2 causal constraints over 2 iterations in 214 ms. Result :sat
Minimization took 562 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 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1629/1629 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1613
Applied a total of 16 rules in 27 ms. Remains 143 /143 variables (removed 0) and now considering 1613/1629 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1613/1629 transitions.
[2024-06-01 00:51:09] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 638=1, 639=1, 990=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 665=1, 666=1, 1019=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 159 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 00:51:10] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
// Phase 1: matrix 1086 rows 143 cols
[2024-06-01 00:51:10] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10154 resets) in 1132 ms. (882 steps per ms)
BEST_FIRST walk for 1000001 steps (1925 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 00:51:11] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:51:11] [INFO ] Invariant cache hit.
[2024-06-01 00:51:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:51:11] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-06-01 00:51:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:51:12] [INFO ] [Real]Added 116 Read/Feed constraints in 49 ms returned sat
[2024-06-01 00:51:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:51:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:51:12] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-06-01 00:51:12] [INFO ] [Nat]Added 116 Read/Feed constraints in 214 ms returned sat
[2024-06-01 00:51:12] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-06-01 00:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2024-06-01 00:51:12] [INFO ] Computed and/alt/rep : 112/816/112 causal constraints (skipped 972 transitions) in 69 ms.
[2024-06-01 00:51:12] [INFO ] Added : 0 causal constraints over 0 iterations in 131 ms. Result :sat
Minimization took 1452 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 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1613/1613 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1613/1613 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1613/1613 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1613/1613 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1613/1613 (removed 0) transitions.
[2024-06-01 00:51:14] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:51:14] [INFO ] Invariant cache hit.
[2024-06-01 00:51:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 00:51:14] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:51:14] [INFO ] Invariant cache hit.
[2024-06-01 00:51:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 00:51:15] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2024-06-01 00:51:15] [INFO ] Redundant transitions in 22 ms returned []
Running 1611 sub problems to find dead transitions.
[2024-06-01 00:51:15] [INFO ] Flow matrix only has 1086 transitions (discarded 527 similar events)
[2024-06-01 00:51:15] [INFO ] Invariant cache hit.
[2024-06-01 00:51:15] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1611 unsolved
[2024-06-01 00:51:28] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 1 ms to minimize.
Problem TDEAD1276 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1293 is UNSAT
[2024-06-01 00:51:28] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 77 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 77 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1086/1229 variables, 143/148 constraints. Problems are: Problem set: 77 solved, 1534 unsolved
SMT process timed out in 31924ms, After SMT, problems are : Problem set: 77 solved, 1534 unsolved
Search for dead transitions found 77 dead transitions in 31938ms
Found 77 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 77 transitions
Dead transitions reduction (with SMT) removed 77 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1613 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:51:47] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32888 ms. Remains : 143/143 places, 1536/1613 transitions.
[2024-06-01 00:51:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 150 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 00:51:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2024-06-01 00:51:47] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10181 resets) in 1196 ms. (835 steps per ms)
BEST_FIRST walk for 1000001 steps (1959 resets) in 465 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-06-01 00:51:49] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:51:49] [INFO ] Invariant cache hit.
[2024-06-01 00:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:51:49] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-06-01 00:51:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:51:49] [INFO ] [Real]Added 112 Read/Feed constraints in 60 ms returned sat
[2024-06-01 00:51:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:51:49] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-06-01 00:51:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 137 ms returned sat
[2024-06-01 00:51:50] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 64 ms.
[2024-06-01 00:51:50] [INFO ] Added : 0 causal constraints over 0 iterations in 122 ms. Result :sat
Minimization took 818 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:51:50] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:51:50] [INFO ] Invariant cache hit.
[2024-06-01 00:51:51] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-01 00:51:51] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:51:51] [INFO ] Invariant cache hit.
[2024-06-01 00:51:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:51:51] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2024-06-01 00:51:51] [INFO ] Redundant transitions in 24 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-06-01 00:51:51] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:51:51] [INFO ] Invariant cache hit.
[2024-06-01 00:51:51] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62103ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62939 ms. Remains : 143/143 places, 1536/1536 transitions.
[2024-06-01 00:52:53] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 152 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-06-01 00:52:54] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:52:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10158 resets) in 1157 ms. (863 steps per ms)
BEST_FIRST walk for 1000000 steps (1937 resets) in 465 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-06-01 00:52:56] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:52:56] [INFO ] Invariant cache hit.
[2024-06-01 00:52:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:52:56] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-06-01 00:52:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:52:56] [INFO ] [Real]Added 112 Read/Feed constraints in 57 ms returned sat
[2024-06-01 00:52:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 00:52:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:52:56] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-06-01 00:52:56] [INFO ] [Nat]Added 112 Read/Feed constraints in 138 ms returned sat
[2024-06-01 00:52:56] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 64 ms.
[2024-06-01 00:52:56] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Minimization took 821 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:52:57] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:52:57] [INFO ] Invariant cache hit.
[2024-06-01 00:52:57] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 00:52:57] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:52:57] [INFO ] Invariant cache hit.
[2024-06-01 00:52:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:52:58] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2024-06-01 00:52:58] [INFO ] Redundant transitions in 22 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-06-01 00:52:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:52:58] [INFO ] Invariant cache hit.
[2024-06-01 00:52:58] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62239ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63051 ms. Remains : 143/143 places, 1536/1536 transitions.
[2024-06-01 00:54:00] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 155 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40003 steps (394 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (76 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 529679 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 529679 steps, saw 359265 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-06-01 00:54:04] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:54:04] [INFO ] Invariant cache hit.
[2024-06-01 00:54:04] [INFO ] State equation strengthened by 112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40006 steps (406 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540184 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540184 steps, saw 366296 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-06-01 00:54:08] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:54:08] [INFO ] Invariant cache hit.
[2024-06-01 00:54:08] [INFO ] State equation strengthened by 112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 679ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2024-06-01 00:54:08] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:54:08] [INFO ] Invariant cache hit.
[2024-06-01 00:54:09] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 00:54:09] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:54:09] [INFO ] Invariant cache hit.
[2024-06-01 00:54:09] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 00:54:09] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2024-06-01 00:54:09] [INFO ] Redundant transitions in 27 ms returned []
Running 1534 sub problems to find dead transitions.
[2024-06-01 00:54:09] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2024-06-01 00:54:09] [INFO ] Invariant cache hit.
[2024-06-01 00:54:09] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints]
After SMT, in 62249ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 62264ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63119 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 543 place count 129 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 544 place count 128 transition count 975
Iterating global reduction 1 with 1 rules applied. Total rules applied 545 place count 128 transition count 975
Applied a total of 545 rules in 21 ms. Remains 128 /143 variables (removed 15) and now considering 975/1536 (removed 561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 975 rows 128 cols
[2024-06-01 00:55:12] [INFO ] Computed 3 invariants in 7 ms
[2024-06-01 00:55:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:55:12] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:55:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 00:55:12] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:55:12] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:55:12] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 534 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 244438 ms.
[2024-06-01 00:55:12] [INFO ] Flatten gal took : 150 ms
[2024-06-01 00:55:12] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-06-01 00:55:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 1629 transitions and 6548 arcs took 10 ms.
Total runtime 934584 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DoubleLock-PT-p2s2-UpperBounds-01
Could not compute solution for formula : DoubleLock-PT-p2s2-UpperBounds-07
Could not compute solution for formula : DoubleLock-PT-p2s2-UpperBounds-13
BK_STOP 1717203313104
--------------------
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 DoubleLock-PT-p2s2-UpperBounds-01
ub formula formula --maxsum=/tmp/1183/ub_0_
ub formula name DoubleLock-PT-p2s2-UpperBounds-07
ub formula formula --maxsum=/tmp/1183/ub_1_
ub formula name DoubleLock-PT-p2s2-UpperBounds-13
ub formula formula --maxsum=/tmp/1183/ub_2_
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="DoubleLock-PT-p2s2"
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 DoubleLock-PT-p2s2, 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 r488-tall-171631133100621"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 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 '
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 ;