fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r135-tall-171631130400123
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Dekker-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16202.575 3600000.00 11590129.00 4133.30 FFFFFF??TFF??F?F 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.r135-tall-171631130400123.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 greatspnxred
Input is Dekker-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130400123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716334978244

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 23:42:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 23:42:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:43:00] [INFO ] Load time of PNML (sax parser for PT used): 1029 ms
[2024-05-21 23:43:00] [INFO ] Transformed 1000 places.
[2024-05-21 23:43:00] [INFO ] Transformed 40400 transitions.
[2024-05-21 23:43:00] [INFO ] Found NUPN structural information;
[2024-05-21 23:43:00] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1222 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:43:02] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-21 23:43:02] [INFO ] Computed 600 invariants in 49 ms
[2024-05-21 23:43:32] [INFO ] Performed 942/1000 implicitness test of which 179 returned IMPLICIT in 30 seconds.
[2024-05-21 23:43:32] [INFO ] Implicit Places using invariants in 30738 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 979, 982, 985, 988, 991, 994, 997]
Discarding 197 places :
Implicit Place search using SMT only with invariants took 30820 ms to find 197 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 803/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 782 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32850 ms. Remains : 803/1000 places, 40400/40400 transitions.
Support contains 26 out of 803 places after structural reductions.
[2024-05-21 23:43:35] [INFO ] Flatten gal took : 1673 ms
[2024-05-21 23:43:37] [INFO ] Flatten gal took : 1263 ms
[2024-05-21 23:43:39] [INFO ] Input system was already deterministic with 40400 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (8 resets) in 4319 ms. (9 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 3/3 properties
[2024-05-21 23:43:41] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 803 cols
[2024-05-21 23:43:41] [INFO ] Computed 403 invariants in 5 ms
[2024-05-21 23:43:41] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/20 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 20/40 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 390/430 variables, 200/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 978/1408 variables, 588/839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1408 variables, 588/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1408 variables, 192/1619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1408 variables, 0/1619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 195/1603 variables, 198/1817 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1603 variables, 195/2012 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 3/2015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 195/2210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1603 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 2210 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1447 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 11/16 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/20 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 20/40 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 390/430 variables, 200/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 978/1408 variables, 588/839 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1408 variables, 588/1427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1408 variables, 192/1619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1408 variables, 3/1622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1408 variables, 0/1622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 195/1603 variables, 198/1820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 195/2015 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 3/2018 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 195/2213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1603 variables, 0/2213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1603 variables, 0/2213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1603/1603 variables, and 2213 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1916 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3754ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 536 steps, including 40 resets, run visited all 3 properties in 76 ms. (steps per millisecond=7 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 101 ms.
FORMULA Dekker-PT-200-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Dekker-PT-200-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1877 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:43:48] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:43:48] [INFO ] Invariant cache hit.
[2024-05-21 23:43:54] [INFO ] Implicit Places using invariants in 6767 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6837 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1945 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10660 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-02
Product exploration explored 100000 steps with 265 reset in 5735 ms.
Stack based approach found an accepted trace after 134 steps with 0 reset with depth 135 and stack size 134 in 10 ms.
FORMULA Dekker-PT-200-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-02 finished in 16745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1994 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:44:04] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:44:04] [INFO ] Invariant cache hit.
[2024-05-21 23:44:11] [INFO ] Implicit Places using invariants in 6641 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6682 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1840 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10517 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 5437 ms.
Stack based approach found an accepted trace after 263 steps with 0 reset with depth 264 and stack size 264 in 16 ms.
FORMULA Dekker-PT-200-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-03 finished in 16078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)&&p0)))))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 871 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:44:19] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:44:19] [INFO ] Invariant cache hit.
[2024-05-21 23:44:26] [INFO ] Implicit Places using invariants in 6708 ms returned [422]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 6740 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 802/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1100 ms. Remains 802 /802 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8715 ms. Remains : 802/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 5425 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 3 ms.
FORMULA Dekker-PT-200-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-200-LTLCardinality-04 finished in 14397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 853 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:44:34] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:44:34] [INFO ] Invariant cache hit.
[2024-05-21 23:44:40] [INFO ] Implicit Places using invariants in 6603 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6632 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1021 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8507 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-200-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-200-LTLCardinality-05 finished in 8773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1838 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:44:43] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:44:43] [INFO ] Invariant cache hit.
[2024-05-21 23:44:50] [INFO ] Implicit Places using invariants in 6878 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6907 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 2129 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10875 ms. Remains : 800/803 places, 40400/40400 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-200-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 5431 ms.
Product exploration explored 100000 steps with 0 reset in 5811 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (8 resets) in 3055 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 116982 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 6
Probabilistic random walk after 116982 steps, saw 113086 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-21 23:45:10] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-21 23:45:10] [INFO ] Computed 400 invariants in 7 ms
[2024-05-21 23:45:10] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/20 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 20/40 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 390/430 variables, 200/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 975/1405 variables, 585/835 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1405 variables, 585/1420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1405 variables, 195/1615 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1405 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 195/1600 variables, 195/1810 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 195/2005 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1600 variables, 195/2200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1600 variables, 0/2200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1600 variables, 0/2200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1600/1600 variables, and 2200 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1066 ms.
Refiners :[Domain max(s): 800/800 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 800/800 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
Problem apf1 is UNSAT
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
Problem apf3 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 3/23 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 5/20 variables, 5/28 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 5/33 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 20/40 variables, 20/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 390/430 variables, 200/253 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 975/1405 variables, 585/838 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1405 variables, 585/1423 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1405 variables, 195/1618 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1405 variables, 4/1622 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1405 variables, 0/1622 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 195/1600 variables, 195/1817 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1600 variables, 195/2012 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1600 variables, 195/2207 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1600 variables, 0/2207 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1600 variables, 0/2207 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1600/1600 variables, and 2207 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2613 ms.
Refiners :[Domain max(s): 800/800 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 800/800 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 3963ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 350 steps, including 1 resets, run visited all 2 properties in 33 ms. (steps per millisecond=10 )
Parikh walk visited 4 properties in 5848 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (G (OR p2 (NOT p0) p1)), (G (AND (OR p2 p0) (OR p2 p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 652 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 3 out of 800 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 1805 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-21 23:45:22] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:45:22] [INFO ] Invariant cache hit.
[2024-05-21 23:45:28] [INFO ] Implicit Places using invariants in 6458 ms returned []
Implicit Place search using SMT only with invariants took 6460 ms to find 0 implicit places.
Running 40200 sub problems to find dead transitions.
[2024-05-21 23:45:29] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-21 23:45:29] [INFO ] Invariant cache hit.
[2024-05-21 23:45:29] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Dekker-PT-200

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 1000
TRANSITIONS: 40400
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 320400
NUPN UNITS: 402
LOADING TIME: 706.615

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.635
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 709.094
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 791
MODEL NAME: /home/mcc/execution/model
1000 places, 40400 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -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="Dekker-PT-200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Dekker-PT-200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631130400123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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