fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271820400107
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for IOTPpurchase-PT-C01M01P01D01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
273.323 9378.00 16559.00 345.60 TTTTFTTTTTFFTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820400107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IOTPpurchase-PT-C01M01P01D01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.9K Apr 29 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 29 18:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 63K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652745784896

Running Version 202205111006
[2022-05-17 00:03:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 00:03:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:03:06] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-17 00:03:06] [INFO ] Transformed 111 places.
[2022-05-17 00:03:06] [INFO ] Transformed 45 transitions.
[2022-05-17 00:03:06] [INFO ] Found NUPN structural information;
[2022-05-17 00:03:06] [INFO ] Parsed PT model containing 111 places and 45 transitions in 178 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 35 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 70 transition count 45
Applied a total of 41 rules in 22 ms. Remains 70 /111 variables (removed 41) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 70 cols
[2022-05-17 00:03:06] [INFO ] Computed 26 place invariants in 11 ms
[2022-05-17 00:03:06] [INFO ] Implicit Places using invariants in 183 ms returned [10, 13, 18, 26, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 210 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 56/111 places, 45/45 transitions.
Support contains 16 out of 56 places after structural reductions.
[2022-05-17 00:03:06] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-17 00:03:06] [INFO ] Flatten gal took : 21 ms
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-17 00:03:06] [INFO ] Flatten gal took : 8 ms
[2022-05-17 00:03:06] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 45 rows 56 cols
[2022-05-17 00:03:07] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-17 00:03:08] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2022-05-17 00:03:08] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 00:03:08] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Ensure Unique test removed 1 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 52 transition count 17
Reduce places removed 29 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 22 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 19 transition count 14
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 67 place count 19 transition count 9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 78 place count 13 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 79 place count 12 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 10 transition count 7
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 93 place count 4 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 96 place count 2 transition count 2
Applied a total of 96 rules in 16 ms. Remains 2 /56 variables (removed 54) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:03:08] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:03:08] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-17 00:03:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:08] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 00:03:08] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/56 places, 2/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/56 places, 2/45 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25222 reset in 197 ms.
Product exploration explored 100000 steps with 25025 reset in 85 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:03:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 00:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:03:09] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:03:09] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:03:09] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:03:09] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-17 00:03:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:09] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-17 00:03:09] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:03:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:03:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 00:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 00:03:09] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 00:03:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25102 reset in 94 ms.
Product exploration explored 100000 steps with 25128 reset in 76 ms.
Built C files in :
/tmp/ltsmin11406670483677563266
[2022-05-17 00:03:10] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2022-05-17 00:03:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:10] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2022-05-17 00:03:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:10] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2022-05-17 00:03:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11406670483677563266
Running compilation step : cd /tmp/ltsmin11406670483677563266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 142 ms.
Running link step : cd /tmp/ltsmin11406670483677563266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11406670483677563266;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14532273726611958354.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 finished in 2251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(G((F(p0)&&p1))))||G(F(X(p2)))))'
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Ensure Unique test removed 1 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 52 transition count 20
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 27 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 26 transition count 19
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 55 place count 26 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 67 place count 19 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 13 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 10 transition count 8
Applied a total of 82 rules in 10 ms. Remains 10 /56 variables (removed 46) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-17 00:03:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 00:03:10] [INFO ] Implicit Places using invariants in 24 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/56 places, 8/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 9/56 places, 8/45 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s8 1), p2:(OR (EQ s0 0) (EQ s2 1)), p0:(OR (EQ s6 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9884 reset in 149 ms.
Product exploration explored 100000 steps with 10024 reset in 81 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 378 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:03:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:11] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-05-17 00:03:11] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 11 factoid took 1096 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:03:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 00:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-17 00:03:13] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:03:13] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:03:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:13] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:03:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:13] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-17 00:03:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:03:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (X p2), (X (X p2))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p2)]
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:03:13] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:03:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-17 00:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:03:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 00:03:13] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 00:03:13] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10197 reset in 55 ms.
Product exploration explored 100000 steps with 9940 reset in 52 ms.
Built C files in :
/tmp/ltsmin7634035762139098580
[2022-05-17 00:03:13] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-17 00:03:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:13] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-17 00:03:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:13] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-17 00:03:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:03:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7634035762139098580
Running compilation step : cd /tmp/ltsmin7634035762139098580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin7634035762139098580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin7634035762139098580;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1317979894052576763.hoa' '--buchi-type=spotba'
LTSmin run took 36 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 finished in 3671 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 45/45 transitions.
Ensure Unique test removed 1 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 53 transition count 23
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 29 transition count 20
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 26 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 24 transition count 18
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 58 place count 24 transition count 12
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 72 place count 16 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 75 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 77 place count 13 transition count 10
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 88 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 91 place count 5 transition count 4
Applied a total of 91 rules in 6 ms. Remains 5 /56 variables (removed 51) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 00:03:14] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:03:14] [INFO ] Implicit Places using invariants in 22 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/56 places, 4/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 4/56 places, 4/45 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10 finished in 138 ms.
All properties solved by simple procedures.
Total runtime 8082 ms.

BK_STOP 1652745794274

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="IOTPpurchase-PT-C01M01P01D01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C01M01P01D01, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271820400107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;