About the Execution of LTSMin+red for AutonomousCar-PT-09a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10273.172 | 162738.00 | 487780.00 | 347.50 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r470-smll-171620175800217.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 AutonomousCar-PT-09a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r470-smll-171620175800217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 781K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1717194474063
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutonomousCar-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:27:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-31 22:27:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:27:57] [INFO ] Load time of PNML (sax parser for PT used): 598 ms
[2024-05-31 22:27:57] [INFO ] Transformed 89 places.
[2024-05-31 22:27:57] [INFO ] Transformed 1249 transitions.
[2024-05-31 22:27:57] [INFO ] Found NUPN structural information;
[2024-05-31 22:27:57] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 890 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 89/89 places, 1249/1249 transitions.
Ensure Unique test removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 89 transition count 894
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 365 place count 79 transition count 894
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 369 place count 77 transition count 892
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 371 place count 76 transition count 892
Applied a total of 371 rules in 206 ms. Remains 76 /89 variables (removed 13) and now considering 892/1249 (removed 357) transitions.
[2024-05-31 22:27:57] [INFO ] Flow matrix only has 891 transitions (discarded 1 similar events)
// Phase 1: matrix 891 rows 76 cols
[2024-05-31 22:27:57] [INFO ] Computed 14 invariants in 47 ms
[2024-05-31 22:27:59] [INFO ] Implicit Places using invariants in 1284 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1343 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 75/89 places, 892/1249 transitions.
Applied a total of 0 rules in 12 ms. Remains 75 /75 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1597 ms. Remains : 75/89 places, 892/1249 transitions.
Discarding 49 transitions out of 892. Remains 843
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2549 resets) in 7141 ms. (5 steps per ms) remains 554/842 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 554/554 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 554/554 properties
[2024-05-31 22:28:01] [INFO ] Flow matrix only has 891 transitions (discarded 1 similar events)
// Phase 1: matrix 891 rows 75 cols
[2024-05-31 22:28:01] [INFO ] Computed 13 invariants in 14 ms
[2024-05-31 22:28:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 17/73 variables, 12/68 constraints. Problems are: Problem set: 0 solved, 554 unsolved
SMT process timed out in 18884ms, After SMT, problems are : Problem set: 0 solved, 554 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 56 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 892/892 transitions.
Graph (complete) has 1003 edges and 75 vertex of which 73 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.39 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 267 ms. Remains 73 /75 variables (removed 2) and now considering 890/892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 73/75 places, 890/892 transitions.
RANDOM walk for 3774620 steps (239888 resets) in 120004 ms. (31 steps per ms) remains 51/554 properties
BEST_FIRST walk for 400004 steps (1279 resets) in 950 ms. (420 steps per ms) remains 46/51 properties
BEST_FIRST walk for 400004 steps (1300 resets) in 1065 ms. (375 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1301 resets) in 949 ms. (421 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1265 resets) in 642 ms. (622 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1279 resets) in 633 ms. (630 steps per ms) remains 43/46 properties
BEST_FIRST walk for 400003 steps (1498 resets) in 628 ms. (635 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400004 steps (1473 resets) in 632 ms. (631 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (1473 resets) in 765 ms. (522 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (1303 resets) in 1108 ms. (360 steps per ms) remains 39/41 properties
BEST_FIRST walk for 400004 steps (1284 resets) in 974 ms. (410 steps per ms) remains 37/39 properties
BEST_FIRST walk for 400003 steps (1486 resets) in 673 ms. (593 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (1313 resets) in 666 ms. (599 steps per ms) remains 33/37 properties
BEST_FIRST walk for 400004 steps (1285 resets) in 664 ms. (601 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400004 steps (1291 resets) in 653 ms. (611 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (1313 resets) in 653 ms. (611 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400003 steps (1291 resets) in 626 ms. (637 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1493 resets) in 623 ms. (641 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1494 resets) in 632 ms. (631 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (1475 resets) in 606 ms. (658 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (1276 resets) in 600 ms. (665 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1289 resets) in 603 ms. (662 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1478 resets) in 616 ms. (648 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1371 resets) in 618 ms. (646 steps per ms) remains 26/30 properties
BEST_FIRST walk for 400003 steps (1290 resets) in 629 ms. (634 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (1484 resets) in 653 ms. (611 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (1280 resets) in 649 ms. (615 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (1489 resets) in 654 ms. (610 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (1293 resets) in 617 ms. (647 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (1307 resets) in 623 ms. (641 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (1495 resets) in 655 ms. (609 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (1296 resets) in 645 ms. (619 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (1309 resets) in 632 ms. (631 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (1397 resets) in 637 ms. (626 steps per ms) remains 26/26 properties
// Phase 1: matrix 890 rows 73 cols
[2024-05-31 22:28:57] [INFO ] Computed 11 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 43/67 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 43/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 890/959 variables, 69/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 4/963 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/963 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 963/963 variables, and 157 constraints, problems are : Problem set: 0 solved, 26 unsolved in 4154 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 43/67 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 43/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 2/69 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 890/959 variables, 69/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 4/963 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 26/183 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/963 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/963 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 963/963 variables, and 183 constraints, problems are : Problem set: 0 solved, 26 unsolved in 14589 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 19166ms problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 4449 ms.
Support contains 24 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 890/890 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 73 transition count 889
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 72 transition count 880
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 71 transition count 879
Applied a total of 12 rules in 216 ms. Remains 71 /73 variables (removed 2) and now considering 879/890 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 71/73 places, 879/890 transitions.
RANDOM walk for 4000000 steps (258497 resets) in 49386 ms. (80 steps per ms) remains 21/26 properties
BEST_FIRST walk for 400004 steps (1478 resets) in 472 ms. (845 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (1250 resets) in 478 ms. (835 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (1250 resets) in 529 ms. (754 steps per ms) remains 19/21 properties
BEST_FIRST walk for 400004 steps (1302 resets) in 456 ms. (875 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (1265 resets) in 483 ms. (826 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400003 steps (1490 resets) in 605 ms. (660 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1456 resets) in 600 ms. (665 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1246 resets) in 637 ms. (626 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1279 resets) in 457 ms. (873 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1467 resets) in 445 ms. (896 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (1276 resets) in 464 ms. (860 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1464 resets) in 468 ms. (852 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1277 resets) in 473 ms. (843 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1491 resets) in 463 ms. (862 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (1280 resets) in 465 ms. (858 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (1273 resets) in 463 ms. (862 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (1267 resets) in 473 ms. (843 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (1264 resets) in 529 ms. (754 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (1339 resets) in 465 ms. (858 steps per ms) remains 17/18 properties
// Phase 1: matrix 879 rows 71 cols
[2024-05-31 22:29:36] [INFO ] Computed 11 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 45/65 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 45/75 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 878/943 variables, 65/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 7/950 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/950 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/950 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/950 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/950 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 950/950 variables, and 153 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2265 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 45/65 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 45/75 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 878/943 variables, 65/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 7/950 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/950 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/950 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/950 variables, 17/170 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/950 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 0/950 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 950/950 variables, and 170 constraints, problems are : Problem set: 0 solved, 17 unsolved in 8199 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 10812ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 656 ms.
Support contains 20 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 879/879 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 70 transition count 869
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 869
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 70 transition count 867
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 24 place count 68 transition count 849
Applied a total of 24 rules in 130 ms. Remains 68 /71 variables (removed 3) and now considering 849/879 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 68/71 places, 849/879 transitions.
RANDOM walk for 4000000 steps (216783 resets) in 47839 ms. (83 steps per ms) remains 8/17 properties
BEST_FIRST walk for 4000004 steps (13927 resets) in 4531 ms. (882 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000004 steps (14027 resets) in 4336 ms. (922 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000004 steps (13907 resets) in 4140 ms. (965 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (11863 resets) in 4228 ms. (945 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4000004 steps (11900 resets) in 4172 ms. (958 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (12849 resets) in 4241 ms. (942 steps per ms) remains 3/3 properties
// Phase 1: matrix 849 rows 68 cols
[2024-05-31 22:30:06] [INFO ] Computed 11 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 817/841 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/917 variables, 44/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/917 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 917/917 variables, and 79 constraints, problems are : Problem set: 0 solved, 3 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 817/841 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/917 variables, 44/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/917 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/917 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/917 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/917 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 917/917 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1364 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1955ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 849/849 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 789
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 789
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 62 transition count 783
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 78 place count 56 transition count 729
Applied a total of 78 rules in 103 ms. Remains 56 /68 variables (removed 12) and now considering 729/849 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 56/68 places, 729/849 transitions.
RANDOM walk for 4000000 steps (24932 resets) in 48369 ms. (82 steps per ms) remains 1/3 properties
BEST_FIRST walk for 4000004 steps (18705 resets) in 3943 ms. (1014 steps per ms) remains 1/1 properties
// Phase 1: matrix 729 rows 56 cols
[2024-05-31 22:30:22] [INFO ] Computed 11 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 699/711 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/711 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/785 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/785 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/785 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 785/785 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 699/711 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/711 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 74/785 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/785 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/785 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/785 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 785/785 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 574 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1046ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 729/729 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 709
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 709
Applied a total of 4 rules in 45 ms. Remains 54 /56 variables (removed 2) and now considering 709/729 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 54/56 places, 709/729 transitions.
RANDOM walk for 4000000 steps (24906 resets) in 46880 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (18725 resets) in 4327 ms. (924 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 144525 steps, run visited all 1 properties in 469 ms. (steps per millisecond=308 )
Probabilistic random walk after 144525 steps, saw 21163 distinct states, run finished after 481 ms. (steps per millisecond=300 ) properties seen :1
Able to resolve query QuasiLiveness after proving 843 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 160034 ms.
ITS solved all properties within timeout
BK_STOP 1717194636801
--------------------
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="AutonomousCar-PT-09a"
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 AutonomousCar-PT-09a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r470-smll-171620175800217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09a.tgz
mv AutonomousCar-PT-09a 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 ;