fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for SemanticWebServices-PT-S256P15

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9802.231 190544.00 251931.00 597.80 inf inf inf inf inf inf inf inf inf inf inf inf 1 inf inf inf 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.r524-tall-171679080700597.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 SemanticWebServices-PT-S256P15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679080700597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 32M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 02:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 02:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 02:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 02:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717229382318

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S256P15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:09:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 08:09:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:09:44] [INFO ] Load time of PNML (sax parser for PT used): 1134 ms
[2024-06-01 08:09:44] [INFO ] Transformed 329 places.
[2024-06-01 08:09:44] [INFO ] Transformed 29492 transitions.
[2024-06-01 08:09:44] [INFO ] Parsed PT model containing 329 places and 29492 transitions and 267319 arcs in 1443 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 70 ms.
Deduced a syphon composed of 5 places in 42 ms
Reduce places removed 5 places and 2050 transitions.
Ensure Unique test removed 6828 transitions
Reduce redundant transitions removed 6828 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 08:09:45] [INFO ] Flow matrix only has 1901 transitions (discarded 18713 similar events)
// Phase 1: matrix 1901 rows 324 cols
[2024-06-01 08:09:45] [INFO ] Computed 36 invariants in 46 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf]
RANDOM walk for 10000 steps (2 resets) in 914 ms. (10 steps per ms)
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150015 steps (30 resets) in 70 ms. (2112 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 36, 70, 28, 5, 11, 0, 0, 228, 16, 0, 61, 47, 67, 11] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 08:09:46] [INFO ] Flow matrix only has 1901 transitions (discarded 18713 similar events)
[2024-06-01 08:09:46] [INFO ] Invariant cache hit.
[2024-06-01 08:09:46] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-06-01 08:09:46] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-06-01 08:09:46] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2024-06-01 08:09:47] [INFO ] State equation strengthened by 1044 read => feed constraints.
[2024-06-01 08:09:48] [INFO ] [Real]Added 1044 Read/Feed constraints in 1200 ms returned sat
[2024-06-01 08:09:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:09:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:09:48] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 6 ms returned sat
[2024-06-01 08:09:49] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-06-01 08:09:50] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1151 ms returned sat
[2024-06-01 08:09:51] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 927 ms.
[2024-06-01 08:09:51] [INFO ] Added : 6 causal constraints over 2 iterations in 1282 ms. Result :sat
Minimization took 1333 ms.
[2024-06-01 08:09:53] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 08:09:53] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 7 ms returned sat
[2024-06-01 08:09:53] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-06-01 08:09:54] [INFO ] [Real]Added 1044 Read/Feed constraints in 1144 ms returned sat
[2024-06-01 08:09:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:09:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:09:54] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:09:54] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2024-06-01 08:09:56] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1107 ms returned sat
[2024-06-01 08:09:56] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 825 ms.
[2024-06-01 08:09:57] [INFO ] Added : 0 causal constraints over 0 iterations in 978 ms. Result :sat
Minimization took 1418 ms.
[2024-06-01 08:09:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:09:58] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:09:58] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-06-01 08:10:00] [INFO ] [Real]Added 1044 Read/Feed constraints in 1168 ms returned sat
[2024-06-01 08:10:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:00] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-06-01 08:10:00] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2024-06-01 08:10:01] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1126 ms returned sat
[2024-06-01 08:10:02] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 607 ms.
[2024-06-01 08:10:02] [INFO ] Added : 0 causal constraints over 0 iterations in 745 ms. Result :sat
Minimization took 1677 ms.
[2024-06-01 08:10:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:04] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 8 ms returned sat
[2024-06-01 08:10:04] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2024-06-01 08:10:05] [INFO ] [Real]Added 1044 Read/Feed constraints in 1137 ms returned sat
[2024-06-01 08:10:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-06-01 08:10:05] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 6 ms returned sat
[2024-06-01 08:10:06] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-06-01 08:10:07] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1169 ms returned sat
[2024-06-01 08:10:08] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 913 ms.
[2024-06-01 08:10:08] [INFO ] Added : 0 causal constraints over 0 iterations in 1123 ms. Result :sat
Minimization took 1294 ms.
[2024-06-01 08:10:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:09] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:10] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-06-01 08:10:11] [INFO ] [Real]Added 1044 Read/Feed constraints in 1052 ms returned sat
[2024-06-01 08:10:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:11] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 17 ms returned sat
[2024-06-01 08:10:11] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2024-06-01 08:10:12] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1136 ms returned sat
[2024-06-01 08:10:13] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 628 ms.
[2024-06-01 08:10:13] [INFO ] Added : 0 causal constraints over 0 iterations in 780 ms. Result :sat
Minimization took 1307 ms.
[2024-06-01 08:10:14] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:15] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:15] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2024-06-01 08:10:16] [INFO ] [Real]Added 1044 Read/Feed constraints in 1130 ms returned sat
[2024-06-01 08:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:16] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:16] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2024-06-01 08:10:18] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1126 ms returned sat
[2024-06-01 08:10:18] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 627 ms.
[2024-06-01 08:10:18] [INFO ] Added : 0 causal constraints over 0 iterations in 767 ms. Result :sat
Minimization took 1330 ms.
[2024-06-01 08:10:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:20] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-06-01 08:10:20] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2024-06-01 08:10:21] [INFO ] [Real]Added 1044 Read/Feed constraints in 1133 ms returned sat
[2024-06-01 08:10:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:21] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 17 ms returned sat
[2024-06-01 08:10:22] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2024-06-01 08:10:23] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1142 ms returned sat
[2024-06-01 08:10:23] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 705 ms.
[2024-06-01 08:10:24] [INFO ] Added : 4 causal constraints over 1 iterations in 912 ms. Result :sat
Minimization took 1296 ms.
[2024-06-01 08:10:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:25] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:25] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-06-01 08:10:26] [INFO ] [Real]Added 1044 Read/Feed constraints in 1148 ms returned sat
[2024-06-01 08:10:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:27] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-06-01 08:10:27] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2024-06-01 08:10:28] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1121 ms returned sat
[2024-06-01 08:10:29] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 593 ms.
[2024-06-01 08:10:29] [INFO ] Added : 5 causal constraints over 1 iterations in 798 ms. Result :sat
Minimization took 1330 ms.
[2024-06-01 08:10:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:30] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:31] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-06-01 08:10:32] [INFO ] [Real]Added 1044 Read/Feed constraints in 1139 ms returned sat
[2024-06-01 08:10:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:32] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 5 ms returned sat
[2024-06-01 08:10:32] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2024-06-01 08:10:33] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1134 ms returned sat
[2024-06-01 08:10:34] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 596 ms.
[2024-06-01 08:10:34] [INFO ] Added : 0 causal constraints over 0 iterations in 734 ms. Result :sat
Minimization took 1306 ms.
[2024-06-01 08:10:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:35] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:36] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-06-01 08:10:37] [INFO ] [Real]Added 1044 Read/Feed constraints in 1096 ms returned sat
[2024-06-01 08:10:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:37] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:37] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2024-06-01 08:10:38] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1137 ms returned sat
[2024-06-01 08:10:39] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 590 ms.
[2024-06-01 08:10:39] [INFO ] Added : 0 causal constraints over 0 iterations in 720 ms. Result :sat
Minimization took 1310 ms.
[2024-06-01 08:10:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:40] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:41] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-06-01 08:10:42] [INFO ] [Real]Added 1044 Read/Feed constraints in 1127 ms returned sat
[2024-06-01 08:10:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:42] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:42] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-06-01 08:10:43] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1107 ms returned sat
[2024-06-01 08:10:44] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 607 ms.
[2024-06-01 08:10:44] [INFO ] Added : 2 causal constraints over 1 iterations in 809 ms. Result :sat
Minimization took 1291 ms.
[2024-06-01 08:10:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:46] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 9 ms returned sat
[2024-06-01 08:10:46] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2024-06-01 08:10:47] [INFO ] [Real]Added 1044 Read/Feed constraints in 1134 ms returned sat
[2024-06-01 08:10:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:47] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-06-01 08:10:47] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2024-06-01 08:10:49] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1139 ms returned sat
[2024-06-01 08:10:49] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 586 ms.
[2024-06-01 08:10:49] [INFO ] Added : 0 causal constraints over 0 iterations in 731 ms. Result :sat
Minimization took 1308 ms.
[2024-06-01 08:10:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:10:51] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:51] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2024-06-01 08:10:52] [INFO ] [Real]Added 1044 Read/Feed constraints in 1144 ms returned sat
[2024-06-01 08:10:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:52] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:53] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2024-06-01 08:10:54] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1138 ms returned sat
[2024-06-01 08:10:54] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 586 ms.
[2024-06-01 08:10:54] [INFO ] Added : 0 causal constraints over 0 iterations in 720 ms. Result :sat
Minimization took 1318 ms.
[2024-06-01 08:10:56] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:56] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 3 ms returned sat
[2024-06-01 08:10:56] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2024-06-01 08:10:57] [INFO ] [Real]Added 1044 Read/Feed constraints in 1113 ms returned sat
[2024-06-01 08:10:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:10:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 08:10:57] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:10:58] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2024-06-01 08:10:59] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1130 ms returned sat
[2024-06-01 08:10:59] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 579 ms.
[2024-06-01 08:11:00] [INFO ] Added : 0 causal constraints over 0 iterations in 712 ms. Result :sat
Minimization took 1325 ms.
[2024-06-01 08:11:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:11:01] [INFO ] [Real]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:11:01] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2024-06-01 08:11:02] [INFO ] [Real]Added 1044 Read/Feed constraints in 1113 ms returned sat
[2024-06-01 08:11:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:11:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 08:11:02] [INFO ] [Nat]Absence check using 2 positive and 34 generalized place invariants in 4 ms returned sat
[2024-06-01 08:11:03] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-06-01 08:11:04] [INFO ] [Nat]Added 1044 Read/Feed constraints in 1107 ms returned sat
[2024-06-01 08:11:04] [INFO ] Computed and/alt/rep : 76/124/76 causal constraints (skipped 973 transitions) in 576 ms.
[2024-06-01 08:11:05] [INFO ] Added : 0 causal constraints over 0 iterations in 717 ms. Result :sat
Minimization took 1288 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 36, 70, 28, 5, 11, 0, 0, 228, 16, 0, 61, 47, 67, 11] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 36, 70, 28, 5, 11, 0, 0, 228, 16, 0, 61, 47, 67, 11] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 20614/20614 transitions.
Graph (complete) has 3631 edges and 324 vertex of which 224 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.51 ms
Discarding 100 places :
Also discarding 61 output transitions
Drop transitions (Output transitions of discarded places.) removed 61 transitions
Ensure Unique test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 557 transitions
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 984 transitions.
Iterating post reduction 0 with 993 rules applied. Total rules applied 994 place count 215 transition count 19569
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1014 place count 195 transition count 13544
Iterating global reduction 1 with 20 rules applied. Total rules applied 1034 place count 195 transition count 13544
Ensure Unique test removed 1134 transitions
Reduce isomorphic transitions removed 1134 transitions.
Iterating post reduction 1 with 1134 rules applied. Total rules applied 2168 place count 195 transition count 12410
Drop transitions (Redundant composition of simpler transitions.) removed 2630 transitions
Redundant transition composition rules discarded 2630 transitions
Iterating global reduction 2 with 2630 rules applied. Total rules applied 4798 place count 195 transition count 9780
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 133 transitions
Ensure Unique test removed 491 transitions
Reduce isomorphic transitions removed 624 transitions.
Iterating post reduction 2 with 631 rules applied. Total rules applied 5429 place count 188 transition count 9156
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 5442 place count 175 transition count 7631
Iterating global reduction 3 with 13 rules applied. Total rules applied 5455 place count 175 transition count 7631
Ensure Unique test removed 1170 transitions
Reduce isomorphic transitions removed 1170 transitions.
Iterating post reduction 3 with 1170 rules applied. Total rules applied 6625 place count 175 transition count 6461
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 6626 place count 174 transition count 6333
Iterating global reduction 4 with 1 rules applied. Total rules applied 6627 place count 174 transition count 6333
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 6633 place count 174 transition count 6327
Drop transitions (Redundant composition of simpler transitions.) removed 490 transitions
Redundant transition composition rules discarded 490 transitions
Iterating global reduction 5 with 490 rules applied. Total rules applied 7123 place count 174 transition count 5837
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 5 with 123 rules applied. Total rules applied 7246 place count 172 transition count 5716
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 7298 place count 172 transition count 5664
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 7299 place count 171 transition count 5663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 7300 place count 170 transition count 5663
Applied a total of 7300 rules in 5143 ms. Remains 170 /324 variables (removed 154) and now considering 5663/20614 (removed 14951) transitions.
Running 5099 sub problems to find dead transitions.
[2024-06-01 08:11:11] [INFO ] Flow matrix only has 1134 transitions (discarded 4529 similar events)
Normalized transition count is 1133 out of 1134 initially.
// Phase 1: matrix 1133 rows 170 cols
[2024-06-01 08:11:11] [INFO ] Computed 0 invariants in 3 ms
[2024-06-01 08:11:12] [INFO ] State equation strengthened by 570 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 164/1304 variables, and 0 constraints, problems are : Problem set: 0 solved, 5099 unsolved in 20090 ms.
Refiners :[State Equation: 0/170 constraints, ReadFeed: 0/570 constraints, PredecessorRefiner: 5099/5099 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 164/1304 variables, and 0 constraints, problems are : Problem set: 0 solved, 5099 unsolved in 20067 ms.
Refiners :[State Equation: 0/170 constraints, ReadFeed: 0/570 constraints, PredecessorRefiner: 0/5099 constraints, Known Traps: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 5099 unsolved
Search for dead transitions found 0 dead transitions in 60338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65563 ms. Remains : 170/324 places, 5663/20614 transitions.
[2024-06-01 08:12:11] [INFO ] Flow matrix only has 1134 transitions (discarded 4529 similar events)
Found an invariant !
This invariant on transitions {1064=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {34=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1805 ms. (steps per millisecond=5 ) properties (out of 15) seen :[0, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 0, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, +inf, +inf, +inf, +inf, +inf, +inf, 0, +inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 08:12:14] [INFO ] Flow matrix only has 1134 transitions (discarded 4529 similar events)
[2024-06-01 08:12:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, +inf, +inf, +inf, +inf, +inf, +inf, 0, +inf, +inf, +inf, +inf, +inf, +inf, +inf] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 782207 steps (2 resets) in 30001 ms. (26 steps per ms)
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-14 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-02 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-01 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 3513 ms. (569 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[266, 259] Max Struct:[+inf, +inf]
[2024-06-01 08:12:47] [INFO ] Flow matrix only has 1134 transitions (discarded 4529 similar events)
[2024-06-01 08:12:47] [INFO ] Invariant cache hit.
[2024-06-01 08:12:47] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-06-01 08:12:47] [INFO ] State equation strengthened by 570 read => feed constraints.
[2024-06-01 08:12:48] [INFO ] [Real]Added 570 Read/Feed constraints in 402 ms returned sat
[2024-06-01 08:12:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:12:48] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-06-01 08:12:48] [INFO ] [Nat]Added 570 Read/Feed constraints in 283 ms returned sat
[2024-06-01 08:12:49] [INFO ] Computed and/alt/rep : 13/13/13 causal constraints (skipped 557 transitions) in 225 ms.
[2024-06-01 08:12:49] [INFO ] Added : 5 causal constraints over 1 iterations in 346 ms. Result :sat
Minimization took 320 ms.
[2024-06-01 08:12:49] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2024-06-01 08:12:50] [INFO ] [Real]Added 570 Read/Feed constraints in 298 ms returned sat
[2024-06-01 08:12:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:12:50] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-01 08:12:50] [INFO ] [Nat]Added 570 Read/Feed constraints in 293 ms returned sat
[2024-06-01 08:12:50] [INFO ] Computed and/alt/rep : 13/13/13 causal constraints (skipped 557 transitions) in 224 ms.
[2024-06-01 08:12:51] [INFO ] Added : 4 causal constraints over 1 iterations in 347 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[266, 259] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[268, 261] Max Struct:[+inf, +inf]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 5663/5663 transitions.
Graph (complete) has 1686 edges and 170 vertex of which 11 are kept as prefixes of interest. Removing 159 places using SCC suffix rule.2 ms
Discarding 159 places :
Also discarding 5090 output transitions
Drop transitions (Output transitions of discarded places.) removed 5090 transitions
Drop transitions (Empty/Sink Transition effects.) removed 562 transitions
Reduce isomorphic transitions removed 562 transitions.
Iterating post reduction 0 with 562 rules applied. Total rules applied 563 place count 11 transition count 11
Applied a total of 563 rules in 9 ms. Remains 11 /170 variables (removed 159) and now considering 11/5663 (removed 5652) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 11/170 places, 11/5663 transitions.
Found an invariant !
This invariant on transitions {5=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :[2147483647, 2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf, +inf] Max Struct:[+inf, +inf]
// Phase 1: matrix 11 rows 11 cols
[2024-06-01 08:12:52] [INFO ] Computed 0 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf, +inf] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 626 ms. (1594 steps per ms)
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SemanticWebServices-PT-S256P15-UpperBounds-00 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 189321 ms.
ITS solved all properties within timeout

BK_STOP 1717229572862

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 UpperBounds -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="SemanticWebServices-PT-S256P15"
export BK_EXAMINATION="UpperBounds"
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 SemanticWebServices-PT-S256P15, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r524-tall-171679080700597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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