About the Execution of LTSMin+red for AutoFlight-PT-24b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 610.163 | 505795.00 | 1139912.00 | 1214.60 | 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.r470-smll-171620175600112.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 AutoFlight-PT-24b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r470-smll-171620175600112
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K 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.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 12 22:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 538K 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 booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1717191787941
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-24b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:43:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 21:43:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:43:11] [INFO ] Load time of PNML (sax parser for PT used): 497 ms
[2024-05-31 21:43:11] [INFO ] Transformed 2230 places.
[2024-05-31 21:43:11] [INFO ] Transformed 2228 transitions.
[2024-05-31 21:43:11] [INFO ] Found NUPN structural information;
[2024-05-31 21:43:11] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 909 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 2230 transition count 1336
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1060 rules applied. Total rules applied 1952 place count 1338 transition count 1168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 2000 place count 1290 transition count 1168
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 2000 place count 1290 transition count 873
Deduced a syphon composed of 295 places in 42 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 2590 place count 995 transition count 873
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 1 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 3 with 868 rules applied. Total rules applied 3458 place count 561 transition count 439
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3458 rules in 582 ms. Remains 561 /2230 variables (removed 1669) and now considering 439/2228 (removed 1789) transitions.
// Phase 1: matrix 439 rows 561 cols
[2024-05-31 21:43:12] [INFO ] Computed 148 invariants in 55 ms
[2024-05-31 21:43:14] [INFO ] Implicit Places using invariants in 2088 ms returned [171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 213, 216, 219, 222, 225, 228, 231, 234, 237, 240, 560]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 2146 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 536/2230 places, 439/2228 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 536 transition count 415
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 512 transition count 415
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 100 place count 486 transition count 389
Applied a total of 100 rules in 29 ms. Remains 486 /536 variables (removed 50) and now considering 389/439 (removed 50) transitions.
// Phase 1: matrix 389 rows 486 cols
[2024-05-31 21:43:14] [INFO ] Computed 123 invariants in 9 ms
[2024-05-31 21:43:15] [INFO ] Implicit Places using invariants in 863 ms returned []
[2024-05-31 21:43:15] [INFO ] Invariant cache hit.
[2024-05-31 21:43:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-31 21:43:19] [INFO ] Implicit Places using invariants and state equation in 3749 ms returned []
Implicit Place search using SMT with State Equation took 4626 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 486/2230 places, 389/2228 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 7422 ms. Remains : 486/2230 places, 389/2228 transitions.
Discarding 96 transitions out of 389. Remains 293
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (492 resets) in 5690 ms. (7 steps per ms) remains 126/292 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 15 ms. (25 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 12 ms. (31 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 126/126 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 126/126 properties
[2024-05-31 21:43:21] [INFO ] Invariant cache hit.
[2024-05-31 21:43:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 174/390 variables, 75/291 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 174/465 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-31 21:43:24] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 30 ms to minimize.
[2024-05-31 21:43:25] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 3 ms to minimize.
[2024-05-31 21:43:25] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
[2024-05-31 21:43:25] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 3 ms to minimize.
[2024-05-31 21:43:25] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/875 variables, and 470 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5035 ms.
Refiners :[Domain max(s): 390/486 constraints, Positive P Invariants (semi-flows): 75/123 constraints, State Equation: 0/486 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 174/390 variables, 75/291 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 174/465 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-31 21:43:27] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-31 21:43:28] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 3 ms to minimize.
[2024-05-31 21:43:28] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 3 ms to minimize.
[2024-05-31 21:43:28] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s5 0)
(s6 1)
(s7 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s19 0)
(s20 0)
(s21 1)
(s26 0)
(s27 0)
(s28 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s40 0)
(s41 0)
(s42 1)
(s47 0)
(s48 0)
(s49 1)
(s54 0)
(s55 0)
(s56 1)
(s61 0)
(s62 0)
(s63 1)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s75 0)
(s76 0)
(s77 1)
(s82 0)
(s83 0)
(s84 1)
(s89 0)
(s90 0)
(s91 1)
(s96 0)
(s97 0)
(s98 1)
(s103 0)
(s104 0)
(s105 1)
(s110 0)
(s111 0)
(s112 1)
(s117 0)
(s118 0)
(s119 1)
(s124 0)
(s125 0)
(s126 1)
(s131 0)
(s132 0)
(s133 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s145 0)
(s146 0)
(s147 1)
(s152 0)
(s153 0)
(s154 1)
(s159 0)
(s160 0)
(s161 1)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 1)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/875 variables, and 474 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5013 ms.
Refiners :[Domain max(s): 390/486 constraints, Positive P Invariants (semi-flows): 75/123 constraints, State Equation: 0/486 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/126 constraints, Known Traps: 9/9 constraints]
After SMT, in 10239ms problems are : Problem set: 0 solved, 126 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 216 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 389/389 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 473 transition count 376
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 473 transition count 376
Free-agglomeration rule applied 44 times.
Iterating global reduction 0 with 44 rules applied. Total rules applied 70 place count 473 transition count 332
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 114 place count 429 transition count 332
Applied a total of 114 rules in 92 ms. Remains 429 /486 variables (removed 57) and now considering 332/389 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 429/486 places, 332/389 transitions.
RANDOM walk for 4000000 steps (72179 resets) in 68169 ms. (58 steps per ms) remains 72/126 properties
BEST_FIRST walk for 400004 steps (245 resets) in 1644 ms. (243 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400003 steps (240 resets) in 1669 ms. (239 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (368 resets) in 1709 ms. (233 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (363 resets) in 1492 ms. (267 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (368 resets) in 1455 ms. (274 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1202 ms. (332 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (369 resets) in 1552 ms. (257 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1537 ms. (260 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (368 resets) in 1310 ms. (305 steps per ms) remains 72/72 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1212 ms. (329 steps per ms) remains 71/72 properties
BEST_FIRST walk for 400004 steps (364 resets) in 1253 ms. (318 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1207 ms. (331 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (366 resets) in 1262 ms. (316 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1220 ms. (327 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (364 resets) in 1242 ms. (321 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1209 ms. (330 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (369 resets) in 1214 ms. (329 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1196 ms. (334 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (367 resets) in 1242 ms. (321 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1195 ms. (334 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (367 resets) in 1214 ms. (329 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (353 resets) in 1209 ms. (330 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (365 resets) in 1445 ms. (276 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1473 ms. (271 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (366 resets) in 1506 ms. (265 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (355 resets) in 1512 ms. (264 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (366 resets) in 1257 ms. (317 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1458 ms. (274 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (369 resets) in 1380 ms. (289 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1188 ms. (336 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (370 resets) in 1204 ms. (331 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (353 resets) in 1196 ms. (334 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (364 resets) in 1213 ms. (329 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1184 ms. (337 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (364 resets) in 1218 ms. (328 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (345 resets) in 1200 ms. (333 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400004 steps (364 resets) in 1435 ms. (278 steps per ms) remains 70/71 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1446 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1456 ms. (274 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (368 resets) in 1230 ms. (324 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (354 resets) in 1205 ms. (331 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1199 ms. (333 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1214 ms. (329 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1223 ms. (326 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1195 ms. (334 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (353 resets) in 1217 ms. (328 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1279 ms. (312 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (354 resets) in 1533 ms. (260 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (353 resets) in 1511 ms. (264 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (352 resets) in 1194 ms. (334 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (347 resets) in 1230 ms. (324 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (352 resets) in 1183 ms. (337 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (345 resets) in 1207 ms. (331 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1218 ms. (328 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (353 resets) in 1221 ms. (327 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (351 resets) in 1219 ms. (327 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (353 resets) in 1217 ms. (328 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (351 resets) in 1224 ms. (326 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (349 resets) in 1200 ms. (333 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (352 resets) in 1211 ms. (330 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (348 resets) in 1212 ms. (329 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (351 resets) in 1186 ms. (336 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (355 resets) in 1197 ms. (333 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (349 resets) in 1186 ms. (336 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (350 resets) in 1181 ms. (338 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1199 ms. (333 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (355 resets) in 1211 ms. (330 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1218 ms. (328 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (354 resets) in 1217 ms. (328 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (348 resets) in 1237 ms. (323 steps per ms) remains 70/70 properties
// Phase 1: matrix 332 rows 429 cols
[2024-05-31 21:44:13] [INFO ] Computed 123 invariants in 4 ms
[2024-05-31 21:44:13] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 179/294 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 135/429 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 3 ms to minimize.
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 5 ms to minimize.
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 332/761 variables, 429/556 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 164/720 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/761 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 720 constraints, problems are : Problem set: 0 solved, 70 unsolved in 15287 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 429/429 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 179/294 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 135/429 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 21:44:31] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 3 ms to minimize.
[2024-05-31 21:44:31] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 3 ms to minimize.
[2024-05-31 21:44:31] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 332/761 variables, 429/559 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 164/723 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/761 variables, 70/793 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 21:44:38] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/761 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 21:44:46] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/761 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/761 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (OVERLAPS) 0/761 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 761/761 variables, and 795 constraints, problems are : Problem set: 0 solved, 70 unsolved in 44859 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 429/429 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 9/9 constraints]
After SMT, in 60195ms problems are : Problem set: 0 solved, 70 unsolved
Parikh walk visited 11 properties in 12557 ms.
Support contains 93 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 332/332 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 418 transition count 321
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 418 transition count 321
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 418 transition count 317
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 414 transition count 317
Applied a total of 30 rules in 50 ms. Remains 414 /429 variables (removed 15) and now considering 317/332 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 414/429 places, 317/332 transitions.
RANDOM walk for 4000000 steps (39511 resets) in 94145 ms. (42 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (241 resets) in 1816 ms. (220 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (235 resets) in 2196 ms. (182 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (341 resets) in 2082 ms. (192 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (284 resets) in 2272 ms. (175 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (333 resets) in 2487 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (290 resets) in 1803 ms. (221 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (295 resets) in 1891 ms. (211 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (328 resets) in 2053 ms. (194 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (292 resets) in 1786 ms. (223 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (285 resets) in 2293 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (331 resets) in 2210 ms. (180 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (287 resets) in 2362 ms. (169 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (292 resets) in 1851 ms. (215 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (330 resets) in 2677 ms. (149 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (291 resets) in 1922 ms. (208 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (285 resets) in 2521 ms. (158 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (333 resets) in 2278 ms. (175 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (297 resets) in 1887 ms. (211 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (284 resets) in 2243 ms. (178 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (332 resets) in 2432 ms. (164 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (280 resets) in 1887 ms. (211 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (288 resets) in 2065 ms. (193 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (334 resets) in 2236 ms. (178 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (286 resets) in 2168 ms. (184 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400001 steps (285 resets) in 2710 ms. (147 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (338 resets) in 2685 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (282 resets) in 2422 ms. (165 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (285 resets) in 1791 ms. (223 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (291 resets) in 1798 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (287 resets) in 2128 ms. (187 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (284 resets) in 2046 ms. (195 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (291 resets) in 2170 ms. (184 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (288 resets) in 2064 ms. (193 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (284 resets) in 2280 ms. (175 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (276 resets) in 2118 ms. (188 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (285 resets) in 2103 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (272 resets) in 1902 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (276 resets) in 2303 ms. (173 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (278 resets) in 1878 ms. (212 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (283 resets) in 2023 ms. (197 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (290 resets) in 2268 ms. (176 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (284 resets) in 1869 ms. (213 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (288 resets) in 2107 ms. (189 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (300 resets) in 1907 ms. (209 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (299 resets) in 1862 ms. (214 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (284 resets) in 2156 ms. (185 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (287 resets) in 1918 ms. (208 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (301 resets) in 2212 ms. (180 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (290 resets) in 2450 ms. (163 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (294 resets) in 1990 ms. (200 steps per ms) remains 59/59 properties
Interrupted probabilistic random walk after 10026812 steps, run timeout after 192001 ms. (steps per millisecond=52 ) properties seen :25 out of 59
Probabilistic random walk after 10026812 steps, saw 3282310 distinct states, run finished after 192013 ms. (steps per millisecond=52 ) properties seen :25
// Phase 1: matrix 317 rows 414 cols
[2024-05-31 21:49:43] [INFO ] Computed 123 invariants in 3 ms
[2024-05-31 21:49:43] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 224/292 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 122/414 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 317/731 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 34 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 168/705 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/731 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/731 variables, and 705 constraints, problems are : Problem set: 0 solved, 34 unsolved in 3849 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 414/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 224/292 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 122/414 variables, 97/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 317/731 variables, 414/537 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 168/705 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 34/739 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/731 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/731 variables, and 739 constraints, problems are : Problem set: 0 solved, 34 unsolved in 8809 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 414/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 12683ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 24 properties in 30446 ms.
Support contains 20 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 317/317 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 316
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 32 place count 413 transition count 286
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 62 place count 383 transition count 286
Applied a total of 62 rules in 80 ms. Remains 383 /414 variables (removed 31) and now considering 286/317 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 383/414 places, 286/317 transitions.
RANDOM walk for 4000000 steps (39733 resets) in 48880 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3879875 steps (5065 resets) in 17723 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (4813 resets) in 17248 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3992866 steps (4816 resets) in 16885 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3894153 steps (4631 resets) in 17054 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3932067 steps (4640 resets) in 16731 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3806982 steps (4558 resets) in 16322 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3862495 steps (4626 resets) in 16548 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3672487 steps (4391 resets) in 15915 ms. (230 steps per ms) remains 10/10 properties
BEST_FIRST walk for 3918544 steps (4687 resets) in 16610 ms. (235 steps per ms) remains 9/10 properties
BEST_FIRST walk for 3859736 steps (4689 resets) in 15951 ms. (241 steps per ms) remains 9/9 properties
// Phase 1: matrix 286 rows 383 cols
[2024-05-31 21:51:30] [INFO ] Computed 123 invariants in 2 ms
[2024-05-31 21:51:30] [INFO ] State equation strengthened by 198 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 226/244 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 139/383 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 286/669 variables, 383/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 198/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/669 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 704 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 383/383 constraints, ReadFeed: 198/198 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 226/244 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 139/383 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 286/669 variables, 383/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 198/704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 9/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/669 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 713 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1854 ms.
Refiners :[Positive P Invariants (semi-flows): 123/123 constraints, State Equation: 383/383 constraints, ReadFeed: 198/198 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2930ms problems are : Problem set: 0 solved, 9 unsolved
Finished Parikh walk after 135 steps, including 0 resets, run visited all 9 properties in 10 ms. (steps per millisecond=13 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 21 ms.
Able to resolve query QuasiLiveness after proving 293 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 502825 ms.
ITS solved all properties within timeout
BK_STOP 1717192293736
--------------------
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="AutoFlight-PT-24b"
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 AutoFlight-PT-24b, 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 r470-smll-171620175600112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b 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 ;