About the Execution of ITS-Tools for Peterson-COL-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
304.531 | 25387.00 | 34120.00 | 1649.10 | TFTTTTTTTTFFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128100567.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-COL-3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100567
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K May 5 16:51 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 Peterson-COL-3-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-3-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621007493661
Running Version 0
[2021-05-14 15:51:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 15:51:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:51:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-14 15:51:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 15:51:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 551 ms
[2021-05-14 15:51:35] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:51:35] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 15:51:35] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2724208236433717330.dot
Reduce places removed 2 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-14 15:51:35] [INFO ] Flatten gal took : 28 ms
[2021-05-14 15:51:35] [INFO ] Flatten gal took : 2 ms
[2021-05-14 15:51:35] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 17 ms.
[2021-05-14 15:51:35] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_5646565065236359623.dot
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 14) seen :6
FORMULA Peterson-COL-3-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2021-05-14 15:51:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 15:51:36] [INFO ] Computed 15 place invariants in 14 ms
[2021-05-14 15:51:36] [INFO ] [Real]Absence check using 11 positive place invariants in 80 ms returned unsat
[2021-05-14 15:51:36] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2021-05-14 15:51:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:37] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-14 15:51:37] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 15:51:37] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:51:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 15:51:37] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 15:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:37] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-14 15:51:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 4 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2021-05-14 15:51:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 585 ms
[2021-05-14 15:51:37] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 17 ms.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:51:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 479 ms
[2021-05-14 15:51:39] [INFO ] Added : 181 causal constraints over 37 iterations in 1238 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-14 15:51:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 15:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:39] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-14 15:51:39] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 15:51:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:39] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-14 15:51:39] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 15:51:39] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2021-05-14 15:51:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:39] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2021-05-14 15:51:39] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2021-05-14 15:51:39] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2021-05-14 15:51:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 379 ms
[2021-05-14 15:51:39] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 14 ms.
[2021-05-14 15:51:40] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
[2021-05-14 15:51:40] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:40] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2021-05-14 15:51:40] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:40] [INFO ] Deduced a trap composed of 46 places in 30 ms of which 0 ms to minimize.
[2021-05-14 15:51:40] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2021-05-14 15:51:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 418 ms
[2021-05-14 15:51:40] [INFO ] Added : 181 causal constraints over 37 iterations in 1110 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-14 15:51:40] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 15:51:40] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:41] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-14 15:51:41] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 15:51:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 15:51:41] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 15:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:41] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-14 15:51:41] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:51:41] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:41] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 0 ms to minimize.
[2021-05-14 15:51:41] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2021-05-14 15:51:41] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2021-05-14 15:51:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 239 ms
[2021-05-14 15:51:41] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 20 ms.
[2021-05-14 15:51:42] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2021-05-14 15:51:42] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:51:42] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2021-05-14 15:51:42] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2021-05-14 15:51:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 322 ms
[2021-05-14 15:51:42] [INFO ] Added : 253 causal constraints over 51 iterations in 1338 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-14 15:51:42] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 15:51:42] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 15:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:43] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-14 15:51:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 15:51:43] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-14 15:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:43] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-14 15:51:43] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2021-05-14 15:51:43] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 22 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 2 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 8 ms to minimize.
[2021-05-14 15:51:44] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 0 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 1 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 3 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 2 ms to minimize.
[2021-05-14 15:51:45] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 12 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 60 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:46] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 52 places in 39 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:47] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 59 trap constraints in 4775 ms
[2021-05-14 15:51:48] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 15:51:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:48] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2021-05-14 15:51:48] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 15:51:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 15:51:48] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:48] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-14 15:51:48] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:51:48] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 67 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 49 places in 32 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 0 ms to minimize.
[2021-05-14 15:51:49] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1331 ms
[2021-05-14 15:51:49] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 21 ms.
[2021-05-14 15:51:50] [INFO ] Added : 281 causal constraints over 57 iterations in 1132 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-14 15:51:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:50] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:51] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-14 15:51:51] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2021-05-14 15:51:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:51] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:51] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-14 15:51:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 0 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 1 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:51] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2021-05-14 15:51:53] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:51:53] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:51:53] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 53 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:51:54] [INFO ] Deduced a trap composed of 69 places in 39 ms of which 0 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 0 ms to minimize.
[2021-05-14 15:51:55] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 0 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2021-05-14 15:51:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-14 15:51:56] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 15:51:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:56] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-14 15:51:56] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 15:51:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:51:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:51:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:51:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:51:56] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-14 15:51:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2021-05-14 15:51:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 504 ms
[2021-05-14 15:51:56] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 19 ms.
[2021-05-14 15:51:57] [INFO ] Added : 268 causal constraints over 54 iterations in 1002 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA Peterson-COL-3-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-3-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 16801 steps, including 614 resets, run visited all 6 properties in 123 ms. (steps per millisecond=136 )
FORMULA Peterson-COL-3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-3-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1621007519048
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="Peterson-COL-3"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-3, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128100567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;