About the Execution of LTSMin+red for EisenbergMcGuire-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 761.420 | 347390.00 | 426678.00 | 1042.80 | 1 1 1 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.r492-smll-171636266300165.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 EisenbergMcGuire-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 460K 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 EisenbergMcGuire-PT-05-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717223058773
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:24:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 06:24:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:24:21] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2024-06-01 06:24:22] [INFO ] Transformed 295 places.
[2024-06-01 06:24:22] [INFO ] Transformed 800 transitions.
[2024-06-01 06:24:22] [INFO ] Found NUPN structural information;
[2024-06-01 06:24:22] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
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, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 06:24:22] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2024-06-01 06:24:22] [INFO ] Computed 16 invariants in 34 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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 89 ms. (111 steps per ms)
FORMULA EisenbergMcGuire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 06:24:22] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
[2024-06-01 06:24:22] [INFO ] Invariant cache hit.
[2024-06-01 06:24:23] [INFO ] [Real]Absence check using 11 positive place invariants in 26 ms returned sat
[2024-06-01 06:24:23] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 6 ms returned sat
[2024-06-01 06:24:23] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2024-06-01 06:24:23] [INFO ] State equation strengthened by 196 read => feed constraints.
[2024-06-01 06:24:23] [INFO ] [Real]Added 196 Read/Feed constraints in 72 ms returned sat
[2024-06-01 06:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2024-06-01 06:24:23] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 9 ms returned sat
[2024-06-01 06:24:24] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-06-01 06:24:24] [INFO ] [Nat]Added 196 Read/Feed constraints in 52 ms returned sat
[2024-06-01 06:24:24] [INFO ] Deduced a trap composed of 3 places in 319 ms of which 43 ms to minimize.
[2024-06-01 06:24:24] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 6 ms to minimize.
[2024-06-01 06:24:25] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 4 ms to minimize.
[2024-06-01 06:24:25] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 5 ms to minimize.
[2024-06-01 06:24:25] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 5 ms to minimize.
[2024-06-01 06:24:26] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 5 ms to minimize.
[2024-06-01 06:24:26] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 5 ms to minimize.
[2024-06-01 06:24:27] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 5 ms to minimize.
[2024-06-01 06:24:27] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 5 ms to minimize.
[2024-06-01 06:24:27] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:24:27] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 4 ms to minimize.
[2024-06-01 06:24:28] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2024-06-01 06:24:28] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2024-06-01 06:24:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4143 ms
[2024-06-01 06:24:28] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 73 ms.
[2024-06-01 06:24:28] [INFO ] Added : 20 causal constraints over 4 iterations in 279 ms. Result :unknown
[2024-06-01 06:24:28] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 06:24:28] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-01 06:24:29] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2024-06-01 06:24:29] [INFO ] [Real]Added 196 Read/Feed constraints in 45 ms returned sat
[2024-06-01 06:24:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2024-06-01 06:24:29] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-01 06:24:29] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2024-06-01 06:24:29] [INFO ] [Nat]Added 196 Read/Feed constraints in 51 ms returned sat
[2024-06-01 06:24:29] [INFO ] Deduced a trap composed of 3 places in 223 ms of which 4 ms to minimize.
[2024-06-01 06:24:30] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:24:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 458 ms
[2024-06-01 06:24:30] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 87 ms.
[2024-06-01 06:24:32] [INFO ] Deduced a trap composed of 20 places in 378 ms of which 6 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 48 places in 301 ms of which 5 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:24:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1300 ms
[2024-06-01 06:24:33] [INFO ] Added : 213 causal constraints over 43 iterations in 3710 ms. Result :sat
Minimization took 355 ms.
[2024-06-01 06:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:34] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2024-06-01 06:24:34] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:24:34] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-06-01 06:24:34] [INFO ] [Real]Added 196 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:24:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 06:24:34] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:24:34] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-06-01 06:24:34] [INFO ] [Nat]Added 196 Read/Feed constraints in 34 ms returned sat
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 4 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:24:35] [INFO ] Deduced a trap composed of 51 places in 253 ms of which 4 ms to minimize.
[2024-06-01 06:24:36] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 3 ms to minimize.
[2024-06-01 06:24:36] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 3 ms to minimize.
[2024-06-01 06:24:36] [INFO ] Deduced a trap composed of 29 places in 263 ms of which 4 ms to minimize.
[2024-06-01 06:24:36] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:24:36] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:24:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2053 ms
[2024-06-01 06:24:37] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 84 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 06:24:39] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-01 06:24:39] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:24:40] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-06-01 06:24:40] [INFO ] [Real]Added 196 Read/Feed constraints in 49 ms returned sat
[2024-06-01 06:24:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2024-06-01 06:24:40] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:24:40] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-06-01 06:24:40] [INFO ] [Nat]Added 196 Read/Feed constraints in 58 ms returned sat
[2024-06-01 06:24:40] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 5 ms to minimize.
[2024-06-01 06:24:41] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 6 ms to minimize.
[2024-06-01 06:24:41] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 5 ms to minimize.
[2024-06-01 06:24:41] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 4 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 4 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 5 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 7 ms to minimize.
[2024-06-01 06:24:42] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 2 ms to minimize.
[2024-06-01 06:24:43] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 4 ms to minimize.
[2024-06-01 06:24:43] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:24:43] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:24:43] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:24:43] [INFO ] Deduced a trap composed of 49 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:24:43] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3259 ms
[2024-06-01 06:24:43] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 88 ms.
[2024-06-01 06:24:45] [INFO ] Added : 110 causal constraints over 22 iterations in 1307 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 10 place count 290 transition count 716
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 168 place count 211 transition count 716
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 188 place count 191 transition count 616
Iterating global reduction 2 with 20 rules applied. Total rules applied 208 place count 191 transition count 616
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 248 place count 171 transition count 596
Applied a total of 248 rules in 216 ms. Remains 171 /295 variables (removed 124) and now considering 596/800 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 171/295 places, 596/800 transitions.
[2024-06-01 06:24:46] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2024-06-01 06:24:46] [INFO ] Computed 16 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1805 ms. (553 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 825 ms. (2421 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 06:24:48] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:24:48] [INFO ] Invariant cache hit.
[2024-06-01 06:24:48] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 06:24:48] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-01 06:24:48] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-01 06:24:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:24:49] [INFO ] [Real]Added 116 Read/Feed constraints in 39 ms returned sat
[2024-06-01 06:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 06:24:49] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:24:49] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-06-01 06:24:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 26 ms returned sat
[2024-06-01 06:24:49] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 42 ms.
[2024-06-01 06:24:50] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 3 ms to minimize.
[2024-06-01 06:24:50] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:24:50] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:24:50] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 2 ms to minimize.
[2024-06-01 06:24:50] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:24:51] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-06-01 06:24:51] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:24:51] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:24:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1263 ms
[2024-06-01 06:24:51] [INFO ] Added : 118 causal constraints over 24 iterations in 2194 ms. Result :sat
Minimization took 189 ms.
[2024-06-01 06:24:51] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-06-01 06:24:51] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:24:51] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-06-01 06:24:51] [INFO ] [Real]Added 116 Read/Feed constraints in 35 ms returned sat
[2024-06-01 06:24:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:24:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-06-01 06:24:52] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:24:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-01 06:24:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 28 ms returned sat
[2024-06-01 06:24:52] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 42 ms.
[2024-06-01 06:24:52] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:24:52] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2024-06-01 06:24:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2024-06-01 06:24:53] [INFO ] Added : 61 causal constraints over 15 iterations in 767 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 42 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 36 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2024-06-01 06:24:53] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:24:53] [INFO ] Invariant cache hit.
[2024-06-01 06:24:53] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-06-01 06:24:53] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:24:53] [INFO ] Invariant cache hit.
[2024-06-01 06:24:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:24:54] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1270 ms to find 0 implicit places.
[2024-06-01 06:24:54] [INFO ] Redundant transitions in 59 ms returned []
Running 591 sub problems to find dead transitions.
[2024-06-01 06:24:54] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:24:54] [INFO ] Invariant cache hit.
[2024-06-01 06:24:54] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:24:59] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 17 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-06-01 06:25:00] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:25:01] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:25:01] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:25:01] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:25:01] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:25:01] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:25:01] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:25:02] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 4 ms to minimize.
[2024-06-01 06:25:02] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:25:02] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:25:02] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:25:03] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:25:04] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-06-01 06:25:04] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:25:04] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:25:04] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:25:05] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 2 ms to minimize.
[2024-06-01 06:25:05] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:25:05] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:25:05] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:25:06] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:25:06] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:25:06] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:25:06] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:25:06] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:25:07] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:25:07] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:25:07] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:25:07] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:25:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:25:08] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:25:13] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-06-01 06:25:13] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:25:14] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:25:14] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 3 ms to minimize.
[2024-06-01 06:25:14] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:25:15] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:25:15] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:25:16] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:25:16] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-06-01 06:25:16] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:25:17] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:25:17] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:25:21] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:25:22] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:25:23] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 3 ms to minimize.
[2024-06-01 06:25:23] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-06-01 06:25:23] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:25:24] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:25:24] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/432 variables, and 75 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 591/591 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 591 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 591 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 59/75 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:25:30] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 3 ms to minimize.
[2024-06-01 06:25:30] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 4 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 3 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:25:31] [INFO ] Deduced a trap composed of 57 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:25:32] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:25:33] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:25:34] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:25:38] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:25:38] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:25:38] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:25:39] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
[2024-06-01 06:25:39] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:25:39] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 2 ms to minimize.
[2024-06-01 06:25:39] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:25:41] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 3 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:25:42] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 591 unsolved
[2024-06-01 06:25:44] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:25:46] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 73 places in 214 ms of which 3 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
[2024-06-01 06:25:47] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:25:48] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 3 ms to minimize.
[2024-06-01 06:25:49] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 4 ms to minimize.
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:25:50] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 13/111 constraints. Problems are: Problem set: 0 solved, 591 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 171/432 variables, and 111 constraints, problems are : Problem set: 0 solved, 591 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/171 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/591 constraints, Known Traps: 95/95 constraints]
After SMT, in 60599ms problems are : Problem set: 0 solved, 591 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62076 ms. Remains : 171/171 places, 596/596 transitions.
[2024-06-01 06:25:55] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:25:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1807 ms. (553 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 494 ms. (2020 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 06:25:57] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2024-06-01 06:25:57] [INFO ] Invariant cache hit.
[2024-06-01 06:25:57] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-06-01 06:25:57] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:25:58] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-06-01 06:25:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 06:25:58] [INFO ] [Real]Added 116 Read/Feed constraints in 37 ms returned sat
[2024-06-01 06:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:25:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 06:25:58] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:25:58] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-06-01 06:25:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:25:58] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 39 ms.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:25:58] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2024-06-01 06:25:59] [INFO ] Added : 61 causal constraints over 15 iterations in 740 ms. Result :sat
Minimization took 129 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 171 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p33_0_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 595/595 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 170 transition count 594
Applied a total of 1 rules in 33 ms. Remains 170 /171 variables (removed 1) and now considering 594/595 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 170/171 places, 594/595 transitions.
[2024-06-01 06:25:59] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
// Phase 1: matrix 259 rows 170 cols
[2024-06-01 06:25:59] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 2118 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 673 ms. (1483 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 06:26:02] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:26:02] [INFO ] Invariant cache hit.
[2024-06-01 06:26:02] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2024-06-01 06:26:02] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-01 06:26:02] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-06-01 06:26:02] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 06:26:02] [INFO ] [Real]Added 115 Read/Feed constraints in 31 ms returned sat
[2024-06-01 06:26:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:26:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 06:26:02] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:26:02] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-06-01 06:26:02] [INFO ] [Nat]Added 115 Read/Feed constraints in 28 ms returned sat
[2024-06-01 06:26:02] [INFO ] Computed and/alt/rep : 260/882/200 causal constraints (skipped 54 transitions) in 39 ms.
[2024-06-01 06:26:03] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-06-01 06:26:03] [INFO ] Added : 50 causal constraints over 11 iterations in 504 ms. Result :sat
Minimization took 97 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 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 170/170 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 14 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-06-01 06:26:03] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:26:03] [INFO ] Invariant cache hit.
[2024-06-01 06:26:03] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-01 06:26:03] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:26:03] [INFO ] Invariant cache hit.
[2024-06-01 06:26:03] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 06:26:04] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2024-06-01 06:26:04] [INFO ] Redundant transitions in 8 ms returned []
Running 589 sub problems to find dead transitions.
[2024-06-01 06:26:04] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:26:04] [INFO ] Invariant cache hit.
[2024-06-01 06:26:04] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:26:08] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:26:09] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:26:10] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:26:10] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 06:26:11] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-01 06:26:11] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:26:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:26:11] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:26:11] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:26:12] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:26:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:26:22] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:26:23] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:26:24] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:26:25] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:26:32] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 3 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 2 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:26:33] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/429 variables, and 52 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:26:42] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 2 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:26:43] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 2 ms to minimize.
[2024-06-01 06:26:44] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-06-01 06:26:44] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2024-06-01 06:26:45] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 2 ms to minimize.
[2024-06-01 06:26:45] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:26:45] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 3 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-06-01 06:26:46] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:26:47] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:26:47] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:26:47] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:26:51] [INFO ] Deduced a trap composed of 56 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 46 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:26:52] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:26:53] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 29 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:26:54] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 2 ms to minimize.
[2024-06-01 06:26:56] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:26:59] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-06-01 06:27:00] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:27:00] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:27:00] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 3 ms to minimize.
[2024-06-01 06:27:02] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:27:04] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 60507ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61339 ms. Remains : 170/170 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 1665 ms. (24 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 417954 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 2
Probabilistic random walk after 417954 steps, saw 86958 distinct states, run finished after 3007 ms. (steps per millisecond=138 ) properties seen :0
[2024-06-01 06:27:08] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:27:08] [INFO ] Invariant cache hit.
[2024-06-01 06:27:08] [INFO ] State equation strengthened by 115 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/121 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 64/185 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/281 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 140/429 variables, 104/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 93/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 37/121 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 64/185 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/281 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/289 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 2 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 140/429 variables, 104/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 93/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
[2024-06-01 06:27:09] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1403ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 170/170 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 538974 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 2
Probabilistic random walk after 538974 steps, saw 108036 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2024-06-01 06:27:13] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:27:13] [INFO ] Invariant cache hit.
[2024-06-01 06:27:13] [INFO ] State equation strengthened by 115 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:13] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/121 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 64/185 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/281 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 140/429 variables, 104/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 93/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 37/121 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 64/185 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/281 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/289 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 3 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 140/429 variables, 104/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 93/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:27:14] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1517ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 122 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 24 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 170/170 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 25 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-06-01 06:27:14] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:27:14] [INFO ] Invariant cache hit.
[2024-06-01 06:27:15] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 06:27:15] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:27:15] [INFO ] Invariant cache hit.
[2024-06-01 06:27:15] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 06:27:15] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2024-06-01 06:27:15] [INFO ] Redundant transitions in 7 ms returned []
Running 589 sub problems to find dead transitions.
[2024-06-01 06:27:15] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:27:15] [INFO ] Invariant cache hit.
[2024-06-01 06:27:15] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:27:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:27:21] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-06-01 06:27:22] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 3 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:27:23] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:27:34] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 3 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 5 ms to minimize.
[2024-06-01 06:27:35] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 3 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 2 ms to minimize.
[2024-06-01 06:27:36] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:27:37] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 2 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 2 ms to minimize.
[2024-06-01 06:27:38] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-06-01 06:27:39] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:27:46] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/429 variables, and 48 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:27:55] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 52 places in 175 ms of which 3 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:27:56] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 2 ms to minimize.
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:27:57] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 3 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2024-06-01 06:27:58] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:27:59] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:28:02] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 3 ms to minimize.
[2024-06-01 06:28:02] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 42 places in 192 ms of which 3 ms to minimize.
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:28:03] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-06-01 06:28:04] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 3 ms to minimize.
[2024-06-01 06:28:05] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-06-01 06:28:06] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:28:06] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2024-06-01 06:28:07] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 3 ms to minimize.
[2024-06-01 06:28:08] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:28:08] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 3 ms to minimize.
[2024-06-01 06:28:12] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 2 ms to minimize.
[2024-06-01 06:28:13] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:28:14] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:28:15] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/429 variables, and 94 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 78/78 constraints]
After SMT, in 60483ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60498ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61509 ms. Remains : 170/170 places, 594/594 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 533 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 5 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 150 transition count 167
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 118 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 65 place count 118 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 92 place count 102 transition count 156
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 172 place count 62 transition count 116
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 192 place count 62 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 212 place count 52 transition count 171
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 217 place count 52 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 222 place count 52 transition count 161
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 247 place count 52 transition count 161
Applied a total of 247 rules in 56 ms. Remains 52 /170 variables (removed 118) and now considering 161/594 (removed 433) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 161 rows 52 cols
[2024-06-01 06:28:16] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 06:28:16] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:28:16] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 06:28:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:28:16] [INFO ] After 24ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 06:28:16] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 06:28:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 06:28:16] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 06:28:16] [INFO ] After 20ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 06:28:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:28:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-06-01 06:28:16] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 06:28:17] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 602 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 06:28:17] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
// Phase 1: matrix 259 rows 170 cols
[2024-06-01 06:28:17] [INFO ] Computed 16 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 06:28:17] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:28:17] [INFO ] Invariant cache hit.
[2024-06-01 06:28:17] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 06:28:17] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:28:17] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-06-01 06:28:17] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 06:28:17] [INFO ] [Real]Added 115 Read/Feed constraints in 31 ms returned sat
[2024-06-01 06:28:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:28:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2024-06-01 06:28:17] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-01 06:28:17] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-01 06:28:17] [INFO ] [Nat]Added 115 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:28:17] [INFO ] Computed and/alt/rep : 260/882/200 causal constraints (skipped 54 transitions) in 39 ms.
[2024-06-01 06:28:18] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2024-06-01 06:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-01 06:28:18] [INFO ] Added : 50 causal constraints over 11 iterations in 497 ms. Result :sat
Minimization took 114 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 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 21 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 170/170 places, 594/594 transitions.
[2024-06-01 06:28:18] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:28:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1493 ms. (669 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 401 ms. (2487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 06:28:20] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:28:20] [INFO ] Invariant cache hit.
[2024-06-01 06:28:20] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:28:20] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-01 06:28:20] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-06-01 06:28:20] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 06:28:20] [INFO ] [Real]Added 115 Read/Feed constraints in 30 ms returned sat
[2024-06-01 06:28:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:28:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-06-01 06:28:20] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-01 06:28:20] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-06-01 06:28:20] [INFO ] [Nat]Added 115 Read/Feed constraints in 29 ms returned sat
[2024-06-01 06:28:20] [INFO ] Computed and/alt/rep : 260/882/200 causal constraints (skipped 54 transitions) in 35 ms.
[2024-06-01 06:28:21] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-01 06:28:21] [INFO ] Added : 50 causal constraints over 11 iterations in 489 ms. Result :sat
Minimization took 111 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 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 21 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 170/170 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 21 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-06-01 06:28:21] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:28:21] [INFO ] Invariant cache hit.
[2024-06-01 06:28:21] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-06-01 06:28:21] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:28:21] [INFO ] Invariant cache hit.
[2024-06-01 06:28:22] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 06:28:22] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2024-06-01 06:28:22] [INFO ] Redundant transitions in 7 ms returned []
Running 589 sub problems to find dead transitions.
[2024-06-01 06:28:22] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:28:22] [INFO ] Invariant cache hit.
[2024-06-01 06:28:22] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:28:27] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-06-01 06:28:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:28:28] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 3 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:28:30] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 06:28:30] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-01 06:28:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:28:41] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-06-01 06:28:41] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-06-01 06:28:41] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 2 ms to minimize.
[2024-06-01 06:28:42] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-06-01 06:28:42] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:28:42] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:28:42] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-06-01 06:28:42] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 3 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-06-01 06:28:43] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:28:44] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 3 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-06-01 06:28:45] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-06-01 06:28:52] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 2 ms to minimize.
[2024-06-01 06:28:53] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
SMT process timed out in 30440ms, After SMT, problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 30452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31727 ms. Remains : 170/170 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 394 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 543684 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 2
Probabilistic random walk after 543684 steps, saw 108800 distinct states, run finished after 3002 ms. (steps per millisecond=181 ) properties seen :0
[2024-06-01 06:28:56] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:28:56] [INFO ] Invariant cache hit.
[2024-06-01 06:28:56] [INFO ] State equation strengthened by 115 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:28:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/121 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 64/185 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/281 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 140/429 variables, 104/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 93/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 37/121 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 64/185 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/281 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/289 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 140/429 variables, 104/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 93/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-06-01 06:28:57] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1531ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 218 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 19 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 170/170 places, 594/594 transitions.
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 433758 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 433758 steps, saw 89647 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
[2024-06-01 06:29:01] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:29:01] [INFO ] Invariant cache hit.
[2024-06-01 06:29:01] [INFO ] State equation strengthened by 115 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:29:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/121 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 64/185 variables, 28/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 96/281 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/281 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 8/289 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/289 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 140/429 variables, 104/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/429 variables, 93/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/429 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 51/84 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 37/121 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 64/185 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 96/281 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/281 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 8/289 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 4 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/289 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/289 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 140/429 variables, 104/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/429 variables, 93/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 3 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:29:02] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/429 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/429 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 170/170 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 1542ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 170/170 places, 594/594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 594/594 transitions.
Applied a total of 0 rules in 18 ms. Remains 170 /170 variables (removed 0) and now considering 594/594 (removed 0) transitions.
[2024-06-01 06:29:03] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:29:03] [INFO ] Invariant cache hit.
[2024-06-01 06:29:03] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-06-01 06:29:03] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:29:03] [INFO ] Invariant cache hit.
[2024-06-01 06:29:03] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-01 06:29:04] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
[2024-06-01 06:29:04] [INFO ] Redundant transitions in 8 ms returned []
Running 589 sub problems to find dead transitions.
[2024-06-01 06:29:04] [INFO ] Flow matrix only has 259 transitions (discarded 335 similar events)
[2024-06-01 06:29:04] [INFO ] Invariant cache hit.
[2024-06-01 06:29:04] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:29:09] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:29:10] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:29:11] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2024-06-01 06:29:12] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (OVERLAPS) 1/170 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:29:23] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 3 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 3 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 3 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 3 ms to minimize.
[2024-06-01 06:29:25] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-06-01 06:29:25] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:29:25] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 3 ms to minimize.
[2024-06-01 06:29:26] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-06-01 06:29:26] [INFO ] Deduced a trap composed of 51 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:29:26] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:29:26] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2024-06-01 06:29:26] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 6 ms to minimize.
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2024-06-01 06:29:28] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:29:28] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
[2024-06-01 06:29:28] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/429 variables, and 47 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 589/589 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 589 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:29:38] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-06-01 06:29:39] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 3 ms to minimize.
[2024-06-01 06:29:39] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:29:39] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 5 (OVERLAPS) 1/170 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 589 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:29:49] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-06-01 06:29:50] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-06-01 06:29:51] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-06-01 06:29:52] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 3 ms to minimize.
[2024-06-01 06:29:53] [INFO ] Deduced a trap composed of 46 places in 198 ms of which 3 ms to minimize.
[2024-06-01 06:29:53] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-06-01 06:29:53] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 589 unsolved
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 2 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 3 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
[2024-06-01 06:29:56] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 2 ms to minimize.
[2024-06-01 06:29:57] [INFO ] Deduced a trap composed of 40 places in 147 ms of which 2 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 2 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 3 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 39 places in 185 ms of which 3 ms to minimize.
[2024-06-01 06:29:58] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 37 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:29:59] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 2 ms to minimize.
[2024-06-01 06:30:00] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 3 ms to minimize.
[2024-06-01 06:30:01] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 10 ms to minimize.
[2024-06-01 06:30:01] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 3 ms to minimize.
[2024-06-01 06:30:02] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 3 ms to minimize.
[2024-06-01 06:30:02] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 3 ms to minimize.
[2024-06-01 06:30:02] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 3 ms to minimize.
[2024-06-01 06:30:02] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 589 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/429 variables, and 80 constraints, problems are : Problem set: 0 solved, 589 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/170 constraints, ReadFeed: 0/115 constraints, PredecessorRefiner: 0/589 constraints, Known Traps: 64/64 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 589 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61633 ms. Remains : 170/170 places, 594/594 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 533 edges and 170 vertex of which 25 / 170 are part of one of the 5 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Ensure Unique test removed 320 transitions
Reduce isomorphic transitions removed 395 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 150 transition count 167
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 118 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 65 place count 118 transition count 156
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 92 place count 102 transition count 156
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 172 place count 62 transition count 116
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 192 place count 62 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 212 place count 52 transition count 171
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 217 place count 52 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 222 place count 52 transition count 161
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 247 place count 52 transition count 161
Applied a total of 247 rules in 40 ms. Remains 52 /170 variables (removed 118) and now considering 161/594 (removed 433) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 161 rows 52 cols
[2024-06-01 06:30:04] [INFO ] Computed 11 invariants in 2 ms
[2024-06-01 06:30:04] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:30:04] [INFO ] After 95ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-06-01 06:30:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 06:30:04] [INFO ] After 24ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 06:30:04] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 06:30:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 06:30:05] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 06:30:05] [INFO ] After 23ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 06:30:05] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:30:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-01 06:30:05] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 06:30:05] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 505 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-15 in 108178 ms.
[2024-06-01 06:30:05] [INFO ] Flatten gal took : 170 ms
[2024-06-01 06:30:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-06-01 06:30:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 594 transitions and 2984 arcs took 15 ms.
Total runtime 344271 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : EisenbergMcGuire-PT-05-UpperBounds-15
BK_STOP 1717223406163
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name EisenbergMcGuire-PT-05-UpperBounds-15
ub formula formula --maxsum=/tmp/2029/ub_0_
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="EisenbergMcGuire-PT-05"
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 EisenbergMcGuire-PT-05, 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 r492-smll-171636266300165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-05.tgz
mv EisenbergMcGuire-PT-05 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;