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.r532-smll-171683810700053.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 SieveSingleMsgMbox-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810700053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717242855994

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:54:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:54:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:54:18] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2024-06-01 11:54:18] [INFO ] Transformed 1295 places.
[2024-06-01 11:54:18] [INFO ] Transformed 749 transitions.
[2024-06-01 11:54:18] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 480 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 1036 places in 12 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 749 rows 259 cols
[2024-06-01 11:54:19] [INFO ] Computed 6 invariants in 49 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[10, 10, 1, 1, 10]
RANDOM walk for 10000 steps (2242 resets) in 316 ms. (31 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (3875 resets) in 395 ms. (101 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
[2024-06-01 11:54:19] [INFO ] Invariant cache hit.
[2024-06-01 11:54:20] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-06-01 11:54:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 8 ms returned sat
[2024-06-01 11:54:21] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2024-06-01 11:54:21] [INFO ] State equation strengthened by 587 read => feed constraints.
[2024-06-01 11:54:21] [INFO ] [Real]Added 587 Read/Feed constraints in 219 ms returned sat
[2024-06-01 11:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 11:54:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 11:54:22] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2024-06-01 11:54:22] [INFO ] [Nat]Added 587 Read/Feed constraints in 319 ms returned sat
[2024-06-01 11:54:22] [INFO ] Deduced a trap composed of 18 places in 381 ms of which 52 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 17 places in 342 ms of which 5 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 6 ms to minimize.
[2024-06-01 11:54:24] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 4 ms to minimize.
[2024-06-01 11:54:24] [INFO ] Deduced a trap composed of 26 places in 389 ms of which 5 ms to minimize.
[2024-06-01 11:54:25] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 5 ms to minimize.
[2024-06-01 11:54:25] [INFO ] Deduced a trap composed of 38 places in 332 ms of which 5 ms to minimize.
[2024-06-01 11:54:26] [INFO ] Deduced a trap composed of 24 places in 336 ms of which 5 ms to minimize.
[2024-06-01 11:54:26] [INFO ] Deduced a trap composed of 24 places in 371 ms of which 5 ms to minimize.
[2024-06-01 11:54:26] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 11:54:26] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 11:54:26] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 11:54:27] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-06-01 11:54:27] [INFO ] [Real]Added 587 Read/Feed constraints in 211 ms returned sat
[2024-06-01 11:54:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:54:27] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:54:27] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2024-06-01 11:54:27] [INFO ] [Nat]Added 587 Read/Feed constraints in 241 ms returned sat
[2024-06-01 11:54:28] [INFO ] Deduced a trap composed of 30 places in 370 ms of which 5 ms to minimize.
[2024-06-01 11:54:28] [INFO ] Deduced a trap composed of 30 places in 361 ms of which 5 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 18 places in 362 ms of which 5 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 4 ms to minimize.
[2024-06-01 11:54:30] [INFO ] Deduced a trap composed of 30 places in 331 ms of which 5 ms to minimize.
[2024-06-01 11:54:30] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 4 ms to minimize.
[2024-06-01 11:54:31] [INFO ] Deduced a trap composed of 26 places in 359 ms of which 6 ms to minimize.
[2024-06-01 11:54:31] [INFO ] Deduced a trap composed of 26 places in 314 ms of which 5 ms to minimize.
[2024-06-01 11:54:32] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4425 ms
[2024-06-01 11:54:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 11:54:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:54:32] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-06-01 11:54:33] [INFO ] [Real]Added 587 Read/Feed constraints in 279 ms returned sat
[2024-06-01 11:54:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 11:54:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 11:54:33] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2024-06-01 11:54:33] [INFO ] [Nat]Added 587 Read/Feed constraints in 284 ms returned sat
[2024-06-01 11:54:34] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 3 ms to minimize.
[2024-06-01 11:54:34] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 5 ms to minimize.
[2024-06-01 11:54:35] [INFO ] Deduced a trap composed of 28 places in 437 ms of which 5 ms to minimize.
[2024-06-01 11:54:35] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 4 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 38 places in 351 ms of which 5 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 5 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 137 places in 214 ms of which 2 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3266 ms
[2024-06-01 11:54:37] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 171 ms.
[2024-06-01 11:54:37] [INFO ] Added : 23 causal constraints over 5 iterations in 659 ms. Result :sat
Minimization took 373 ms.
[2024-06-01 11:54:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:54:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-06-01 11:54:38] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-06-01 11:54:38] [INFO ] [Real]Added 587 Read/Feed constraints in 120 ms returned sat
[2024-06-01 11:54:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:54:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:54:38] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-06-01 11:54:39] [INFO ] [Nat]Added 587 Read/Feed constraints in 297 ms returned sat
[2024-06-01 11:54:39] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 5 ms to minimize.
[2024-06-01 11:54:39] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 4 ms to minimize.
[2024-06-01 11:54:40] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 4 ms to minimize.
[2024-06-01 11:54:40] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 4 ms to minimize.
[2024-06-01 11:54:41] [INFO ] Deduced a trap composed of 33 places in 348 ms of which 6 ms to minimize.
[2024-06-01 11:54:41] [INFO ] Deduced a trap composed of 30 places in 323 ms of which 4 ms to minimize.
[2024-06-01 11:54:42] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 5 ms to minimize.
[2024-06-01 11:54:42] [INFO ] Deduced a trap composed of 30 places in 330 ms of which 4 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 26 places in 274 ms of which 4 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 4340 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.7 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 301 place count 183 transition count 269
Iterating global reduction 1 with 58 rules applied. Total rules applied 359 place count 183 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 365 place count 183 transition count 263
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 406 place count 142 transition count 222
Iterating global reduction 2 with 41 rules applied. Total rules applied 447 place count 142 transition count 222
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 459 place count 142 transition count 210
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 483 place count 118 transition count 184
Iterating global reduction 3 with 24 rules applied. Total rules applied 507 place count 118 transition count 184
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 533 place count 118 transition count 158
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 538 place count 113 transition count 151
Iterating global reduction 4 with 5 rules applied. Total rules applied 543 place count 113 transition count 151
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 548 place count 108 transition count 146
Iterating global reduction 4 with 5 rules applied. Total rules applied 553 place count 108 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 555 place count 106 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 557 place count 106 transition count 143
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 559 place count 104 transition count 141
Iterating global reduction 4 with 2 rules applied. Total rules applied 561 place count 104 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 563 place count 102 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 565 place count 102 transition count 139
Applied a total of 565 rules in 206 ms. Remains 102 /259 variables (removed 157) and now considering 139/749 (removed 610) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 102/259 places, 139/749 transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-06-01 11:54:44] [INFO ] Computed 4 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
RANDOM walk for 1000000 steps (224208 resets) in 1529 ms. (653 steps per ms)
BEST_FIRST walk for 4000003 steps (414897 resets) in 2645 ms. (1511 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
[2024-06-01 11:54:48] [INFO ] Invariant cache hit.
[2024-06-01 11:54:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:54:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:54:48] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-01 11:54:48] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-01 11:54:48] [INFO ] [Real]Added 70 Read/Feed constraints in 39 ms returned sat
[2024-06-01 11:54:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:54:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:54:48] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 11:54:48] [INFO ] [Nat]Added 70 Read/Feed constraints in 20 ms returned sat
[2024-06-01 11:54:48] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 11 ms to minimize.
[2024-06-01 11:54:48] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
[2024-06-01 11:54:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2024-06-01 11:54:49] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 20 ms.
[2024-06-01 11:54:49] [INFO ] Added : 19 causal constraints over 4 iterations in 120 ms. Result :sat
Minimization took 129 ms.
[2024-06-01 11:54:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:54:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:54:49] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 11:54:49] [INFO ] [Real]Added 70 Read/Feed constraints in 32 ms returned sat
[2024-06-01 11:54:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:54:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:54:49] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-01 11:54:49] [INFO ] [Nat]Added 70 Read/Feed constraints in 25 ms returned sat
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:54:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 328 ms
[2024-06-01 11:54:50] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 18 ms.
[2024-06-01 11:54:50] [INFO ] Added : 19 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 126 ms.
[2024-06-01 11:54:50] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:54:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 11:54:50] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-06-01 11:54:50] [INFO ] [Real]Added 70 Read/Feed constraints in 25 ms returned sat
[2024-06-01 11:54:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:54:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 11:54:50] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 11:54:50] [INFO ] [Nat]Added 70 Read/Feed constraints in 34 ms returned sat
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 11:54:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-06-01 11:54:50] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 16 ms.
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 3 ms to minimize.
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-06-01 11:54:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 344 ms
[2024-06-01 11:54:51] [INFO ] Added : 25 causal constraints over 6 iterations in 533 ms. Result :sat
Minimization took 167 ms.
[2024-06-01 11:54:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 11:54:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:54:51] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 11:54:51] [INFO ] [Real]Added 70 Read/Feed constraints in 22 ms returned sat
[2024-06-01 11:54:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 11:54:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 11:54:51] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 11:54:51] [INFO ] [Nat]Added 70 Read/Feed constraints in 26 ms returned sat
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 3 ms to minimize.
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 3 ms to minimize.
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 655 ms
[2024-06-01 11:54:52] [INFO ] Computed and/alt/rep : 28/72/28 causal constraints (skipped 110 transitions) in 17 ms.
[2024-06-01 11:54:52] [INFO ] Added : 16 causal constraints over 4 iterations in 119 ms. Result :sat
Minimization took 195 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[10, 10, 1, 10]
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 19 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 102/102 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Applied a total of 0 rules in 18 ms. Remains 102 /102 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-01 11:54:52] [INFO ] Invariant cache hit.
[2024-06-01 11:54:53] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 11:54:53] [INFO ] Invariant cache hit.
[2024-06-01 11:54:53] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-01 11:54:53] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2024-06-01 11:54:53] [INFO ] Redundant transitions in 7 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 11:54:53] [INFO ] Invariant cache hit.
[2024-06-01 11:54:53] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 11:54:56] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 11:54:56] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 139/241 variables, 102/108 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 70/178 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 11:55:00] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 1/179 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/179 constraints. Problems are: Problem set: 7 solved, 131 unsolved
[2024-06-01 11:55:02] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/241 variables, 1/180 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/180 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 0/241 variables, 0/180 constraints. Problems are: Problem set: 7 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 180 constraints, problems are : Problem set: 7 solved, 131 unsolved in 13690 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 7 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/4 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 2/94 variables, 2/6 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/8 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/8 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 139/233 variables, 94/102 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 70/172 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 8/180 constraints. Problems are: Problem set: 7 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/180 constraints. Problems are: Problem set: 7 solved, 131 unsolved
Problem TDEAD125 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
At refinement iteration 10 (OVERLAPS) 8/241 variables, 8/188 constraints. Problems are: Problem set: 10 solved, 128 unsolved
Problem TDEAD116 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 123/311 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 0/311 constraints. Problems are: Problem set: 17 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/241 variables, 0/311 constraints. Problems are: Problem set: 17 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 311 constraints, problems are : Problem set: 17 solved, 121 unsolved in 14735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 131/138 constraints, Known Traps: 4/4 constraints]
After SMT, in 28976ms problems are : Problem set: 17 solved, 121 unsolved
Search for dead transitions found 17 dead transitions in 28997ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/102 places, 122/139 transitions.
Graph (complete) has 252 edges and 102 vertex of which 68 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 0 output transitions
Reduce places removed 8 places and 47 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 60 transition count 57
Reduce places removed 9 places and 11 transitions.
Graph (complete) has 119 edges and 51 vertex of which 4 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 46 output transitions
Drop transitions (Output transitions of discarded places.) removed 46 transitions
Iterating post reduction 1 with 10 rules applied. Total rules applied 37 place count 4 transition count 0
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 37 rules in 8 ms. Remains 4 /102 variables (removed 98) and now considering 0/122 (removed 122) transitions.
[2024-06-01 11:55:22] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 11:55:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 11:55:22] [INFO ] Invariant cache hit.
[2024-06-01 11:55:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 4/102 places, 0/139 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29710 ms. Remains : 4/102 places, 0/139 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 64192 ms.
ITS solved all properties within timeout

BK_STOP 1717242922673

--------------------
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="SieveSingleMsgMbox-PT-d1m04"
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 SieveSingleMsgMbox-PT-d1m04, 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 r532-smll-171683810700053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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