fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for DES-PT-50a

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
925.915 1027102.00 1172803.00 2053.10 1 1 ? 1 1 1 1 1 ? 1 ? 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.r480-tall-171624189900733.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 DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900733
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 97K 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 DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717197102668

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:11:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 23:11:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:11:44] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-31 23:11:44] [INFO ] Transformed 314 places.
[2024-05-31 23:11:44] [INFO ] Transformed 271 transitions.
[2024-05-31 23:11:44] [INFO ] Found NUPN structural information;
[2024-05-31 23:11:44] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 257 rows 314 cols
[2024-05-31 23:11:44] [INFO ] Computed 59 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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (225 resets) in 80 ms. (123 steps per ms)
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (353 resets) in 189 ms. (421 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 23:11:44] [INFO ] Invariant cache hit.
[2024-05-31 23:11:44] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-31 23:11:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2024-05-31 23:11:45] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 23:11:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-31 23:11:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:11:45] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 23:11:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:11:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 52 ms returned sat
[2024-05-31 23:11:45] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 40 ms.
[2024-05-31 23:11:46] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 23 ms to minimize.
[2024-05-31 23:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2024-05-31 23:11:46] [INFO ] Added : 130 causal constraints over 27 iterations in 1220 ms. Result :sat
Minimization took 280 ms.
[2024-05-31 23:11:47] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2024-05-31 23:11:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-31 23:11:47] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-31 23:11:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:11:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:11:47] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 23:11:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2024-05-31 23:11:47] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 31 ms.
[2024-05-31 23:11:48] [INFO ] Added : 67 causal constraints over 14 iterations in 511 ms. Result :sat
Minimization took 190 ms.
[2024-05-31 23:11:48] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-31 23:11:48] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:11:48] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 23:11:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:11:48] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:11:48] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-31 23:11:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 28 ms returned sat
[2024-05-31 23:11:49] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 22 ms.
[2024-05-31 23:11:49] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-31 23:11:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-31 23:11:49] [INFO ] Added : 112 causal constraints over 23 iterations in 886 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 23:11:50] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-31 23:11:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:11:50] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-31 23:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2024-05-31 23:11:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:11:50] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-31 23:11:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 77 ms returned sat
[2024-05-31 23:11:50] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:11:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-31 23:11:50] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 26 ms.
[2024-05-31 23:11:51] [INFO ] Added : 146 causal constraints over 30 iterations in 736 ms. Result :sat
Minimization took 250 ms.
[2024-05-31 23:11:51] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-31 23:11:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:11:52] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-31 23:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-31 23:11:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:11:52] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-05-31 23:11:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 66 ms returned sat
[2024-05-31 23:11:52] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 29 ms.
[2024-05-31 23:11:53] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-31 23:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-31 23:11:53] [INFO ] Added : 104 causal constraints over 21 iterations in 681 ms. Result :sat
Minimization took 284 ms.
[2024-05-31 23:11:53] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:11:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:11:53] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-31 23:11:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:11:53] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-31 23:11:54] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-31 23:11:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 141 ms returned sat
[2024-05-31 23:11:54] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 17 ms.
[2024-05-31 23:11:54] [INFO ] Added : 86 causal constraints over 18 iterations in 591 ms. Result :sat
Minimization took 318 ms.
[2024-05-31 23:11:55] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:11:55] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:11:55] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 23:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2024-05-31 23:11:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:11:55] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-31 23:11:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 64 ms returned sat
[2024-05-31 23:11:55] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 19 ms.
[2024-05-31 23:11:56] [INFO ] Added : 73 causal constraints over 15 iterations in 767 ms. Result :sat
Minimization took 246 ms.
[2024-05-31 23:11:56] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-31 23:11:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 23:11:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:11:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 23:11:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2024-05-31 23:11:57] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:11:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-31 23:11:57] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 23 ms.
[2024-05-31 23:11:58] [INFO ] Added : 153 causal constraints over 31 iterations in 1002 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 176 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:12:02] [INFO ] Computed 60 invariants in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13711 resets) in 3133 ms. (319 steps per ms)
BEST_FIRST walk for 7000006 steps (15872 resets) in 7552 ms. (926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-31 23:12:12] [INFO ] Invariant cache hit.
[2024-05-31 23:12:13] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 23:12:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2024-05-31 23:12:13] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-31 23:12:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:12:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-31 23:12:13] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 21 ms.
[2024-05-31 23:12:14] [INFO ] Added : 119 causal constraints over 24 iterations in 599 ms. Result :sat
Minimization took 118 ms.
[2024-05-31 23:12:14] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2024-05-31 23:12:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:12:14] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2024-05-31 23:12:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:12:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:12:14] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-31 23:12:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 5 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-05-31 23:12:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2024-05-31 23:12:14] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-31 23:12:15] [INFO ] Added : 125 causal constraints over 26 iterations in 501 ms. Result :sat
Minimization took 108 ms.
[2024-05-31 23:12:15] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:12:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:12:15] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-31 23:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:12:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:12:15] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-31 23:12:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
[2024-05-31 23:12:15] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-31 23:12:16] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 3 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 2 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 2 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:12:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 702 ms
[2024-05-31 23:12:17] [INFO ] Added : 195 causal constraints over 39 iterations in 1548 ms. Result :sat
Minimization took 139 ms.
[2024-05-31 23:12:17] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-31 23:12:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2024-05-31 23:12:18] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2024-05-31 23:12:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:12:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-31 23:12:18] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-31 23:12:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2024-05-31 23:12:18] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-31 23:12:19] [INFO ] Deduced a trap composed of 14 places in 688 ms of which 2 ms to minimize.
[2024-05-31 23:12:19] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-05-31 23:12:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 801 ms
[2024-05-31 23:12:19] [INFO ] Added : 151 causal constraints over 31 iterations in 1401 ms. Result :sat
Minimization took 117 ms.
[2024-05-31 23:12:19] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:12:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:12:20] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-31 23:12:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2024-05-31 23:12:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:12:20] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-31 23:12:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-31 23:12:20] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-31 23:12:20] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:12:20] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:12:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2024-05-31 23:12:20] [INFO ] Added : 95 causal constraints over 20 iterations in 562 ms. Result :sat
Minimization took 97 ms.
[2024-05-31 23:12:20] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:12:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:12:21] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-31 23:12:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:12:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:12:21] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-31 23:12:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:12:21] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-31 23:12:21] [INFO ] Added : 77 causal constraints over 16 iterations in 309 ms. Result :sat
Minimization took 109 ms.
[2024-05-31 23:12:21] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:12:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:12:21] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-31 23:12:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:12:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:12:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:12:22] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-05-31 23:12:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:12:22] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 32 ms.
[2024-05-31 23:12:22] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-31 23:12:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-31 23:12:22] [INFO ] Added : 172 causal constraints over 36 iterations in 790 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:12:26] [INFO ] Invariant cache hit.
[2024-05-31 23:12:26] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-31 23:12:26] [INFO ] Invariant cache hit.
[2024-05-31 23:12:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:12:27] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2024-05-31 23:12:27] [INFO ] Redundant transitions in 10 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:12:27] [INFO ] Invariant cache hit.
[2024-05-31 23:12:27] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:33] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:37] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2024-05-31 23:12:37] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:12:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 23:12:37] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:12:38] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:12:38] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:12:38] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:12:39] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:43] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:50] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
(s50 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:13:22] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-31 23:13:26] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60525ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61294 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (546 resets) in 1537 ms. (26 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (91 resets) in 353 ms. (113 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (87 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (87 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (90 resets) in 149 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (93 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (87 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (78 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (98 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (88 resets) in 128 ms. (310 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (88 resets) in 118 ms. (336 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (91 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (89 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (89 resets) in 67 ms. (588 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (97 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 524625 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 14
Probabilistic random walk after 524625 steps, saw 75155 distinct states, run finished after 3005 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-31 23:13:31] [INFO ] Invariant cache hit.
[2024-05-31 23:13:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/252 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 204/456 variables, 252/307 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:13:32] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:13:32] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 63/519 variables, 14/325 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 1/520 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/520 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:13:33] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:13:33] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/520 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 44/564 variables, 44/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 377 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2534 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 180/187 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/220 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/245 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/252 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 204/456 variables, 252/310 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 63/519 variables, 14/336 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/519 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 1/520 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/520 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/520 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/520 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 44/564 variables, 44/391 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:13:36] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:13:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/564 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-31 23:13:37] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/564 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/564 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 0/564 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 394 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4160 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
After SMT, in 6703ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 4 properties in 14373 ms.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 22 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (543 resets) in 285 ms. (139 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (92 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (88 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (79 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (97 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (83 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (95 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (93 resets) in 63 ms. (625 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (86 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (84 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (101 resets) in 66 ms. (597 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 615161 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 10
Probabilistic random walk after 615161 steps, saw 88444 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-31 23:13:56] [INFO ] Invariant cache hit.
[2024-05-31 23:13:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/219 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/244 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/251 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 202/453 variables, 251/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:13:56] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 63/516 variables, 12/321 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/517 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/517 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/517 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 47/564 variables, 47/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/564 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 374 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1368 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/219 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/244 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/251 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 202/453 variables, 251/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:13:58] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:13:58] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 63/516 variables, 12/331 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:13:59] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-05-31 23:13:59] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:13:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/516 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 1/517 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/517 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 23:13:59] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/517 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/517 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 47/564 variables, 47/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/564 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 0/564 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 390 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2805 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 4184ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10814 ms.
Support contains 5 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:14:11] [INFO ] Invariant cache hit.
[2024-05-31 23:14:11] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-31 23:14:11] [INFO ] Invariant cache hit.
[2024-05-31 23:14:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:14:12] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-31 23:14:12] [INFO ] Redundant transitions in 3 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:14:12] [INFO ] Invariant cache hit.
[2024-05-31 23:14:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:14:17] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:14:21] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-31 23:14:21] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-31 23:14:22] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-31 23:14:22] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-31 23:14:22] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 3 ms to minimize.
[2024-05-31 23:14:22] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:14:22] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:14:23] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 1/564 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:14:27] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:14:31] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:14:35] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/381 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 250/633 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:15:07] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:15:11] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 13/14 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60900 ms. Remains : 311/311 places, 253/253 transitions.
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Starting property specific reduction for DES-PT-50a-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:15:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (138 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (24 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:15:12] [INFO ] Invariant cache hit.
[2024-05-31 23:15:12] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:15:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:15:12] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-31 23:15:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:15:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:15:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:15:12] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-31 23:15:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:15:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:15:12] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 20 ms.
[2024-05-31 23:15:13] [INFO ] Added : 119 causal constraints over 24 iterations in 509 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p179) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 294 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 293 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 292 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 291 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 290 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 289 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 288 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 287 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 286 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 285 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 284 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 283 transition count 224
Applied a total of 28 rules in 53 ms. Remains 283 /311 variables (removed 28) and now considering 224/252 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 283/311 places, 224/252 transitions.
// Phase 1: matrix 224 rows 283 cols
[2024-05-31 23:15:13] [INFO ] Computed 61 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13657 resets) in 2929 ms. (341 steps per ms)
BEST_FIRST walk for 1000001 steps (2274 resets) in 1078 ms. (926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:15:17] [INFO ] Invariant cache hit.
[2024-05-31 23:15:17] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:15:17] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:15:17] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-31 23:15:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:15:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:15:17] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:15:18] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-31 23:15:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:15:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2024-05-31 23:15:18] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-05-31 23:15:18] [INFO ] Computed and/alt/rep : 215/373/215 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-31 23:15:18] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:15:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2024-05-31 23:15:18] [INFO ] Added : 111 causal constraints over 23 iterations in 465 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 283 /283 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 283/283 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 224/224 transitions.
Applied a total of 0 rules in 21 ms. Remains 283 /283 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-31 23:15:19] [INFO ] Invariant cache hit.
[2024-05-31 23:15:19] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-31 23:15:19] [INFO ] Invariant cache hit.
[2024-05-31 23:15:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:15:19] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-05-31 23:15:19] [INFO ] Redundant transitions in 2 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-31 23:15:19] [INFO ] Invariant cache hit.
[2024-05-31 23:15:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 2/281 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
At refinement iteration 7 (OVERLAPS) 224/506 variables, 282/343 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 2/345 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-31 23:15:27] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:15:27] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:15:27] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:15:27] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:15:28] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 5/350 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/350 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/507 variables, 1/351 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-31 23:15:34] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/507 variables, 1/352 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-31 23:15:36] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/507 variables, 1/353 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-31 23:15:38] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:15:38] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/507 variables, 2/355 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/507 variables, 0/355 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/507 variables, 0/355 constraints. Problems are: Problem set: 47 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 355 constraints, problems are : Problem set: 47 solved, 174 unsolved in 25334 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 283/283 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 47 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/57 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 2/60 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/60 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 48/282 variables, 8/68 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 2/70 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-31 23:15:47] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/71 constraints. Problems are: Problem set: 47 solved, 174 unsolved
[2024-05-31 23:15:48] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/72 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/72 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 224/506 variables, 282/354 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 2/356 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/506 variables, 174/530 constraints. Problems are: Problem set: 47 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/530 constraints. Problems are: Problem set: 47 solved, 174 unsolved
SMT process timed out in 55488ms, After SMT, problems are : Problem set: 47 solved, 174 unsolved
Search for dead transitions found 47 dead transitions in 55491ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 283/283 places, 177/224 transitions.
Graph (complete) has 795 edges and 283 vertex of which 236 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.3 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 236 /283 variables (removed 47) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 236 cols
[2024-05-31 23:16:15] [INFO ] Computed 61 invariants in 9 ms
[2024-05-31 23:16:15] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-31 23:16:15] [INFO ] Invariant cache hit.
[2024-05-31 23:16:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:16:15] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 236/283 places, 177/224 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56737 ms. Remains : 236/283 places, 177/224 transitions.
[2024-05-31 23:16:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13628 resets) in 2914 ms. (343 steps per ms)
BEST_FIRST walk for 1000001 steps (2225 resets) in 1064 ms. (938 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:16:19] [INFO ] Invariant cache hit.
[2024-05-31 23:16:19] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:16:19] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 23:16:20] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-31 23:16:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:16:20] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:16:20] [INFO ] Computed and/alt/rep : 168/278/168 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-31 23:16:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:16:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:16:20] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 23:16:20] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-31 23:16:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:16:20] [INFO ] Computed and/alt/rep : 168/278/168 causal constraints (skipped 6 transitions) in 19 ms.
[2024-05-31 23:16:20] [INFO ] Added : 113 causal constraints over 23 iterations in 306 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 236/236 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-31 23:16:21] [INFO ] Invariant cache hit.
[2024-05-31 23:16:21] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-31 23:16:21] [INFO ] Invariant cache hit.
[2024-05-31 23:16:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:16:21] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-31 23:16:21] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 23:16:21] [INFO ] Invariant cache hit.
[2024-05-31 23:16:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 1/235 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 177/412 variables, 235/297 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/413 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:28] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:16:28] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:16:28] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:16:29] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:16:29] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:32] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/413 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 306 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15949 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:39] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:16:39] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:16:39] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:16:39] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:41] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:16:41] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:42] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:16:42] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:42] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:16:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 177/412 variables, 235/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 174/489 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:16:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:16:51] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-31 23:16:51] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/413 variables, and 492 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 235/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 20/20 constraints]
After SMT, in 46059ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 46062ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46529 ms. Remains : 236/236 places, 177/177 transitions.
RANDOM walk for 40000 steps (555 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1183462 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :0 out of 2
Probabilistic random walk after 1183462 steps, saw 165732 distinct states, run finished after 3003 ms. (steps per millisecond=394 ) properties seen :0
[2024-05-31 23:17:10] [INFO ] Invariant cache hit.
[2024-05-31 23:17:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/311 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/312 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/312 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/364 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/413 variables, 49/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/311 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/311 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/312 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/364 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/413 variables, 49/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 764ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 536 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 236/236 places, 177/177 transitions.
RANDOM walk for 40000 steps (537 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (91 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1104984 steps, run timeout after 3001 ms. (steps per millisecond=368 ) properties seen :0 out of 2
Probabilistic random walk after 1104984 steps, saw 154593 distinct states, run finished after 3004 ms. (steps per millisecond=367 ) properties seen :0
[2024-05-31 23:17:15] [INFO ] Invariant cache hit.
[2024-05-31 23:17:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/311 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/312 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/312 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/364 variables, 3/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/413 variables, 49/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/413 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 299 constraints, problems are : Problem set: 0 solved, 2 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/132 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/166 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/175 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 124/299 variables, 175/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/311 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/311 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/311 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/312 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/312 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/312 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/364 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/364 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/364 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/413 variables, 49/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/413 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 529 ms.
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 236/236 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-31 23:17:16] [INFO ] Invariant cache hit.
[2024-05-31 23:17:16] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-31 23:17:16] [INFO ] Invariant cache hit.
[2024-05-31 23:17:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:17:17] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2024-05-31 23:17:17] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 23:17:17] [INFO ] Invariant cache hit.
[2024-05-31 23:17:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 2/234 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 1/235 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 177/412 variables, 235/297 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/413 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:23] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:17:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:17:24] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-05-31 23:17:24] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:17:24] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:27] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/413 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 306 constraints, problems are : Problem set: 0 solved, 174 unsolved in 15763 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 236/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 2/234 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 1/235 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:17:34] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:17:34] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:17:34] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:36] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:17:36] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:37] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:17:37] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:37] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-31 23:17:37] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 177/412 variables, 235/313 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/412 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 174/489 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-31 23:17:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-31 23:17:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:17:46] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/412 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/413 variables, and 492 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 235/236 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 20/20 constraints]
After SMT, in 45850ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 45853ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46322 ms. Remains : 236/236 places, 177/177 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 177
Applied a total of 1 rules in 15 ms. Remains 236 /236 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 236 cols
[2024-05-31 23:18:03] [INFO ] Computed 61 invariants in 12 ms
[2024-05-31 23:18:03] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 23:18:03] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:18:03] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:18:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:18:03] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-31 23:18:03] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:18:03] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-31 23:18:03] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:18:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
TRAPS : Iteration 1
[2024-05-31 23:18:03] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:18:03] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 576 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-02 in 171265 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:18:03] [INFO ] Computed 60 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (139 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:18:03] [INFO ] Invariant cache hit.
[2024-05-31 23:18:03] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:18:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:18:03] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 23:18:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:18:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:18:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:18:04] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-31 23:18:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:18:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-31 23:18:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:18:04] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-31 23:18:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2024-05-31 23:18:04] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-31 23:18:04] [INFO ] Added : 125 causal constraints over 26 iterations in 534 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p31) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 294 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 293 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 292 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 20 place count 291 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 21 place count 290 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 22 place count 289 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 23 place count 288 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 24 place count 287 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 24 with 1 rules applied. Total rules applied 25 place count 286 transition count 227
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 26 place count 285 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 27 place count 284 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 28 place count 283 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 28 with 1 rules applied. Total rules applied 29 place count 282 transition count 223
Applied a total of 29 rules in 43 ms. Remains 282 /311 variables (removed 29) and now considering 223/252 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 282/311 places, 223/252 transitions.
// Phase 1: matrix 223 rows 282 cols
[2024-05-31 23:18:05] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13637 resets) in 3038 ms. (329 steps per ms)
BEST_FIRST walk for 1000001 steps (2235 resets) in 1097 ms. (910 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:18:09] [INFO ] Invariant cache hit.
[2024-05-31 23:18:09] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:18:09] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 22 ms returned sat
[2024-05-31 23:18:09] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-31 23:18:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:18:09] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:18:09] [INFO ] Computed and/alt/rep : 214/320/214 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-31 23:18:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:18:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:18:10] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 23:18:10] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-31 23:18:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:18:10] [INFO ] Computed and/alt/rep : 214/320/214 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-31 23:18:10] [INFO ] Added : 124 causal constraints over 25 iterations in 413 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 223/223 transitions.
Applied a total of 0 rules in 16 ms. Remains 282 /282 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 282/282 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 282 /282 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-31 23:18:11] [INFO ] Invariant cache hit.
[2024-05-31 23:18:11] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-31 23:18:11] [INFO ] Invariant cache hit.
[2024-05-31 23:18:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:18:11] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-05-31 23:18:11] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2024-05-31 23:18:11] [INFO ] Invariant cache hit.
[2024-05-31 23:18:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/278 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/278 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 1/279 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 2/281 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD222 is UNSAT
At refinement iteration 7 (OVERLAPS) 223/504 variables, 281/342 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 2/344 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:19] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:18:20] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:18:20] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/504 variables, 3/347 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:18:23] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/504 variables, 8/355 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:26] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 1/356 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:27] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 1/357 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/357 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 14 (OVERLAPS) 1/505 variables, 1/358 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:34] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 1/359 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:18:37] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 5/364 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/364 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:40] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/505 variables, 1/365 constraints. Problems are: Problem set: 54 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 365 constraints, problems are : Problem set: 54 solved, 166 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 282/282 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 54 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 35/35 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 17/52 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 10/62 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/62 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 1/225 variables, 1/63 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 3/66 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:42] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 1/67 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/67 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 56/281 variables, 8/75 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 5/80 constraints. Problems are: Problem set: 54 solved, 166 unsolved
[2024-05-31 23:18:45] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-31 23:18:45] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 2/82 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/82 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 223/504 variables, 281/363 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 2/365 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 166/531 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/531 constraints. Problems are: Problem set: 54 solved, 166 unsolved
At refinement iteration 16 (OVERLAPS) 1/505 variables, 1/532 constraints. Problems are: Problem set: 54 solved, 166 unsolved
SMT process timed out in 60148ms, After SMT, problems are : Problem set: 54 solved, 166 unsolved
Search for dead transitions found 54 dead transitions in 60152ms
Found 54 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 54 transitions
Dead transitions reduction (with SMT) removed 54 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 282/282 places, 169/223 transitions.
Graph (complete) has 754 edges and 282 vertex of which 228 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 228 /282 variables (removed 54) and now considering 169/169 (removed 0) transitions.
// Phase 1: matrix 169 rows 228 cols
[2024-05-31 23:19:11] [INFO ] Computed 61 invariants in 1 ms
[2024-05-31 23:19:12] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-31 23:19:12] [INFO ] Invariant cache hit.
[2024-05-31 23:19:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:19:12] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 228/282 places, 169/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61142 ms. Remains : 228/282 places, 169/223 transitions.
[2024-05-31 23:19:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13619 resets) in 2894 ms. (345 steps per ms)
BEST_FIRST walk for 1000001 steps (2270 resets) in 1071 ms. (932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:19:16] [INFO ] Invariant cache hit.
[2024-05-31 23:19:16] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-31 23:19:16] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 7 ms returned sat
[2024-05-31 23:19:16] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-31 23:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:19:16] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-31 23:19:16] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 6 ms returned sat
[2024-05-31 23:19:16] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-31 23:19:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:19:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:19:16] [INFO ] Computed and/alt/rep : 160/258/160 causal constraints (skipped 6 transitions) in 10 ms.
[2024-05-31 23:19:17] [INFO ] Added : 128 causal constraints over 26 iterations in 337 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 169/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 228/228 places, 169/169 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 169/169 transitions.
Applied a total of 0 rules in 6 ms. Remains 228 /228 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2024-05-31 23:19:17] [INFO ] Invariant cache hit.
[2024-05-31 23:19:17] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-31 23:19:17] [INFO ] Invariant cache hit.
[2024-05-31 23:19:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:19:18] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-31 23:19:18] [INFO ] Redundant transitions in 0 ms returned []
Running 166 sub problems to find dead transitions.
[2024-05-31 23:19:18] [INFO ] Invariant cache hit.
[2024-05-31 23:19:18] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 1/225 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 2/227 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 169/396 variables, 227/288 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 23:19:23] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:19:23] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 1/397 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 23:19:25] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 23:19:28] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 3 ms to minimize.
[2024-05-31 23:19:28] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:19:29] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:19:29] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/397 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 23:19:32] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:19:32] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:19:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:19:32] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/397 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 23:19:33] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 19 (OVERLAPS) 0/397 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 303 constraints, problems are : Problem set: 0 solved, 166 unsolved in 19187 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/224 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 1/225 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 2/227 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 169/396 variables, 227/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 166/467 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 23:19:44] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-31 23:19:57] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/397 variables, and 469 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 227/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 13/14 constraints]
After SMT, in 49284ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 49286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49802 ms. Remains : 228/228 places, 169/169 transitions.
RANDOM walk for 40000 steps (531 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (94 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1145400 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :0 out of 2
Probabilistic random walk after 1145400 steps, saw 160505 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
[2024-05-31 23:20:10] [INFO ] Invariant cache hit.
[2024-05-31 23:20:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 80/100 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/135 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/160 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 116/283 variables, 167/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/295 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/296 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/296 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/296 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/348 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/348 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/397 variables, 49/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/397 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/397 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 80/100 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/135 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/160 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/167 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 116/283 variables, 167/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:20:11] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/283 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/295 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/295 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/296 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/296 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/296 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 52/348 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/348 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/348 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 49/397 variables, 49/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/397 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/397 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 294 constraints, problems are : Problem set: 0 solved, 2 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1005 steps, including 1 resets, run visited all 2 properties in 13 ms. (steps per millisecond=77 )
Parikh walk visited 2 properties in 17 ms.
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DES-PT-50a-UpperBounds-06 in 127658 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:20:11] [INFO ] Computed 60 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (138 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:20:11] [INFO ] Invariant cache hit.
[2024-05-31 23:20:11] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:20:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:20:11] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-31 23:20:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:20:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-31 23:20:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:20:11] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-31 23:20:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:20:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 24 ms returned sat
[2024-05-31 23:20:11] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 17 ms.
[2024-05-31 23:20:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-31 23:20:12] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-31 23:20:12] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:20:12] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:20:12] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:20:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 505 ms
[2024-05-31 23:20:13] [INFO ] Added : 195 causal constraints over 39 iterations in 1306 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p170) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 294 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 293 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 19 place count 292 transition count 233
Applied a total of 19 rules in 39 ms. Remains 292 /311 variables (removed 19) and now considering 233/252 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 292/311 places, 233/252 transitions.
// Phase 1: matrix 233 rows 292 cols
[2024-05-31 23:20:13] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13626 resets) in 3020 ms. (331 steps per ms)
BEST_FIRST walk for 1000001 steps (2268 resets) in 1100 ms. (908 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:20:17] [INFO ] Invariant cache hit.
[2024-05-31 23:20:17] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:20:17] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:20:17] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-31 23:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:20:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:20:18] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:20:18] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-31 23:20:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:20:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2024-05-31 23:20:18] [INFO ] Computed and/alt/rep : 224/382/224 causal constraints (skipped 6 transitions) in 15 ms.
[2024-05-31 23:20:18] [INFO ] Added : 149 causal constraints over 30 iterations in 532 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 292 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 292 /292 variables (removed 0) and now considering 233/233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 292/292 places, 233/233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 292/292 places, 233/233 transitions.
Applied a total of 0 rules in 5 ms. Remains 292 /292 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2024-05-31 23:20:19] [INFO ] Invariant cache hit.
[2024-05-31 23:20:19] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-31 23:20:19] [INFO ] Invariant cache hit.
[2024-05-31 23:20:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:20:19] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2024-05-31 23:20:19] [INFO ] Redundant transitions in 0 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-31 23:20:19] [INFO ] Invariant cache hit.
[2024-05-31 23:20:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 2/290 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 1/291 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-31 23:20:24] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 8 (OVERLAPS) 233/524 variables, 291/353 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 2/355 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/355 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/525 variables, 1/356 constraints. Problems are: Problem set: 29 solved, 201 unsolved
[2024-05-31 23:20:30] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:20:30] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-31 23:20:31] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:20:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:20:31] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 5/361 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/361 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 14 (OVERLAPS) 0/525 variables, 0/361 constraints. Problems are: Problem set: 29 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 361 constraints, problems are : Problem set: 29 solved, 201 unsolved in 17736 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 292/292 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 29 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 5/57 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/57 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/58 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 1/59 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/59 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 30/291 variables, 8/67 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/67 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 233/524 variables, 291/358 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 2/360 constraints. Problems are: Problem set: 29 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/524 variables, 201/561 constraints. Problems are: Problem set: 29 solved, 201 unsolved
[2024-05-31 23:20:47] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:20:47] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:20:49] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-31 23:20:49] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:20:50] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:20:57] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 6/567 constraints. Problems are: Problem set: 29 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/525 variables, and 567 constraints, problems are : Problem set: 29 solved, 201 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/292 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/230 constraints, Known Traps: 12/12 constraints]
After SMT, in 47897ms problems are : Problem set: 29 solved, 201 unsolved
Search for dead transitions found 29 dead transitions in 47900ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 292/292 places, 204/233 transitions.
Graph (complete) has 903 edges and 292 vertex of which 263 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.0 ms
Discarding 29 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 263 /292 variables (removed 29) and now considering 204/204 (removed 0) transitions.
// Phase 1: matrix 204 rows 263 cols
[2024-05-31 23:21:07] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:21:08] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-31 23:21:08] [INFO ] Invariant cache hit.
[2024-05-31 23:21:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:21:08] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 263/292 places, 204/233 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 49252 ms. Remains : 263/292 places, 204/233 transitions.
[2024-05-31 23:21:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13729 resets) in 3007 ms. (332 steps per ms)
BEST_FIRST walk for 1000001 steps (2238 resets) in 1064 ms. (938 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:21:12] [INFO ] Invariant cache hit.
[2024-05-31 23:21:12] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:21:12] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:21:12] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-31 23:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:21:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:21:12] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-31 23:21:12] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-31 23:21:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:21:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:21:12] [INFO ] Computed and/alt/rep : 195/323/195 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-31 23:21:13] [INFO ] Added : 193 causal constraints over 39 iterations in 695 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 6 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 263/263 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 5 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 23:21:14] [INFO ] Invariant cache hit.
[2024-05-31 23:21:14] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-31 23:21:14] [INFO ] Invariant cache hit.
[2024-05-31 23:21:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:21:14] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-31 23:21:14] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-31 23:21:14] [INFO ] Invariant cache hit.
[2024-05-31 23:21:14] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 2/261 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 1/262 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 204/466 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-31 23:21:21] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/467 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:21:28] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:21:28] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:21:31] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-31 23:21:32] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-31 23:21:32] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-31 23:21:33] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/467 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 16 (OVERLAPS) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 336 constraints, problems are : Problem set: 0 solved, 201 unsolved in 24276 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 1/262 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:21:41] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:21:43] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 204/466 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 201/538 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:21:51] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-05-31 23:21:57] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-31 23:22:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/467 variables, and 541 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 262/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 15/15 constraints]
After SMT, in 54386ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 54388ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54952 ms. Remains : 263/263 places, 204/204 transitions.
RANDOM walk for 40000 steps (538 resets) in 438 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 884593 steps, run timeout after 3005 ms. (steps per millisecond=294 ) properties seen :0 out of 2
Probabilistic random walk after 884593 steps, saw 126031 distinct states, run finished after 3005 ms. (steps per millisecond=294 ) properties seen :0
[2024-05-31 23:22:12] [INFO ] Invariant cache hit.
[2024-05-31 23:22:12] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/365 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/366 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/418 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/467 variables, 49/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 326 constraints, problems are : Problem set: 0 solved, 2 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/365 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/366 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/418 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/467 variables, 49/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1026 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 12 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 263/263 places, 204/204 transitions.
RANDOM walk for 40000 steps (553 resets) in 576 ms. (69 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (86 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 813186 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 2
Probabilistic random walk after 813186 steps, saw 116085 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
[2024-05-31 23:22:17] [INFO ] Invariant cache hit.
[2024-05-31 23:22:17] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/365 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/366 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/418 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/418 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/467 variables, 49/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/467 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 326 constraints, problems are : Problem set: 0 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/121 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/159 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/193 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/202 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/353 variables, 202/258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/365 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 3/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/365 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/366 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/418 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/418 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/418 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/467 variables, 49/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/467 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 328 constraints, problems are : Problem set: 0 solved, 2 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 969 ms.
Support contains 1 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 4 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 263/263 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 23:22:19] [INFO ] Invariant cache hit.
[2024-05-31 23:22:19] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 23:22:19] [INFO ] Invariant cache hit.
[2024-05-31 23:22:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:22:19] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-31 23:22:19] [INFO ] Redundant transitions in 1 ms returned []
Running 201 sub problems to find dead transitions.
[2024-05-31 23:22:19] [INFO ] Invariant cache hit.
[2024-05-31 23:22:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 2/261 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 1/262 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 204/466 variables, 262/323 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:22:25] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-31 23:22:25] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-31 23:22:25] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:22:26] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 1/467 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:22:32] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-31 23:22:32] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:22:35] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:22:35] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:22:35] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-31 23:22:37] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/467 variables, 4/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 16 (OVERLAPS) 0/467 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 336 constraints, problems are : Problem set: 0 solved, 201 unsolved in 22984 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 263/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/259 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 2/261 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 1/262 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:22:44] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:22:46] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 204/466 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 201/538 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-31 23:22:54] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:23:00] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:23:04] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/467 variables, and 541 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 262/263 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 15/15 constraints]
After SMT, in 53103ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 53105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53647 ms. Remains : 263/263 places, 204/204 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 204
Applied a total of 1 rules in 9 ms. Remains 263 /263 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 204 rows 263 cols
[2024-05-31 23:23:12] [INFO ] Computed 61 invariants in 8 ms
[2024-05-31 23:23:12] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:23:12] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:23:12] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:23:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:23:12] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:23:13] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:23:13] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:23:13] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 381 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-08 in 181836 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-10
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:23:13] [INFO ] Computed 60 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (134 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:23:13] [INFO ] Invariant cache hit.
[2024-05-31 23:23:13] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-31 23:23:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:23:13] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-05-31 23:23:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:23:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:23:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:23:13] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-31 23:23:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:23:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2024-05-31 23:23:13] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 18 ms.
[2024-05-31 23:23:13] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:23:14] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:23:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2024-05-31 23:23:14] [INFO ] Added : 95 causal constraints over 20 iterations in 600 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p111) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Applied a total of 10 rules in 12 ms. Remains 301 /311 variables (removed 10) and now considering 242/252 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 301/311 places, 242/252 transitions.
// Phase 1: matrix 242 rows 301 cols
[2024-05-31 23:23:14] [INFO ] Computed 61 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13708 resets) in 2953 ms. (338 steps per ms)
BEST_FIRST walk for 1000001 steps (2283 resets) in 1062 ms. (940 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:23:18] [INFO ] Invariant cache hit.
[2024-05-31 23:23:19] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:23:19] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:23:19] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-31 23:23:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:23:19] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:23:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:23:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:23:19] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 15 ms returned sat
[2024-05-31 23:23:19] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-31 23:23:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:23:19] [INFO ] Computed and/alt/rep : 233/397/233 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-31 23:23:19] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:23:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-31 23:23:19] [INFO ] Added : 87 causal constraints over 18 iterations in 447 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 301/301 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 23:23:20] [INFO ] Invariant cache hit.
[2024-05-31 23:23:20] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-31 23:23:20] [INFO ] Invariant cache hit.
[2024-05-31 23:23:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:23:21] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-31 23:23:21] [INFO ] Redundant transitions in 1 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-31 23:23:21] [INFO ] Invariant cache hit.
[2024-05-31 23:23:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 2/299 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 2/301 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 242/543 variables, 301/362 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:23:31] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:23:31] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-31 23:23:32] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:23:33] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:23:35] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:23:40] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/543 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:23:43] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 15 (OVERLAPS) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 371 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 2/299 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 2/301 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 242/543 variables, 301/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 239/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:24:09] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 611 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 8/8 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60766 ms. Remains : 301/301 places, 242/242 transitions.
RANDOM walk for 40000 steps (542 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 808299 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 2
Probabilistic random walk after 808299 steps, saw 115469 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2024-05-31 23:24:24] [INFO ] Invariant cache hit.
[2024-05-31 23:24:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/87 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/100 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/102 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/106 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 167/273 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/307 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/307 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/339 variables, 22/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/339 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/348 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/348 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 195/543 variables, 250/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/543 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/87 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/100 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/102 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/106 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/106 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 167/273 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/307 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/307 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/339 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:24:25] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/339 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/339 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/348 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/348 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 195/543 variables, 250/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/543 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 398 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 808ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1345 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 301/301 places, 242/242 transitions.
RANDOM walk for 40000 steps (553 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 789896 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 2
Probabilistic random walk after 789896 steps, saw 113083 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-05-31 23:24:29] [INFO ] Invariant cache hit.
[2024-05-31 23:24:29] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/87 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/100 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/100 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/102 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/106 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 167/273 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/273 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 34/307 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/307 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/339 variables, 22/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/339 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 9/348 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/348 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 195/543 variables, 250/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/543 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 30 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/543 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/79 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/82 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/87 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/100 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/102 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/102 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/106 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/106 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 167/273 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/273 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 34/307 variables, 19/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/307 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 32/339 variables, 22/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 23:24:30] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/339 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/339 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 9/348 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/348 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 195/543 variables, 250/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/543 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/543 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 0/543 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 367 constraints, problems are : Problem set: 0 solved, 2 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 789ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1385 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 301/301 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 23:24:32] [INFO ] Invariant cache hit.
[2024-05-31 23:24:32] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-31 23:24:32] [INFO ] Invariant cache hit.
[2024-05-31 23:24:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:24:32] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-31 23:24:32] [INFO ] Redundant transitions in 2 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-31 23:24:32] [INFO ] Invariant cache hit.
[2024-05-31 23:24:32] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 2/299 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 2/301 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (OVERLAPS) 242/543 variables, 301/362 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:24:42] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-31 23:24:42] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-31 23:24:43] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:24:44] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:24:46] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/543 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:24:52] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/543 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:24:55] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/543 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 15 (OVERLAPS) 0/543 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 371 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 2/299 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 2/301 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 242/543 variables, 301/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 239/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-31 23:25:21] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 611 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 301/301 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 8/8 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60765 ms. Remains : 301/301 places, 242/242 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 23:25:32] [INFO ] Invariant cache hit.
[2024-05-31 23:25:32] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:25:32] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 23:25:32] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:25:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 23:25:32] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:25:33] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:25:33] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:25:33] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 375 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-10 in 140091 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-14
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:25:33] [INFO ] Computed 60 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (137 resets) in 37 ms. (263 steps per ms)
BEST_FIRST walk for 10000 steps (24 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:25:33] [INFO ] Invariant cache hit.
[2024-05-31 23:25:33] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:25:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:25:33] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-31 23:25:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-31 23:25:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:25:33] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-31 23:25:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:25:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:25:33] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 22 ms.
[2024-05-31 23:25:34] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-31 23:25:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-31 23:25:34] [INFO ] Added : 172 causal constraints over 36 iterations in 824 ms. Result :sat
Minimization took 121 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 311 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p167) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 252/252 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 310 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 309 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 308 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 307 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 306 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 305 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 304 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 303 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 302 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 301 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 300 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 299 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 298 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 297 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 296 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 295 transition count 236
Applied a total of 16 rules in 22 ms. Remains 295 /311 variables (removed 16) and now considering 236/252 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 295/311 places, 236/252 transitions.
// Phase 1: matrix 236 rows 295 cols
[2024-05-31 23:25:35] [INFO ] Computed 61 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13595 resets) in 3067 ms. (325 steps per ms)
BEST_FIRST walk for 1000000 steps (2278 resets) in 1088 ms. (918 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:25:39] [INFO ] Invariant cache hit.
[2024-05-31 23:25:39] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:25:39] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-31 23:25:39] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-31 23:25:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:25:39] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 23:25:39] [INFO ] Computed and/alt/rep : 227/385/227 causal constraints (skipped 6 transitions) in 16 ms.
[2024-05-31 23:25:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:25:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:25:40] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:25:40] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-31 23:25:40] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2024-05-31 23:25:40] [INFO ] Computed and/alt/rep : 227/385/227 causal constraints (skipped 6 transitions) in 20 ms.
[2024-05-31 23:25:40] [INFO ] Added : 202 causal constraints over 41 iterations in 796 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 236/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 295 /295 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 295/295 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 236/236 transitions.
Applied a total of 0 rules in 5 ms. Remains 295 /295 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2024-05-31 23:25:41] [INFO ] Invariant cache hit.
[2024-05-31 23:25:41] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 23:25:41] [INFO ] Invariant cache hit.
[2024-05-31 23:25:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:25:42] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-31 23:25:42] [INFO ] Redundant transitions in 1 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-31 23:25:42] [INFO ] Invariant cache hit.
[2024-05-31 23:25:42] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 2/293 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 1/294 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-31 23:25:47] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 8 (OVERLAPS) 236/530 variables, 294/356 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 2/358 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/358 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/359 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-31 23:25:53] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-31 23:25:53] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:25:54] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:25:54] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 4/363 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 0/363 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-31 23:25:59] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:26:01] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/531 variables, 2/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/531 variables, 0/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 16 (OVERLAPS) 0/531 variables, 0/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 365 constraints, problems are : Problem set: 23 solved, 210 unsolved in 25031 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 295/295 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 23 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 6/58 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/58 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 1/59 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/60 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/60 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 24/294 variables, 8/68 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-31 23:26:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/69 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/69 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 236/530 variables, 294/363 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 2/365 constraints. Problems are: Problem set: 23 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 210/575 constraints. Problems are: Problem set: 23 solved, 210 unsolved
[2024-05-31 23:26:20] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:26:20] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:26:20] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:26:20] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:26:20] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-31 23:26:23] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:26:23] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-31 23:26:27] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 8/583 constraints. Problems are: Problem set: 23 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/531 variables, and 583 constraints, problems are : Problem set: 23 solved, 210 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 294/295 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/233 constraints, Known Traps: 16/16 constraints]
After SMT, in 55177ms problems are : Problem set: 23 solved, 210 unsolved
Search for dead transitions found 23 dead transitions in 55180ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 295/295 places, 213/236 transitions.
Graph (complete) has 939 edges and 295 vertex of which 272 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 272 /295 variables (removed 23) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 272 cols
[2024-05-31 23:26:37] [INFO ] Computed 61 invariants in 2 ms
[2024-05-31 23:26:37] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-31 23:26:37] [INFO ] Invariant cache hit.
[2024-05-31 23:26:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:26:37] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 272/295 places, 213/236 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56273 ms. Remains : 272/295 places, 213/236 transitions.
[2024-05-31 23:26:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13654 resets) in 3037 ms. (329 steps per ms)
BEST_FIRST walk for 1000001 steps (2270 resets) in 1109 ms. (900 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 23:26:42] [INFO ] Invariant cache hit.
[2024-05-31 23:26:42] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 23:26:42] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-31 23:26:42] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-31 23:26:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:26:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-31 23:26:42] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 23:26:42] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-31 23:26:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:26:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2024-05-31 23:26:42] [INFO ] Computed and/alt/rep : 204/338/204 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-31 23:26:43] [INFO ] Added : 168 causal constraints over 34 iterations in 566 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 272/272 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-31 23:26:43] [INFO ] Invariant cache hit.
[2024-05-31 23:26:43] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-31 23:26:43] [INFO ] Invariant cache hit.
[2024-05-31 23:26:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:26:44] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-31 23:26:44] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 23:26:44] [INFO ] Invariant cache hit.
[2024-05-31 23:26:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 1/271 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/484 variables, 271/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:26:51] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:26:51] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:26:54] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-31 23:26:55] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:26:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-31 23:26:57] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:26:58] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 1/485 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:27:04] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 16 (OVERLAPS) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 343 constraints, problems are : Problem set: 0 solved, 210 unsolved in 26773 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-31 23:27:13] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-31 23:27:14] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:27:14] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-31 23:27:14] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:27:15] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:27:16] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:27:16] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 213/484 variables, 271/349 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 210/561 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:27:30] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/485 variables, and 562 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints]
After SMT, in 56901ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 56904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57480 ms. Remains : 272/272 places, 213/213 transitions.
RANDOM walk for 40000 steps (553 resets) in 361 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (87 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 903765 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 2
Probabilistic random walk after 903765 steps, saw 128715 distinct states, run finished after 3001 ms. (steps per millisecond=301 ) properties seen :0
[2024-05-31 23:27:44] [INFO ] Invariant cache hit.
[2024-05-31 23:27:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/383 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/384 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/436 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/485 variables, 49/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/383 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/384 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/436 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/485 variables, 49/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1076 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 272/272 places, 213/213 transitions.
RANDOM walk for 40000 steps (565 resets) in 435 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 872629 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 2
Probabilistic random walk after 872629 steps, saw 124344 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2024-05-31 23:27:49] [INFO ] Invariant cache hit.
[2024-05-31 23:27:49] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/383 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/384 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 52/436 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/436 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 49/485 variables, 49/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 335 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 96/130 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/168 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/202 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/211 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 160/371 variables, 211/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/371 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/383 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/384 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/384 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/384 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 52/436 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/436 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/436 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 49/485 variables, 49/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/485 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 337 constraints, problems are : Problem set: 0 solved, 2 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1633 ms.
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 272/272 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-31 23:27:51] [INFO ] Invariant cache hit.
[2024-05-31 23:27:51] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-31 23:27:51] [INFO ] Invariant cache hit.
[2024-05-31 23:27:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:27:52] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-31 23:27:52] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-31 23:27:52] [INFO ] Invariant cache hit.
[2024-05-31 23:27:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 1/271 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/484 variables, 271/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:27:59] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-31 23:27:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:28:02] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-31 23:28:03] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:28:05] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:28:05] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-31 23:28:06] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 1/485 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:28:11] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 16 (OVERLAPS) 0/485 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 343 constraints, problems are : Problem set: 0 solved, 210 unsolved in 26326 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:28:21] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:28:21] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:28:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:28:22] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-31 23:28:22] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2024-05-31 23:28:22] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-31 23:28:22] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:28:23] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:28:24] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 213/484 variables, 271/349 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/484 variables, 210/561 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-31 23:28:37] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/485 variables, and 562 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/272 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints]
After SMT, in 56450ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 56454ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57021 ms. Remains : 272/272 places, 213/213 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 213
Applied a total of 1 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 213 rows 272 cols
[2024-05-31 23:28:48] [INFO ] Computed 61 invariants in 5 ms
[2024-05-31 23:28:48] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:28:48] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 23:28:48] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 23:28:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-31 23:28:48] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 17 ms returned sat
[2024-05-31 23:28:49] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 23:28:49] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 23:28:49] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 385 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DES-PT-50a-UpperBounds-14 in 196007 ms.
[2024-05-31 23:28:49] [INFO ] Flatten gal took : 92 ms
[2024-05-31 23:28:49] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 9 ms.
[2024-05-31 23:28:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 253 transitions and 1219 arcs took 7 ms.
Total runtime 1025459 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-50a-UpperBounds-02
Could not compute solution for formula : DES-PT-50a-UpperBounds-08
Could not compute solution for formula : DES-PT-50a-UpperBounds-10
Could not compute solution for formula : DES-PT-50a-UpperBounds-14

BK_STOP 1717198129770

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 DES-PT-50a-UpperBounds-02
ub formula formula --maxsum=/tmp/2008/ub_0_
ub formula name DES-PT-50a-UpperBounds-08
ub formula formula --maxsum=/tmp/2008/ub_1_
ub formula name DES-PT-50a-UpperBounds-10
ub formula formula --maxsum=/tmp/2008/ub_2_
ub formula name DES-PT-50a-UpperBounds-14
ub formula formula --maxsum=/tmp/2008/ub_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-50a"
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 DES-PT-50a, 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 r480-tall-171624189900733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;