About the Execution of LTSMin+red for ShieldIIPt-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 709.275 | 147189.00 | 454407.00 | 186.90 | 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.r530-tall-171683778800192.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPt-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683778800192
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 22:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 22:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K 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 1717223599180
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:33:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 06:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:33:20] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-06-01 06:33:20] [INFO ] Transformed 763 places.
[2024-06-01 06:33:20] [INFO ] Transformed 563 transitions.
[2024-06-01 06:33:20] [INFO ] Found NUPN structural information;
[2024-06-01 06:33:20] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 255 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 763/763 places, 563/563 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 763 transition count 561
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 761 transition count 560
Applied a total of 5 rules in 83 ms. Remains 761 /763 variables (removed 2) and now considering 560/563 (removed 3) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-06-01 06:33:20] [INFO ] Computed 361 invariants in 27 ms
[2024-06-01 06:33:21] [INFO ] Implicit Places using invariants in 667 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 699 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 759/763 places, 560/563 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 23 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-06-01 06:33:21] [INFO ] Computed 359 invariants in 7 ms
[2024-06-01 06:33:21] [INFO ] Implicit Places using invariants in 378 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 757/763 places, 559/563 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 20 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-06-01 06:33:21] [INFO ] Computed 358 invariants in 3 ms
[2024-06-01 06:33:22] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 06:33:22] [INFO ] Invariant cache hit.
[2024-06-01 06:33:22] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 756/763 places, 558/563 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 2359 ms. Remains : 756/763 places, 558/563 transitions.
Discarding 159 transitions out of 558. Remains 399
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2844 ms. (14 steps per ms) remains 242/398 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 30 ms. (13 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 242/242 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 242/242 properties
BEST_FIRST walk for 400 steps (8 resets) in 15 ms. (25 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 22 ms. (17 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 242/242 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 242/242 properties
[2024-06-01 06:33:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 462/462 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 10/472 variables, 223/685 constraints. Problems are: Problem set: 0 solved, 242 unsolved
(s432 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.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 0.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.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 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 1.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 1.0)
(s432 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 10/695 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1314 variables, and 695 constraints, problems are : Problem set: 0 solved, 242 unsolved in 5030 ms.
Refiners :[Domain max(s): 472/756 constraints, Positive P Invariants (semi-flows): 223/358 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 462/462 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 10/472 variables, 223/685 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 10/695 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 284/756 variables, 135/830 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 284/1114 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/1314 variables, and 1114 constraints, problems are : Problem set: 0 solved, 242 unsolved in 5010 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 0/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 10216ms problems are : Problem set: 0 solved, 242 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 462 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 756 transition count 558
Applied a total of 31 rules in 68 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 4000000 steps (8 resets) in 63010 ms. (63 steps per ms) remains 41/242 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2077 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2066 ms. (193 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2078 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2087 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2068 ms. (193 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2159 ms. (185 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2085 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2086 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2072 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2068 ms. (193 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2065 ms. (193 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2096 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2105 ms. (189 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2135 ms. (187 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2156 ms. (185 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2136 ms. (187 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2129 ms. (187 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2107 ms. (189 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2121 ms. (188 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2117 ms. (188 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2153 ms. (185 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2119 ms. (188 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2078 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2094 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2084 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2092 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2092 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2069 ms. (193 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2083 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2103 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2091 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2095 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2065 ms. (193 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2084 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2070 ms. (193 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2074 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2074 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2082 ms. (192 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2105 ms. (189 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2092 ms. (191 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2106 ms. (189 steps per ms) remains 41/41 properties
// Phase 1: matrix 558 rows 756 cols
[2024-06-01 06:34:15] [INFO ] Computed 358 invariants in 3 ms
[2024-06-01 06:34:15] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 19/102 variables, 48/131 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 19/150 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 654/756 variables, 310/460 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 654/1114 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 41 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 17/1887 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1887 constraints, problems are : Problem set: 0 solved, 41 unsolved in 3128 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 19/102 variables, 48/131 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 19/150 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 654/756 variables, 310/460 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 654/1114 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 17/1887 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 41/1928 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1314 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/1314 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1928 constraints, problems are : Problem set: 0 solved, 41 unsolved in 5964 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 9138ms problems are : Problem set: 0 solved, 41 unsolved
Fused 41 Parikh solutions to 39 different solutions.
Parikh walk visited 0 properties in 18174 ms.
Support contains 83 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 756 transition count 558
Applied a total of 39 rules in 65 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 4000000 steps (8 resets) in 47240 ms. (84 steps per ms) remains 7/41 properties
BEST_FIRST walk for 3954078 steps (8 resets) in 19610 ms. (201 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3767486 steps (8 resets) in 20004 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3871342 steps (8 resets) in 19965 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3938457 steps (8 resets) in 19726 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3966121 steps (8 resets) in 19789 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 3948578 steps (8 resets) in 19888 ms. (198 steps per ms) remains 4/7 properties
// Phase 1: matrix 558 rows 756 cols
[2024-06-01 06:35:26] [INFO ] Computed 358 invariants in 4 ms
[2024-06-01 06:35:26] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 744/756 variables, 353/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 744/1114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 36/1906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1906 constraints, problems are : Problem set: 0 solved, 4 unsolved in 554 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 744/756 variables, 353/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 744/1114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 36/1906 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 4/1910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1314 variables, 0/1910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/1314 variables, 0/1910 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1910 constraints, problems are : Problem set: 0 solved, 4 unsolved in 972 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1550ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6609 ms.
Support contains 8 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 756 transition count 558
Applied a total of 7 rules in 43 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 3473533 steps (7 resets) in 33775 ms. (102 steps per ms) remains 0/4 properties
Able to resolve query QuasiLiveness after proving 399 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 145980 ms.
ITS solved all properties within timeout
BK_STOP 1717223746369
--------------------
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="ShieldIIPt-PT-040A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-040A, 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 r530-tall-171683778800192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A 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 ;