About the Execution of GreatSPN+red for PolyORBLF-PT-S02J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2511.768 | 174763.00 | 297879.00 | 70.30 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r298-tajo-171654455000157.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J06T08, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tajo-171654455000157
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K 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 1717103782892
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 21:16:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-30 21:16:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 21:16:24] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-05-30 21:16:24] [INFO ] Transformed 690 places.
[2024-05-30 21:16:24] [INFO ] Transformed 1434 transitions.
[2024-05-30 21:16:24] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 272 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 690/690 places, 1434/1434 transitions.
Ensure Unique test removed 2 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 274 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 274 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 5 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 434 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 5 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 562 place count 472 transition count 1090
Applied a total of 562 rules in 142 ms. Remains 472 /690 variables (removed 218) and now considering 1090/1434 (removed 344) transitions.
Running 1088 sub problems to find dead transitions.
[2024-05-30 21:16:24] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 472 cols
[2024-05-30 21:16:24] [INFO ] Computed 52 invariants in 54 ms
[2024-05-30 21:16:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-30 21:16:34] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 14 ms to minimize.
[2024-05-30 21:16:34] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-05-30 21:16:34] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-30 21:16:35] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
[2024-05-30 21:16:35] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
[2024-05-30 21:16:35] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-30 21:16:35] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-30 21:16:35] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-30 21:16:35] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 3 ms to minimize.
[2024-05-30 21:16:36] [INFO ] Deduced a trap composed of 170 places in 226 ms of which 3 ms to minimize.
[2024-05-30 21:16:36] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 2 ms to minimize.
[2024-05-30 21:16:36] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 2 ms to minimize.
[2024-05-30 21:16:36] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 2 ms to minimize.
[2024-05-30 21:16:38] [INFO ] Deduced a trap composed of 79 places in 264 ms of which 3 ms to minimize.
[2024-05-30 21:16:38] [INFO ] Deduced a trap composed of 172 places in 269 ms of which 3 ms to minimize.
[2024-05-30 21:16:41] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 3 ms to minimize.
[2024-05-30 21:16:43] [INFO ] Deduced a trap composed of 158 places in 265 ms of which 4 ms to minimize.
[2024-05-30 21:16:45] [INFO ] Deduced a trap composed of 191 places in 255 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1546 variables, and 68 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-05-30 21:17:01] [INFO ] Deduced a trap composed of 298 places in 275 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 9)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 9)
(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 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/1546 variables, and 69 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 19/19 constraints]
After SMT, in 41952ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 41990ms
[2024-05-30 21:17:06] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-05-30 21:17:06] [INFO ] Invariant cache hit.
[2024-05-30 21:17:07] [INFO ] Implicit Places using invariants in 592 ms returned [44, 120, 201, 239, 320, 336, 393, 399]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 603 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 464/690 places, 1090/1434 transitions.
Applied a total of 0 rules in 9 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 42804 ms. Remains : 464/690 places, 1090/1434 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (19 resets) in 3553 ms. (11 steps per ms) remains 130/1088 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 31 ms. (12 steps per ms) remains 130/130 properties
BEST_FIRST walk for 400 steps (8 resets) in 25 ms. (15 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 16 ms. (23 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 130/130 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 130/130 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 130/130 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 130/130 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 130/130 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 130/130 properties
[2024-05-30 21:17:08] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2024-05-30 21:17:08] [INFO ] Computed 44 invariants in 32 ms
[2024-05-30 21:17:08] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 317/373 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-30 21:17:09] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-30 21:17:09] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 2 ms to minimize.
[2024-05-30 21:17:10] [INFO ] Deduced a trap composed of 169 places in 155 ms of which 2 ms to minimize.
[2024-05-30 21:17:10] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2024-05-30 21:17:10] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 3 ms to minimize.
[2024-05-30 21:17:10] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 18/391 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
(s395 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s17 0.0)
(s18 0.0)
(s19 8.0)
(s20 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s41 0.0)
(s42 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s50 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s106 0.0)
(s107 1.0)
(s109 0.0)
(s110 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s118 0.0)
(s119 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 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)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s177 0.0)
(s178 2.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s185 0.0)
(s186 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 1.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 0.0)
(s212 0.0)
(s214 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 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)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s242 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s249 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 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 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)
(s283 0.0)
(s284 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s313 0.0)
(s314 0.0)
(s316 1.0)
(s317 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s325 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.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)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s354 0.0)
(s355 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s363 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 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)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s388 0.0)
(s389 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 1.0)
(s395 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/1538 variables, and 18 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/17 constraints, Generalized P Invariants (flows): 2/27 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 317/373 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-30 21:17:16] [INFO ] Deduced a trap composed of 172 places in 193 ms of which 3 ms to minimize.
[2024-05-30 21:17:16] [INFO ] Deduced a trap composed of 169 places in 187 ms of which 3 ms to minimize.
[2024-05-30 21:17:16] [INFO ] Deduced a trap composed of 172 places in 191 ms of which 3 ms to minimize.
[2024-05-30 21:17:16] [INFO ] Deduced a trap composed of 175 places in 169 ms of which 3 ms to minimize.
[2024-05-30 21:17:16] [INFO ] Deduced a trap composed of 177 places in 166 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-30 21:17:19] [INFO ] Deduced a trap composed of 277 places in 189 ms of which 3 ms to minimize.
SMT process timed out in 10440ms, After SMT, problems are : Problem set: 0 solved, 130 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 460 transition count 1086
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 460 transition count 1086
Applied a total of 8 rules in 88 ms. Remains 460 /464 variables (removed 4) and now considering 1086/1090 (removed 4) transitions.
Running 1084 sub problems to find dead transitions.
[2024-05-30 21:17:19] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
// Phase 1: matrix 1070 rows 460 cols
[2024-05-30 21:17:19] [INFO ] Computed 44 invariants in 36 ms
[2024-05-30 21:17:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-05-30 21:17:27] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-05-30 21:17:28] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-30 21:17:28] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-30 21:17:28] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-30 21:17:28] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-30 21:17:28] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 4 ms to minimize.
[2024-05-30 21:17:28] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 3 ms to minimize.
[2024-05-30 21:17:29] [INFO ] Deduced a trap composed of 159 places in 245 ms of which 3 ms to minimize.
[2024-05-30 21:17:29] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-05-30 21:17:29] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-30 21:17:29] [INFO ] Deduced a trap composed of 274 places in 231 ms of which 3 ms to minimize.
[2024-05-30 21:17:30] [INFO ] Deduced a trap composed of 175 places in 195 ms of which 3 ms to minimize.
[2024-05-30 21:17:30] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 3 ms to minimize.
[2024-05-30 21:17:32] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 3 ms to minimize.
[2024-05-30 21:17:32] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 4 ms to minimize.
[2024-05-30 21:17:33] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 2 ms to minimize.
[2024-05-30 21:17:36] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 3 ms to minimize.
[2024-05-30 21:17:37] [INFO ] Deduced a trap composed of 280 places in 266 ms of which 3 ms to minimize.
[2024-05-30 21:17:37] [INFO ] Deduced a trap composed of 284 places in 266 ms of which 4 ms to minimize.
[2024-05-30 21:17:38] [INFO ] Deduced a trap composed of 184 places in 273 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 62 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-05-30 21:17:47] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 3 ms to minimize.
[2024-05-30 21:17:52] [INFO ] Deduced a trap composed of 284 places in 262 ms of which 3 ms to minimize.
[2024-05-30 21:17:58] [INFO ] Deduced a trap composed of 178 places in 261 ms of which 4 ms to minimize.
[2024-05-30 21:17:59] [INFO ] Deduced a trap composed of 177 places in 191 ms of which 3 ms to minimize.
[2024-05-30 21:17:59] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 67 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 25/25 constraints]
After SMT, in 41934ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 41948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42041 ms. Remains : 460/464 places, 1086/1090 transitions.
RANDOM walk for 4000000 steps (1617 resets) in 56148 ms. (71 steps per ms) remains 128/130 properties
BEST_FIRST walk for 40004 steps (9 resets) in 256 ms. (155 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (12 resets) in 235 ms. (169 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (9 resets) in 239 ms. (166 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 232 ms. (171 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (9 resets) in 235 ms. (169 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 231 ms. (172 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 224 ms. (177 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 229 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (10 resets) in 225 ms. (177 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 227 ms. (175 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (14 resets) in 232 ms. (171 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 231 ms. (172 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (8 resets) in 229 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 229 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 247 ms. (161 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (16 resets) in 227 ms. (175 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (12 resets) in 233 ms. (170 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 232 ms. (171 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (10 resets) in 227 ms. (175 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (10 resets) in 226 ms. (176 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 226 ms. (176 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (13 resets) in 227 ms. (175 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 228 ms. (174 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (10 resets) in 221 ms. (180 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 226 ms. (176 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 224 ms. (177 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (14 resets) in 230 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (9 resets) in 224 ms. (177 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (15 resets) in 224 ms. (177 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 223 ms. (178 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 235 ms. (169 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 229 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 226 ms. (176 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 221 ms. (180 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (11 resets) in 227 ms. (175 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (13 resets) in 229 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (13 resets) in 233 ms. (170 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (8 resets) in 217 ms. (183 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 230 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 227 ms. (175 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (11 resets) in 229 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 230 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (10 resets) in 230 ms. (173 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (12 resets) in 228 ms. (174 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 231 ms. (172 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 222 ms. (179 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 235 ms. (169 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (9 resets) in 242 ms. (164 steps per ms) remains 128/128 properties
Interrupted probabilistic random walk after 1377366 steps, run timeout after 54001 ms. (steps per millisecond=25 ) properties seen :0 out of 128
Probabilistic random walk after 1377366 steps, saw 762184 distinct states, run finished after 54010 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-30 21:19:13] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-05-30 21:19:13] [INFO ] Invariant cache hit.
[2024-05-30 21:19:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 143/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-30 21:19:14] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 102/298 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 6/304 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem qltransition_1 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 3899ms, After SMT, problems are : Problem set: 0 solved, 128 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 64 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 460/460 places, 1086/1086 transitions.
Total runtime 173029 ms.
ITS solved all properties within timeout
BK_STOP 1717103957655
--------------------
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="PolyORBLF-PT-S02J06T08"
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 PolyORBLF-PT-S02J06T08, 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 r298-tajo-171654455000157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 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 ;