About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 684.764 | 86144.00 | 238832.00 | 218.00 | T | 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.r534-smll-171683819200007.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 SieveSingleMsgMbox-PT-d0m06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r534-smll-171683819200007
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1717247713067
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:15:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:15:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:15:16] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2024-06-01 13:15:16] [INFO ] Transformed 262 places.
[2024-06-01 13:15:16] [INFO ] Transformed 73 transitions.
[2024-06-01 13:15:16] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 457 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 39 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-06-01 13:15:16] [INFO ] Computed 5 invariants in 18 ms
[2024-06-01 13:15:16] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 13:15:16] [INFO ] Invariant cache hit.
[2024-06-01 13:15:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 13:15:17] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-06-01 13:15:17] [INFO ] Invariant cache hit.
[2024-06-01 13:15:17] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:15:18] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:15:19] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
[2024-06-01 13:15:19] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:15:19] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:15:19] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:15:19] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:15:19] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:15:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 73/143 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:15:21] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/143 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 14 (OVERLAPS) 0/143 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 115 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 73/143 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 72/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 187 constraints, problems are : Problem set: 0 solved, 72 unsolved in 5078 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 9/9 constraints]
After SMT, in 11270ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 11297ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 12267 ms. Remains : 70/262 places, 73/73 transitions.
Discarding 10 transitions out of 73. Remains 63
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8968 resets) in 3219 ms. (12 steps per ms) remains 38/62 properties
BEST_FIRST walk for 4004 steps (204 resets) in 93 ms. (42 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (184 resets) in 43 ms. (90 steps per ms) remains 35/38 properties
BEST_FIRST walk for 4001 steps (184 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (181 resets) in 59 ms. (66 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (199 resets) in 58 ms. (67 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (205 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (194 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (194 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (181 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (192 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (190 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (172 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (173 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (203 resets) in 51 ms. (76 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (200 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (199 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (190 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (202 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (198 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (187 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (800 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (398 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (410 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (384 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (418 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (425 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (410 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (411 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (429 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (406 resets) in 28 ms. (138 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (410 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (459 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (421 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (417 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (387 resets) in 45 ms. (87 steps per ms) remains 35/35 properties
[2024-06-01 13:15:29] [INFO ] Invariant cache hit.
[2024-06-01 13:15:29] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 72/141 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 30/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 2/143 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 111 constraints, problems are : Problem set: 0 solved, 35 unsolved in 3475 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 72/141 variables, 69/79 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 30/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 15/124 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 2/143 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 0/143 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 147 constraints, problems are : Problem set: 0 solved, 35 unsolved in 3090 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 6/6 constraints]
After SMT, in 6637ms problems are : Problem set: 0 solved, 35 unsolved
Parikh walk visited 0 properties in 1354 ms.
Support contains 43 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 68 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 71
Applied a total of 4 rules in 24 ms. Remains 68 /70 variables (removed 2) and now considering 71/73 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 68/70 places, 71/73 transitions.
RANDOM walk for 4000000 steps (894400 resets) in 22596 ms. (177 steps per ms) remains 32/35 properties
BEST_FIRST walk for 400003 steps (19331 resets) in 738 ms. (541 steps per ms) remains 28/32 properties
BEST_FIRST walk for 400003 steps (19210 resets) in 705 ms. (566 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400002 steps (19159 resets) in 680 ms. (587 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (19524 resets) in 684 ms. (583 steps per ms) remains 23/27 properties
BEST_FIRST walk for 400003 steps (19447 resets) in 804 ms. (496 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (19280 resets) in 779 ms. (512 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (19224 resets) in 931 ms. (429 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (19422 resets) in 778 ms. (513 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (19136 resets) in 1018 ms. (392 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (19277 resets) in 773 ms. (516 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (19090 resets) in 763 ms. (523 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (19050 resets) in 776 ms. (514 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (19184 resets) in 785 ms. (508 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (19296 resets) in 764 ms. (522 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (19297 resets) in 758 ms. (527 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (19314 resets) in 765 ms. (522 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1237 ms. (323 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (41440 resets) in 965 ms. (414 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (41737 resets) in 969 ms. (412 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (41168 resets) in 989 ms. (404 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (41118 resets) in 986 ms. (405 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (41148 resets) in 988 ms. (404 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (41437 resets) in 994 ms. (402 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (41131 resets) in 1003 ms. (398 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (41253 resets) in 1004 ms. (398 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (40971 resets) in 995 ms. (401 steps per ms) remains 23/23 properties
// Phase 1: matrix 71 rows 68 cols
[2024-06-01 13:15:52] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 13:15:52] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 32/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 13:15:52] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:15:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 70/136 variables, 66/73 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 29/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/139 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 105 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 32/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 13:15:53] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 70/136 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 29/103 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 3/139 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 0/139 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 129 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 3/3 constraints]
After SMT, in 3198ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 1317 ms.
Support contains 29 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 64 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 63 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 63 transition count 65
Applied a total of 11 rules in 19 ms. Remains 63 /68 variables (removed 5) and now considering 65/71 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 63/68 places, 65/71 transitions.
RANDOM walk for 4000000 steps (894384 resets) in 21098 ms. (189 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (19378 resets) in 771 ms. (518 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400001 steps (19170 resets) in 718 ms. (556 steps per ms) remains 20/23 properties
BEST_FIRST walk for 400003 steps (19079 resets) in 680 ms. (587 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19206 resets) in 696 ms. (573 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19072 resets) in 698 ms. (572 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19329 resets) in 675 ms. (591 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19211 resets) in 693 ms. (576 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19235 resets) in 670 ms. (596 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19353 resets) in 680 ms. (587 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19122 resets) in 689 ms. (579 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19468 resets) in 689 ms. (579 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19158 resets) in 690 ms. (578 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1078 ms. (370 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41833 resets) in 900 ms. (443 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41160 resets) in 878 ms. (455 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (40946 resets) in 871 ms. (458 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41023 resets) in 857 ms. (466 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41277 resets) in 874 ms. (457 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (41062 resets) in 857 ms. (466 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (40766 resets) in 906 ms. (441 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (41153 resets) in 866 ms. (461 steps per ms) remains 20/20 properties
// Phase 1: matrix 65 rows 63 cols
[2024-06-01 13:16:08] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 13:16:08] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 30/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5/61 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 13:16:08] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 3/128 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-01 13:16:09] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/128 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 105 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 30/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5/61 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 3/128 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/128 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 125 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2051 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 10/10 constraints]
After SMT, in 4529ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 454 ms.
Support contains 26 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 64
Applied a total of 2 rules in 18 ms. Remains 62 /63 variables (removed 1) and now considering 64/65 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 62/63 places, 64/65 transitions.
RANDOM walk for 4000000 steps (894541 resets) in 18546 ms. (215 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19262 resets) in 708 ms. (564 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19083 resets) in 727 ms. (549 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19194 resets) in 726 ms. (550 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19122 resets) in 713 ms. (560 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19232 resets) in 685 ms. (583 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19203 resets) in 684 ms. (583 steps per ms) remains 18/20 properties
BEST_FIRST walk for 400002 steps (19166 resets) in 628 ms. (635 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19160 resets) in 800 ms. (499 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19505 resets) in 664 ms. (601 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1051 ms. (380 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41973 resets) in 834 ms. (479 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41184 resets) in 805 ms. (496 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41225 resets) in 855 ms. (467 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41119 resets) in 835 ms. (478 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41089 resets) in 1194 ms. (334 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41008 resets) in 1046 ms. (382 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (40978 resets) in 1417 ms. (282 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41061 resets) in 1019 ms. (392 steps per ms) remains 18/18 properties
// Phase 1: matrix 64 rows 62 cols
[2024-06-01 13:16:24] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 13:16:24] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 63/123 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 3/126 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/126 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/126 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 99 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 63/123 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 3/126 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/126 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 117 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 6/6 constraints]
After SMT, in 3432ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 578 ms.
Support contains 24 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 62 /62 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 62/62 places, 64/64 transitions.
RANDOM walk for 4000000 steps (894741 resets) in 18385 ms. (217 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (19100 resets) in 649 ms. (615 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19515 resets) in 658 ms. (606 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19066 resets) in 664 ms. (601 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19291 resets) in 659 ms. (606 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (19361 resets) in 657 ms. (607 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19153 resets) in 654 ms. (610 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19238 resets) in 663 ms. (602 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (19295 resets) in 653 ms. (611 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19203 resets) in 664 ms. (601 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1050 ms. (380 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41787 resets) in 810 ms. (493 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (41224 resets) in 1265 ms. (315 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41133 resets) in 793 ms. (503 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41123 resets) in 807 ms. (495 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41375 resets) in 796 ms. (501 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (40843 resets) in 807 ms. (495 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41078 resets) in 1024 ms. (390 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41278 resets) in 831 ms. (480 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 1549 steps, run visited all 18 properties in 26 ms. (steps per millisecond=59 )
Probabilistic random walk after 1549 steps, saw 808 distinct states, run finished after 33 ms. (steps per millisecond=46 ) properties seen :18
Able to resolve query QuasiLiveness after proving 63 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 83606 ms.
ITS solved all properties within timeout
BK_STOP 1717247799211
--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d0m06"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SieveSingleMsgMbox-PT-d0m06, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r534-smll-171683819200007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m06.tgz
mv SieveSingleMsgMbox-PT-d0m06 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;