About the Execution of GreatSPN+red for Parking-PT-832
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 743.243 | 192572.00 | 518923.00 | 339.80 | 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.r276-smll-171654415900057.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 greatspnxred
Input is Parking-PT-832, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654415900057
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 251K 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 1716814840956
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-832
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 13:00:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-27 13:00:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 13:00:43] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-05-27 13:00:43] [INFO ] Transformed 737 places.
[2024-05-27 13:00:43] [INFO ] Transformed 993 transitions.
[2024-05-27 13:00:43] [INFO ] Found NUPN structural information;
[2024-05-27 13:00:43] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 504 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 737/737 places, 993/993 transitions.
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 400 rules applied. Total rules applied 400 place count 737 transition count 593
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 416 place count 721 transition count 593
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 416 place count 721 transition count 577
Deduced a syphon composed of 16 places in 7 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 448 place count 705 transition count 577
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 512 place count 673 transition count 545
Applied a total of 512 rules in 323 ms. Remains 673 /737 variables (removed 64) and now considering 545/993 (removed 448) transitions.
// Phase 1: matrix 545 rows 673 cols
[2024-05-27 13:00:44] [INFO ] Computed 184 invariants in 27 ms
[2024-05-27 13:00:45] [INFO ] Implicit Places using invariants in 1201 ms returned [135, 142, 148, 154, 178, 180, 205, 212, 218, 224, 248, 250, 275, 282, 288, 294, 318, 320, 345, 352, 358, 364, 388, 390, 415, 422, 428, 434, 458, 460, 485, 492, 498, 504, 528, 530, 555, 562, 568, 574, 598, 600, 625, 632, 638, 644, 668, 670]
Discarding 48 places :
Implicit Place search using SMT only with invariants took 1420 ms to find 48 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 625/737 places, 545/993 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 585 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 584 transition count 524
Applied a total of 82 rules in 56 ms. Remains 584 /625 variables (removed 41) and now considering 524/545 (removed 21) transitions.
// Phase 1: matrix 524 rows 584 cols
[2024-05-27 13:00:45] [INFO ] Computed 136 invariants in 9 ms
[2024-05-27 13:00:46] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-05-27 13:00:46] [INFO ] Invariant cache hit.
[2024-05-27 13:00:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-27 13:00:48] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 584/737 places, 524/993 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 4966 ms. Remains : 584/737 places, 524/993 transitions.
Discarding 196 transitions out of 524. Remains 328
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (205 resets) in 4087 ms. (9 steps per ms) remains 111/327 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 10 ms. (36 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 8 ms. (44 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 11 ms. (33 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 111/111 properties
BEST_FIRST walk for 404 steps (0 resets) in 19 ms. (20 steps per ms) remains 111/111 properties
[2024-05-27 13:00:50] [INFO ] Invariant cache hit.
[2024-05-27 13:00:50] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 326/546 variables, 117/337 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 326/663 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 38/584 variables, 19/682 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 38/720 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1108 variables, and 720 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5021 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 0/584 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 326/546 variables, 117/337 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 326/663 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 38/584 variables, 19/682 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 38/720 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 111 unsolved
SMT process timed out in 10300ms, After SMT, problems are : Problem set: 0 solved, 111 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 220 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 524/524 transitions.
Free-agglomeration rule applied 54 times.
Iterating global reduction 0 with 54 rules applied. Total rules applied 54 place count 584 transition count 470
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 108 place count 530 transition count 470
Applied a total of 108 rules in 117 ms. Remains 530 /584 variables (removed 54) and now considering 470/524 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 530/584 places, 470/524 transitions.
RANDOM walk for 4000000 steps (19118 resets) in 78687 ms. (50 steps per ms) remains 84/111 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1933 ms. (206 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1518 ms. (263 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1709 ms. (233 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1407 ms. (284 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1280 ms. (312 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1444 ms. (276 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1458 ms. (274 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1273 ms. (313 steps per ms) remains 84/84 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1274 ms. (313 steps per ms) remains 83/84 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1279 ms. (312 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1298 ms. (307 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1266 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1275 ms. (313 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1271 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1271 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1271 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1270 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1264 ms. (316 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1268 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1271 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1268 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1272 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1274 ms. (313 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1275 ms. (313 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1267 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1287 ms. (310 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1286 ms. (310 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1264 ms. (316 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1268 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1263 ms. (316 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1268 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1265 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1266 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1264 ms. (316 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1272 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1271 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1272 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (40 resets) in 1272 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1283 ms. (311 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1274 ms. (313 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1275 ms. (313 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1267 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1269 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (41 resets) in 1271 ms. (314 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1266 ms. (315 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1263 ms. (316 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1273 ms. (313 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400004 steps (40 resets) in 1274 ms. (313 steps per ms) remains 83/83 properties
// Phase 1: matrix 470 rows 530 cols
[2024-05-27 13:01:40] [INFO ] Computed 136 invariants in 3 ms
[2024-05-27 13:01:40] [INFO ] State equation strengthened by 247 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 293/459 variables, 91/257 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 293/550 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 71/530 variables, 45/595 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 71/666 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 470/1000 variables, 530/1196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 247/1443 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/1000 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1443 constraints, problems are : Problem set: 0 solved, 83 unsolved in 18339 ms.
Refiners :[Domain max(s): 530/530 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 530/530 constraints, ReadFeed: 247/247 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 293/459 variables, 91/257 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 293/550 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 71/530 variables, 45/595 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 71/666 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 470/1000 variables, 530/1196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 247/1443 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 83/1526 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1000 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (OVERLAPS) 0/1000 variables, 0/1526 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1526 constraints, problems are : Problem set: 0 solved, 83 unsolved in 29159 ms.
Refiners :[Domain max(s): 530/530 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 530/530 constraints, ReadFeed: 247/247 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 47577ms problems are : Problem set: 0 solved, 83 unsolved
Parikh walk visited 42 properties in 13497 ms.
Support contains 82 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 470/470 transitions.
Free-agglomeration rule applied 68 times.
Iterating global reduction 0 with 68 rules applied. Total rules applied 68 place count 530 transition count 402
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 0 with 68 rules applied. Total rules applied 136 place count 462 transition count 402
Applied a total of 136 rules in 65 ms. Remains 462 /530 variables (removed 68) and now considering 402/470 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 462/530 places, 402/470 transitions.
RANDOM walk for 4000000 steps (8 resets) in 38506 ms. (103 steps per ms) remains 35/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1381 ms. (289 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1812 ms. (220 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1617 ms. (247 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1366 ms. (292 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1397 ms. (286 steps per ms) remains 31/33 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1342 ms. (297 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1337 ms. (298 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1342 ms. (297 steps per ms) remains 29/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1331 ms. (300 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1327 ms. (301 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1393 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1377 ms. (290 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1329 ms. (300 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1322 ms. (302 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1323 ms. (302 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1328 ms. (300 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1329 ms. (300 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1383 ms. (289 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1340 ms. (298 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1330 ms. (300 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1360 ms. (293 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1378 ms. (290 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1353 ms. (295 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1295 ms. (308 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1338 ms. (298 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1287 ms. (310 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1347 ms. (296 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1362 ms. (293 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1352 ms. (295 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1360 ms. (293 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1366 ms. (292 steps per ms) remains 27/27 properties
// Phase 1: matrix 402 rows 462 cols
[2024-05-27 13:03:03] [INFO ] Computed 136 invariants in 4 ms
[2024-05-27 13:03:03] [INFO ] State equation strengthened by 315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 181/235 variables, 32/86 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 181/267 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 227/462 variables, 104/371 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 227/598 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 402/864 variables, 462/1060 constraints. Problems are: Problem set: 0 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/864 variables, 315/1375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/864 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/864 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 864/864 variables, and 1375 constraints, problems are : Problem set: 0 solved, 27 unsolved in 2717 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 462/462 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 181/235 variables, 32/86 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 181/267 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 227/462 variables, 104/371 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 227/598 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 402/864 variables, 462/1060 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/864 variables, 315/1375 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/864 variables, 27/1402 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/864 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 0/864 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 864/864 variables, and 1402 constraints, problems are : Problem set: 0 solved, 27 unsolved in 4461 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 462/462 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 7216ms problems are : Problem set: 0 solved, 27 unsolved
Parikh walk visited 3 properties in 2363 ms.
Support contains 48 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 402/402 transitions.
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 462 transition count 385
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 34 place count 445 transition count 385
Applied a total of 34 rules in 57 ms. Remains 445 /462 variables (removed 17) and now considering 385/402 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 445/462 places, 385/402 transitions.
RANDOM walk for 4000000 steps (8 resets) in 30357 ms. (131 steps per ms) remains 13/24 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 11837 ms. (337 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 12035 ms. (332 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 11521 ms. (347 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 11470 ms. (348 steps per ms) remains 9/11 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 11116 ms. (359 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 11150 ms. (358 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 11054 ms. (361 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10934 ms. (365 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10911 ms. (366 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10902 ms. (366 steps per ms) remains 6/7 properties
// Phase 1: matrix 385 rows 445 cols
[2024-05-27 13:03:49] [INFO ] Computed 136 invariants in 3 ms
[2024-05-27 13:03:49] [INFO ] State equation strengthened by 332 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 109/121 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 109/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 324/445 variables, 127/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 324/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 385/830 variables, 445/1026 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 332/1358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/830 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/830 variables, 0/1358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 1358 constraints, problems are : Problem set: 0 solved, 6 unsolved in 868 ms.
Refiners :[Domain max(s): 445/445 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 445/445 constraints, ReadFeed: 332/332 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 109/121 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 109/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 324/445 variables, 127/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 324/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 385/830 variables, 445/1026 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 332/1358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/830 variables, 6/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/830 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/830 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 1364 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1120 ms.
Refiners :[Domain max(s): 445/445 constraints, Positive P Invariants (semi-flows): 136/136 constraints, State Equation: 445/445 constraints, ReadFeed: 332/332 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 2011ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 1668 ms.
Support contains 4 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 385/385 transitions.
Free-agglomeration rule applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 445 transition count 363
Reduce places removed 22 places and 0 transitions.
Graph (complete) has 858 edges and 423 vertex of which 178 are kept as prefixes of interest. Removing 245 places using SCC suffix rule.3 ms
Discarding 245 places :
Also discarding 180 output transitions
Drop transitions (Output transitions of discarded places.) removed 180 transitions
Iterating post reduction 0 with 23 rules applied. Total rules applied 45 place count 178 transition count 183
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 75 place count 178 transition count 153
Applied a total of 75 rules in 54 ms. Remains 178 /445 variables (removed 267) and now considering 153/385 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 178/445 places, 153/385 transitions.
RANDOM walk for 595 steps (0 resets) in 12 ms. (45 steps per ms) remains 0/2 properties
Able to resolve query QuasiLiveness after proving 328 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 190249 ms.
ITS solved all properties within timeout
BK_STOP 1716815033528
--------------------
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="Parking-PT-832"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Parking-PT-832, 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 r276-smll-171654415900057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-832.tgz
mv Parking-PT-832 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 ;