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.r553-tall-171734901100197.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 FireWire-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 FireWire-PT-04-UpperBounds-00
FORMULA_NAME FireWire-PT-04-UpperBounds-01
FORMULA_NAME FireWire-PT-04-UpperBounds-02
FORMULA_NAME FireWire-PT-04-UpperBounds-03
FORMULA_NAME FireWire-PT-04-UpperBounds-04
FORMULA_NAME FireWire-PT-04-UpperBounds-05
FORMULA_NAME FireWire-PT-04-UpperBounds-06
FORMULA_NAME FireWire-PT-04-UpperBounds-07
FORMULA_NAME FireWire-PT-04-UpperBounds-08
FORMULA_NAME FireWire-PT-04-UpperBounds-09
FORMULA_NAME FireWire-PT-04-UpperBounds-10
FORMULA_NAME FireWire-PT-04-UpperBounds-11
FORMULA_NAME FireWire-PT-04-UpperBounds-12
FORMULA_NAME FireWire-PT-04-UpperBounds-13
FORMULA_NAME FireWire-PT-04-UpperBounds-14
FORMULA_NAME FireWire-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717353821144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:43:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-02 18:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:43:42] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 18:43:42] [INFO ] Transformed 113 places.
[2024-06-02 18:43:42] [INFO ] Transformed 364 transitions.
[2024-06-02 18:43:42] [INFO ] Found NUPN structural information;
[2024-06-02 18:43:42] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:43:42] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 18:43:42] [INFO ] Computed 8 invariants in 30 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (546 resets) in 42 ms. (232 steps per ms)
FORMULA FireWire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70003 steps (977 resets) in 77 ms. (897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-02 18:43:42] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
[2024-06-02 18:43:42] [INFO ] Invariant cache hit.
[2024-06-02 18:43:43] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 18:43:43] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-06-02 18:43:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:43] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 18:43:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:43:43] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 18:43:43] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 18:43:43] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 37 ms.
[2024-06-02 18:43:43] [INFO ] Added : 13 causal constraints over 4 iterations in 128 ms. Result :sat
Minimization took 53 ms.
[2024-06-02 18:43:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:43] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-02 18:43:43] [INFO ] [Real]Added 40 Read/Feed constraints in 21 ms returned sat
[2024-06-02 18:43:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:43] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-02 18:43:43] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2024-06-02 18:43:43] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 24 ms.
[2024-06-02 18:43:43] [INFO ] Added : 34 causal constraints over 8 iterations in 163 ms. Result :sat
Minimization took 47 ms.
[2024-06-02 18:43:44] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Real]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-06-02 18:43:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 18:43:44] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 27 ms.
[2024-06-02 18:43:44] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 8 ms to minimize.
[2024-06-02 18:43:44] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:43:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2024-06-02 18:43:44] [INFO ] Added : 39 causal constraints over 10 iterations in 340 ms. Result :sat
Minimization took 49 ms.
[2024-06-02 18:43:44] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:43:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 18:43:44] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 18:43:44] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-06-02 18:43:45] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 27 ms.
[2024-06-02 18:43:45] [INFO ] Added : 21 causal constraints over 5 iterations in 123 ms. Result :sat
Minimization took 48 ms.
[2024-06-02 18:43:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:45] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:43:45] [INFO ] [Real]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:43:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-02 18:43:45] [INFO ] [Nat]Added 40 Read/Feed constraints in 24 ms returned sat
[2024-06-02 18:43:45] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 54 ms.
[2024-06-02 18:43:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-02 18:43:45] [INFO ] Added : 47 causal constraints over 11 iterations in 333 ms. Result :sat
Minimization took 46 ms.
[2024-06-02 18:43:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:43:45] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 18:43:45] [INFO ] [Real]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 18:43:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:46] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:43:46] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:43:46] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 34 ms.
[2024-06-02 18:43:46] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:43:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:43:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2024-06-02 18:43:46] [INFO ] Added : 54 causal constraints over 13 iterations in 415 ms. Result :sat
Minimization took 50 ms.
[2024-06-02 18:43:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:46] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:43:46] [INFO ] [Real]Added 40 Read/Feed constraints in 24 ms returned sat
[2024-06-02 18:43:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:46] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-02 18:43:46] [INFO ] [Nat]Added 40 Read/Feed constraints in 21 ms returned sat
[2024-06-02 18:43:46] [INFO ] Computed and/alt/rep : 118/469/118 causal constraints (skipped 157 transitions) in 19 ms.
[2024-06-02 18:43:47] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:43:47] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:43:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-06-02 18:43:47] [INFO ] Added : 37 causal constraints over 9 iterations in 334 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 112 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 112 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 111 transition count 303
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 110 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 110 transition count 301
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 107 transition count 308
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 107 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 30 place count 107 transition count 293
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 107 transition count 296
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 37 place count 105 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 105 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 104 transition count 290
Applied a total of 40 rules in 110 ms. Remains 104 /113 variables (removed 9) and now considering 290/308 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 104/113 places, 290/308 transitions.
[2024-06-02 18:43:47] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
// Phase 1: matrix 261 rows 104 cols
[2024-06-02 18:43:47] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (63997 resets) in 1150 ms. (868 steps per ms)
FORMULA FireWire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (16162 resets) in 407 ms. (2450 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:43:49] [INFO ] Flow matrix only has 261 transitions (discarded 29 similar events)
[2024-06-02 18:43:49] [INFO ] Invariant cache hit.
[2024-06-02 18:43:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:43:49] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 18:43:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:49] [INFO ] [Real]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-06-02 18:43:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:49] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-02 18:43:49] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2024-06-02 18:43:49] [INFO ] Computed and/alt/rep : 114/462/114 causal constraints (skipped 145 transitions) in 18 ms.
[2024-06-02 18:43:49] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 18:43:49] [INFO ] Added : 8 causal constraints over 3 iterations in 127 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 104 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p13) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 288/288 transitions.
Applied a total of 0 rules in 14 ms. Remains 104 /104 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 104/104 places, 288/288 transitions.
[2024-06-02 18:43:49] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
// Phase 1: matrix 259 rows 104 cols
[2024-06-02 18:43:49] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (63887 resets) in 1116 ms. (895 steps per ms)
BEST_FIRST walk for 1000001 steps (16029 resets) in 418 ms. (2386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:43:51] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
[2024-06-02 18:43:51] [INFO ] Invariant cache hit.
[2024-06-02 18:43:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 18:43:51] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:43:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:51] [INFO ] [Real]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-06-02 18:43:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:43:51] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 18:43:51] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-06-02 18:43:51] [INFO ] Computed and/alt/rep : 114/468/114 causal constraints (skipped 143 transitions) in 19 ms.
[2024-06-02 18:43:51] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 18:43:51] [INFO ] Added : 42 causal constraints over 10 iterations in 235 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 104/104 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2024-06-02 18:43:51] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
[2024-06-02 18:43:51] [INFO ] Invariant cache hit.
[2024-06-02 18:43:51] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:43:51] [INFO ] Flow matrix only has 259 transitions (discarded 29 similar events)
[2024-06-02 18:43:51] [INFO ] Invariant cache hit.
[2024-06-02 18:43:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:51] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [34, 58, 99, 102]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 216 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/104 places, 288/288 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 285
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 285
Applied a total of 6 rules in 15 ms. Remains 97 /100 variables (removed 3) and now considering 285/288 (removed 3) transitions.
[2024-06-02 18:43:51] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
// Phase 1: matrix 256 rows 97 cols
[2024-06-02 18:43:51] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 18:43:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:43:52] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
[2024-06-02 18:43:52] [INFO ] Invariant cache hit.
[2024-06-02 18:43:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:52] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/104 places, 285/288 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 450 ms. Remains : 97/104 places, 285/288 transitions.
[2024-06-02 18:43:52] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
[2024-06-02 18:43:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (63987 resets) in 1050 ms. (951 steps per ms)
BEST_FIRST walk for 1000001 steps (16013 resets) in 376 ms. (2652 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-02 18:43:53] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
[2024-06-02 18:43:53] [INFO ] Invariant cache hit.
[2024-06-02 18:43:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 18:43:53] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-06-02 18:43:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:53] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-02 18:43:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:43:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 18:43:53] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-02 18:43:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2024-06-02 18:43:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:43:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-02 18:43:53] [INFO ] Computed and/alt/rep : 111/459/111 causal constraints (skipped 143 transitions) in 16 ms.
[2024-06-02 18:43:53] [INFO ] Added : 8 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 285/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 97 /97 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 97/97 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 285/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 97 /97 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 18:43:54] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
[2024-06-02 18:43:54] [INFO ] Invariant cache hit.
[2024-06-02 18:43:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 18:43:54] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
[2024-06-02 18:43:54] [INFO ] Invariant cache hit.
[2024-06-02 18:43:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:43:54] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-02 18:43:54] [INFO ] Redundant transitions in 15 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 18:43:54] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
[2024-06-02 18:43:54] [INFO ] Invariant cache hit.
[2024-06-02 18:43:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 18:43:56] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:43:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-02 18:43:56] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:43:56] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 256/352 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 18:44:04] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/353 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 146 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15206 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 18:44:11] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 256/352 variables, 96/106 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 283/429 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 18:44:14] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:44:14] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-02 18:44:14] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 12 (OVERLAPS) 1/353 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 14 (OVERLAPS) 0/353 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 433 constraints, problems are : Problem set: 0 solved, 283 unsolved in 19499 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 97/97 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints]
After SMT, in 34968ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 34981ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35220 ms. Remains : 97/97 places, 285/285 transitions.
[2024-06-02 18:44:29] [INFO ] Flow matrix only has 256 transitions (discarded 29 similar events)
[2024-06-02 18:44:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA FireWire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (63746 resets) in 1096 ms. (911 steps per ms)
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 48039 ms.
ITS solved all properties within timeout

BK_STOP 1717353870496

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="FireWire-PT-04"
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 FireWire-PT-04, 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 r553-tall-171734901100197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-04.tgz
mv FireWire-PT-04 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 ;