About the Execution of LTSMin+red for ShieldPPPt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7627.848 | 448972.00 | 939996.00 | 879.40 | 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-171683779300407.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 ShieldPPPt-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683779300407
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1016K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 569K 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 1717225823184
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:10:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 07:10:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:10:24] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2024-06-01 07:10:24] [INFO ] Transformed 2343 places.
[2024-06-01 07:10:24] [INFO ] Transformed 2133 transitions.
[2024-06-01 07:10:24] [INFO ] Found NUPN structural information;
[2024-06-01 07:10:24] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 467 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 573 transitions
Trivial Post-agglo rules discarded 573 transitions
Performed 573 trivial Post agglomeration. Transition count delta: 573
Iterating post reduction 0 with 573 rules applied. Total rules applied 573 place count 2343 transition count 1560
Reduce places removed 573 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 575 rules applied. Total rules applied 1148 place count 1770 transition count 1558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1149 place count 1769 transition count 1558
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 1149 place count 1769 transition count 1438
Deduced a syphon composed of 120 places in 17 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 1389 place count 1649 transition count 1438
Performed 809 Post agglomeration using F-continuation condition.Transition count delta: 809
Deduced a syphon composed of 809 places in 3 ms
Reduce places removed 809 places and 0 transitions.
Iterating global reduction 3 with 1618 rules applied. Total rules applied 3007 place count 840 transition count 629
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 3185 place count 751 transition count 629
Applied a total of 3185 rules in 362 ms. Remains 751 /2343 variables (removed 1592) and now considering 629/2133 (removed 1504) transitions.
// Phase 1: matrix 629 rows 751 cols
[2024-06-01 07:10:25] [INFO ] Computed 331 invariants in 27 ms
[2024-06-01 07:10:26] [INFO ] Implicit Places using invariants in 713 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 744 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 750/2343 places, 629/2133 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 627
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 627
Applied a total of 4 rules in 16 ms. Remains 748 /750 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 748 cols
[2024-06-01 07:10:26] [INFO ] Computed 330 invariants in 5 ms
[2024-06-01 07:10:26] [INFO ] Implicit Places using invariants in 462 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 464 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 746/2343 places, 627/2133 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 625
Applied a total of 4 rules in 24 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2024-06-01 07:10:26] [INFO ] Computed 328 invariants in 7 ms
[2024-06-01 07:10:26] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-06-01 07:10:26] [INFO ] Invariant cache hit.
[2024-06-01 07:10:27] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-06-01 07:10:30] [INFO ] Implicit Places using invariants and state equation in 3696 ms returned []
Implicit Place search using SMT with State Equation took 4141 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 744/2343 places, 625/2133 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 5767 ms. Remains : 744/2343 places, 625/2133 transitions.
Discarding 208 transitions out of 625. Remains 417
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 4189 ms. (9 steps per ms) remains 183/416 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 183/183 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 183/183 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 183/183 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 183/183 properties
[2024-06-01 07:10:32] [INFO ] Invariant cache hit.
[2024-06-01 07:10:32] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 7/338 variables, 149/480 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/1369 variables, and 487 constraints, problems are : Problem set: 0 solved, 183 unsolved in 5016 ms.
Refiners :[Domain max(s): 338/744 constraints, Positive P Invariants (semi-flows): 149/328 constraints, State Equation: 0/744 constraints, ReadFeed: 0/208 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/331 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 7/338 variables, 149/480 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 7/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 406/744 variables, 179/666 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 406/1072 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 183 unsolved
SMT process timed out in 10250ms, After SMT, problems are : Problem set: 0 solved, 183 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 331 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 625/625 transitions.
Partial Free-agglomeration rule applied 48 times.
Drop transitions (Partial Free agglomeration) removed 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 744 transition count 625
Applied a total of 48 rules in 78 ms. Remains 744 /744 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 744/744 places, 625/625 transitions.
RANDOM walk for 4000000 steps (8 resets) in 69041 ms. (57 steps per ms) remains 41/183 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1764 ms. (226 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1764 ms. (226 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1725 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1737 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1767 ms. (226 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1768 ms. (226 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1751 ms. (228 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1748 ms. (228 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1723 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1704 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1729 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1760 ms. (227 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1739 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1751 ms. (228 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1766 ms. (226 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1754 ms. (227 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1720 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1741 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1752 ms. (228 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1747 ms. (228 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1737 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1692 ms. (236 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1685 ms. (237 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1698 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1682 ms. (237 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1713 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1721 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1691 ms. (236 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1708 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1712 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1703 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1708 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1684 ms. (237 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1695 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1695 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1704 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1693 ms. (236 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1698 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1703 ms. (234 steps per ms) remains 41/41 properties
// Phase 1: matrix 625 rows 744 cols
[2024-06-01 07:11:22] [INFO ] Computed 328 invariants in 4 ms
[2024-06-01 07:11:22] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/80 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 664/744 variables, 293/408 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 664/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 41 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 208/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/1369 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 2024 constraints, problems are : Problem set: 0 solved, 41 unsolved in 4538 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 208/208 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/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/80 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 664/744 variables, 293/408 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 664/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 208/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 41/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/1369 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 2065 constraints, problems are : Problem set: 0 solved, 41 unsolved in 15252 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 19838ms problems are : Problem set: 0 solved, 41 unsolved
Fused 41 Parikh solutions to 35 different solutions.
Parikh walk visited 0 properties in 12935 ms.
Support contains 75 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 625/625 transitions.
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 744 transition count 625
Applied a total of 30 rules in 58 ms. Remains 744 /744 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 744/744 places, 625/625 transitions.
RANDOM walk for 4000000 steps (9 resets) in 39791 ms. (100 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2179 ms. (183 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2009 ms. (199 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2016 ms. (198 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1730 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1736 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1724 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1710 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1706 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1713 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1719 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1719 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1704 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1735 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1722 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1723 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1725 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1729 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1726 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1710 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1701 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1714 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1710 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1725 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1727 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1726 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1745 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1730 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1718 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1741 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1720 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1737 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1707 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1715 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1711 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1697 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1708 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1715 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1702 ms. (234 steps per ms) remains 41/41 properties
Interrupted probabilistic random walk after 2685682 steps, run timeout after 87001 ms. (steps per millisecond=30 ) properties seen :0 out of 41
Probabilistic random walk after 2685682 steps, saw 2297104 distinct states, run finished after 87007 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 625 rows 744 cols
[2024-06-01 07:13:51] [INFO ] Computed 328 invariants in 3 ms
[2024-06-01 07:13:51] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/80 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 664/744 variables, 293/408 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 664/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 41 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 208/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/1369 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 2024 constraints, problems are : Problem set: 0 solved, 41 unsolved in 4623 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 208/208 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/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/80 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 664/744 variables, 293/408 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 664/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 208/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 41/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/1369 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 2065 constraints, problems are : Problem set: 0 solved, 41 unsolved in 11622 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 16275ms problems are : Problem set: 0 solved, 41 unsolved
Fused 41 Parikh solutions to 35 different solutions.
Parikh walk visited 0 properties in 10839 ms.
Support contains 75 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 625/625 transitions.
Applied a total of 0 rules in 25 ms. Remains 744 /744 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 744/744 places, 625/625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 625/625 transitions.
Applied a total of 0 rules in 24 ms. Remains 744 /744 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2024-06-01 07:14:18] [INFO ] Invariant cache hit.
[2024-06-01 07:14:18] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-06-01 07:14:18] [INFO ] Invariant cache hit.
[2024-06-01 07:14:19] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-06-01 07:14:22] [INFO ] Implicit Places using invariants and state equation in 3440 ms returned []
Implicit Place search using SMT with State Equation took 3842 ms to find 0 implicit places.
[2024-06-01 07:14:22] [INFO ] Redundant transitions in 38 ms returned []
Running 624 sub problems to find dead transitions.
[2024-06-01 07:14:22] [INFO ] Invariant cache hit.
[2024-06-01 07:14:22] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 5 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:14:45] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:46] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 20/1092 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 5 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/1369 variables, and 1111 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30032 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 0/744 constraints, ReadFeed: 0/208 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 743/743 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (OVERLAPS) 1/744 variables, 328/1071 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 1/1072 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 39/1111 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 4 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 20/1131 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:15:03] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 4/1135 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1879 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 208/2087 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 2711 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30096 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 63/63 constraints]
After SMT, in 60300ms problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64228 ms. Remains : 744/744 places, 625/625 transitions.
RANDOM walk for 400000 steps (8 resets) in 5655 ms. (70 steps per ms) remains 50/75 properties
Running SMT prover for 50 properties.
[2024-06-01 07:15:23] [INFO ] Invariant cache hit.
[2024-06-01 07:15:24] [INFO ] [Real]Absence check using 328 positive place invariants in 44 ms returned sat
[2024-06-01 07:15:24] [INFO ] After 266ms SMT Verify possible using state equation in real domain returned unsat :0 sat :50
[2024-06-01 07:15:24] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-06-01 07:15:25] [INFO ] After 604ms SMT Verify possible using 208 Read/Feed constraints in real domain returned unsat :0 sat :50
TRAPS : Iteration 0
[2024-06-01 07:15:27] [INFO ] After 3483ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:50
[2024-06-01 07:15:27] [INFO ] After 3965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:50
[2024-06-01 07:15:28] [INFO ] [Nat]Absence check using 328 positive place invariants in 43 ms returned sat
[2024-06-01 07:15:28] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :50
[2024-06-01 07:15:28] [INFO ] After 520ms SMT Verify possible using 208 Read/Feed constraints in natural domain returned unsat :0 sat :50
TRAPS : Iteration 0
[2024-06-01 07:15:29] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
TRAPS : Iteration 1
[2024-06-01 07:15:34] [INFO ] After 6102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :50
[2024-06-01 07:15:34] [INFO ] After 7030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :50
RANDOM walk for 4000000 steps (8 resets) in 39831 ms. (100 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1727 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1766 ms. (226 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1737 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1744 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1739 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1738 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1747 ms. (228 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1762 ms. (226 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1741 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1720 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1732 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1714 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1715 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1711 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1721 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1715 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1743 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1714 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1735 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1696 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1740 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1691 ms. (236 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1695 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1688 ms. (236 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1714 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1721 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1727 ms. (231 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1690 ms. (236 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1731 ms. (230 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1743 ms. (229 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1712 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1708 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1709 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1711 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1705 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1703 ms. (234 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1717 ms. (232 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1715 ms. (233 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1755 ms. (227 steps per ms) remains 41/41 properties
Interrupted probabilistic random walk after 2567132 steps, run timeout after 84001 ms. (steps per millisecond=30 ) properties seen :0 out of 41
Probabilistic random walk after 2567132 steps, saw 2194001 distinct states, run finished after 84001 ms. (steps per millisecond=30 ) properties seen :0
[2024-06-01 07:17:27] [INFO ] Invariant cache hit.
[2024-06-01 07:17:27] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/80 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 664/744 variables, 293/408 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 664/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 41 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 208/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/1369 variables, 0/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 2024 constraints, problems are : Problem set: 0 solved, 41 unsolved in 4051 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 208/208 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/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 5/80 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 664/744 variables, 293/408 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 664/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/1072 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 625/1369 variables, 744/1816 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 208/2024 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 41/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/1369 variables, 0/2065 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 2065 constraints, problems are : Problem set: 0 solved, 41 unsolved in 14572 ms.
Refiners :[Domain max(s): 744/744 constraints, Positive P Invariants (semi-flows): 328/328 constraints, State Equation: 744/744 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 18656ms problems are : Problem set: 0 solved, 41 unsolved
Fused 41 Parikh solutions to 37 different solutions.
Finished Parikh walk after 715 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=119 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 41 properties in 6165 ms.
Able to resolve query QuasiLiveness after proving 417 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 447663 ms.
ITS solved all properties within timeout
BK_STOP 1717226272156
--------------------
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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-171683779300407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B 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 ;