Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200471.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J60, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717260545517

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:49:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:49:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:49:07] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-06-01 16:49:07] [INFO ] Transformed 909 places.
[2024-06-01 16:49:07] [INFO ] Transformed 1970 transitions.
[2024-06-01 16:49:07] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:49:07] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 16:49:07] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 16:49:07] [INFO ] Reduced 555 identical enabling conditions.
[2024-06-01 16:49:07] [INFO ] Reduced 90 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2765 resets) in 2561 ms. (15 steps per ms) remains 12/16 properties
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (997 resets) in 1946 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (886 resets) in 2110 ms. (18 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (472 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (53 resets) in 2296 ms. (17 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (486 resets) in 565 ms. (70 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1101 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (440 resets) in 226 ms. (176 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (34 resets) in 255 ms. (156 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (48 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (160 resets) in 414 ms. (96 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (56 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
[2024-06-01 16:49:10] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-06-01 16:49:10] [INFO ] Computed 142 invariants in 91 ms
[2024-06-01 16:49:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/797 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/797 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 105/902 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/902 variables, 19/137 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/902 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 7/909 variables, 5/142 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/909 variables, 0/142 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1311/2220 variables, 909/1051 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2220 variables, 1/1052 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2220 variables, 0/1052 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2220 variables, 0/1052 constraints. Problems are: Problem set: 9 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2220/2220 variables, and 1052 constraints, problems are : Problem set: 9 solved, 3 unsolved in 3951 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 1/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 224/569 variables, 51/53 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 1/54 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 0/54 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 230/799 variables, 46/100 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/799 variables, 0/100 constraints. Problems are: Problem set: 9 solved, 3 unsolved
Problem PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 97/896 variables, 29/129 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/896 variables, 0/129 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/909 variables, 13/142 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-01 16:49:18] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 23 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/909 variables, 1/143 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/909 variables, 0/143 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1311/2220 variables, 909/1052 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2220 variables, 1/1053 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2220 variables, 2/1055 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2220 variables, 0/1055 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2220 variables, 0/1055 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 1055 constraints, problems are : Problem set: 10 solved, 2 unsolved in 3775 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 10666ms problems are : Problem set: 10 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 904 transition count 1251
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 133 place count 840 transition count 1251
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 133 place count 840 transition count 1186
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 263 place count 775 transition count 1186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 264 place count 774 transition count 1185
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 774 transition count 1185
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 2 with 4 rules applied. Total rules applied 269 place count 772 transition count 1183
Applied a total of 269 rules in 382 ms. Remains 772 /909 variables (removed 137) and now considering 1183/1315 (removed 132) transitions.
Running 1177 sub problems to find dead transitions.
[2024-06-01 16:49:21] [INFO ] Flow matrix only has 1179 transitions (discarded 4 similar events)
// Phase 1: matrix 1179 rows 772 cols
[2024-06-01 16:49:21] [INFO ] Computed 137 invariants in 87 ms
[2024-06-01 16:49:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 767/1951 variables, and 132 constraints, problems are : Problem set: 0 solved, 1177 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1177/1177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/767 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/767 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1177 unsolved
[2024-06-01 16:49:47] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 16:50:03] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/1951 variables, and 134 constraints, problems are : Problem set: 0 solved, 1177 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1177 constraints, Known Traps: 2/2 constraints]
After SMT, in 43399ms problems are : Problem set: 0 solved, 1177 unsolved
Search for dead transitions found 0 dead transitions in 43420ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43838 ms. Remains : 772/909 places, 1183/1315 transitions.
RANDOM walk for 40001 steps (2088 resets) in 696 ms. (57 steps per ms) remains 1/2 properties
FORMULA PolyORBNT-PT-S05J60-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (125 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2024-06-01 16:50:05] [INFO ] Flow matrix only has 1179 transitions (discarded 4 similar events)
[2024-06-01 16:50:05] [INFO ] Invariant cache hit.
[2024-06-01 16:50:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 403/740 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/771 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1179/1950 variables, 771/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1950 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1951 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1951 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1951 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1951/1951 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 772/772 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 336/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 403/740 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/771 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1179/1950 variables, 771/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1950 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:50:07] [INFO ] Deduced a trap composed of 194 places in 445 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1950 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1950 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/1951 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1951 variables, 1/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1951 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1951 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1951/1951 variables, and 912 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1368 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 772/772 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2629ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 772 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 772/772 places, 1183/1183 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 772 transition count 1181
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1181
Applied a total of 4 rules in 61 ms. Remains 770 /772 variables (removed 2) and now considering 1181/1183 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 770/772 places, 1181/1183 transitions.
RANDOM walk for 40000 steps (2057 resets) in 720 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (115 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 153829 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 153829 steps, saw 45173 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 16:50:11] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-06-01 16:50:11] [INFO ] Computed 137 invariants in 55 ms
[2024-06-01 16:50:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 331/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/738 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/738 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/769 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1947 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 45 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-06-01 16:50:14] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:50:14] [INFO ] Invariant cache hit.
[2024-06-01 16:50:16] [INFO ] Implicit Places using invariants in 1730 ms returned []
[2024-06-01 16:50:16] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:50:16] [INFO ] Invariant cache hit.
[2024-06-01 16:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:50:30] [INFO ] Implicit Places using invariants and state equation in 14887 ms returned []
Implicit Place search using SMT with State Equation took 16645 ms to find 0 implicit places.
[2024-06-01 16:50:31] [INFO ] Redundant transitions in 84 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-06-01 16:50:31] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-06-01 16:50:31] [INFO ] Invariant cache hit.
[2024-06-01 16:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-06-01 16:50:54] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 6 ms to minimize.
[2024-06-01 16:50:58] [INFO ] Deduced a trap composed of 191 places in 254 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 134 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 21/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-06-01 16:51:06] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 135 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 21/26 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 3/3 constraints]
After SMT, in 63037ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 63048ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79826 ms. Remains : 770/770 places, 1181/1181 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1176
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1176
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1175
Applied a total of 8 rules in 87 ms. Remains 768 /770 variables (removed 2) and now considering 1175/1181 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1175 rows 768 cols
[2024-06-01 16:51:34] [INFO ] Computed 137 invariants in 48 ms
[2024-06-01 16:51:34] [INFO ] [Real]Absence check using 111 positive place invariants in 18 ms returned sat
[2024-06-01 16:51:34] [INFO ] [Real]Absence check using 111 positive and 26 generalized place invariants in 46 ms returned sat
[2024-06-01 16:51:34] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:51:34] [INFO ] [Nat]Absence check using 111 positive place invariants in 22 ms returned sat
[2024-06-01 16:51:34] [INFO ] [Nat]Absence check using 111 positive and 26 generalized place invariants in 40 ms returned sat
[2024-06-01 16:51:35] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:51:35] [INFO ] Deduced a trap composed of 187 places in 651 ms of which 6 ms to minimize.
[2024-06-01 16:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 760 ms
TRAPS : Iteration 1
[2024-06-01 16:51:36] [INFO ] After 1488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:51:36] [INFO ] After 1706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2107 ms.
[2024-06-01 16:51:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 16:51:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1181 transitions and 6204 arcs took 13 ms.
[2024-06-01 16:51:36] [INFO ] Flatten gal took : 167 ms
Total runtime 149758 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04

BK_STOP 1717260696899

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name PolyORBNT-PT-S05J60-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/608/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 PolyORBNT-PT-S05J60, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447200471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;