Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814000226.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DatabaseWithMutex-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814000226
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.0K Mar 31 05:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 05:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 29 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 28 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 27 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 19K Mar 24 05:37 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 DatabaseWithMutex-COL-02-00
FORMULA_NAME DatabaseWithMutex-COL-02-01
FORMULA_NAME DatabaseWithMutex-COL-02-02
FORMULA_NAME DatabaseWithMutex-COL-02-03
FORMULA_NAME DatabaseWithMutex-COL-02-04
FORMULA_NAME DatabaseWithMutex-COL-02-05
FORMULA_NAME DatabaseWithMutex-COL-02-06
FORMULA_NAME DatabaseWithMutex-COL-02-07
FORMULA_NAME DatabaseWithMutex-COL-02-08
FORMULA_NAME DatabaseWithMutex-COL-02-09
FORMULA_NAME DatabaseWithMutex-COL-02-10
FORMULA_NAME DatabaseWithMutex-COL-02-11
FORMULA_NAME DatabaseWithMutex-COL-02-12
FORMULA_NAME DatabaseWithMutex-COL-02-13
FORMULA_NAME DatabaseWithMutex-COL-02-14
FORMULA_NAME DatabaseWithMutex-COL-02-15

=== Now, execution of the tool begins

BK_START 1590103675549

[2020-05-21 23:27:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 23:27:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 23:27:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-21 23:27:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 511 ms
[2020-05-21 23:27:57] [INFO ] sort/places :
site->all_active,all_passive,
file->Mutex,
SF->RecBuff,Active,Message,Modify,MesBuffReply,Acknowledge,updating,WaitMutex,

[2020-05-21 23:27:57] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 14 ms.
[2020-05-21 23:27:57] [INFO ] Computed order based on color domains.
[2020-05-21 23:27:57] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions in 5 ms.
[2020-05-21 23:27:57] [INFO ] Unfolded HLPN properties in 0 ms.
[2020-05-21 23:27:57] [INFO ] Reduced 2 identical enabling conditions.
[2020-05-21 23:27:57] [INFO ] Reduced 2 identical enabling conditions.
[2020-05-21 23:27:57] [INFO ] Reduced 2 identical enabling conditions.
[2020-05-21 23:27:57] [INFO ] Reduced 2 identical enabling conditions.
[2020-05-21 23:27:57] [INFO ] Reduced 2 identical enabling conditions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 106 steps, including 0 resets, run visited all 37 properties in 5 ms. (steps per millisecond=21 )
[2020-05-21 23:27:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-21 23:27:57] [INFO ] Flatten gal took : 23 ms
FORMULA DatabaseWithMutex-COL-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 23:27:57] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 23:27:57] [INFO ] Applying decomposition
[2020-05-21 23:27:57] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph9027533076099653094.txt, -o, /tmp/graph9027533076099653094.bin, -w, /tmp/graph9027533076099653094.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph9027533076099653094.bin, -l, -1, -v, -w, /tmp/graph9027533076099653094.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 23:27:57] [INFO ] Input system was already deterministic with 32 transitions.
[2020-05-21 23:27:57] [INFO ] Decomposing Gal with order
[2020-05-21 23:27:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 23:27:58] [INFO ] Removed a total of 2 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 32 rows 38 cols
[2020-05-21 23:27:58] [INFO ] Computed 10 place invariants in 4 ms
inv : -RecBuff_3 + Active_1 - Message_3 - MesBuffReply_3 - Acknowledge_3 - updating_3 = 0
inv : -RecBuff_1 - RecBuff_3 - all_active_0 - all_active_1 + Mutex_0 - Message_1 - Message_3 - Modify_1 - Modify_3 - MesBuffReply_1 - MesBuffReply_3 - Acknowledge_1 - Acknowledge_3 - updating_1 - updating_3 - WaitMutex_0 - WaitMutex_1 - WaitMutex_2 - WaitMutex_3 = -1
inv : all_passive_0 + updating_0 + updating_1 = 1
inv : RecBuff_0 + RecBuff_1 + all_active_1 + Message_0 + Message_1 + Modify_2 + Modify_3 + MesBuffReply_0 + MesBuffReply_1 + Acknowledge_0 + Acknowledge_1 + updating_0 + updating_1 + WaitMutex_2 + WaitMutex_3 = 1
inv : RecBuff_1 + all_active_1 + Active_2 + Message_1 + Modify_2 + Modify_3 + MesBuffReply_1 + Acknowledge_1 + updating_1 + WaitMutex_2 + WaitMutex_3 = 1
inv : RecBuff_1 + RecBuff_3 + Mutex_1 + Message_1 + Message_3 + Modify_1 + Modify_3 + MesBuffReply_1 + MesBuffReply_3 + Acknowledge_1 + Acknowledge_3 + updating_1 + updating_3 = 1
inv : RecBuff_2 + RecBuff_3 + all_active_0 + Message_2 + Message_3 + Modify_0 + Modify_1 + MesBuffReply_2 + MesBuffReply_3 + Acknowledge_2 + Acknowledge_3 + updating_2 + updating_3 + WaitMutex_0 + WaitMutex_1 = 1
inv : -RecBuff_1 + Active_3 - Message_1 - MesBuffReply_1 - Acknowledge_1 - updating_1 = 0
inv : all_passive_1 + updating_2 + updating_3 = 1
inv : RecBuff_3 + all_active_0 + Active_0 + Message_3 + Modify_0 + Modify_1 + MesBuffReply_3 + Acknowledge_3 + updating_3 + WaitMutex_0 + WaitMutex_1 = 1
Total of 10 invariants.
[2020-05-21 23:27:58] [INFO ] Flatten gal took : 51 ms
[2020-05-21 23:27:58] [INFO ] Computed 10 place invariants in 9 ms
[2020-05-21 23:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-21 23:27:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-21 23:27:58] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((X(X(((!(G("((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1))")))||(G("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))")))||("(((((u2.RecBuff_3<1)||(i5.u13.all_passive_1<1))&&((i6.u0.RecBuff_0<1)||(i4.u12.all_passive_0<1)))&&((i5.u1.RecBuff_2<1)||(i5.u13.all_passive_1<1)))&&((i1.u4.RecBuff_1<1)||(i4.u12.all_passive_0<1)))")))))
Formula 0 simplified : !XX("(((((u2.RecBuff_3<1)||(i5.u13.all_passive_1<1))&&((i6.u0.RecBuff_0<1)||(i4.u12.all_passive_0<1)))&&((i5.u1.RecBuff_2<1)||(i5.u13.all_passive_1<1)))&&((i1.u4.RecBuff_1<1)||(i4.u12.all_passive_0<1)))" | !G"((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1))" | G"((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))")
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.027527,16892,1,0,443,67,391,432,72,120,1063
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(F(X(X(((((G("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))"))||("(i6.u0.Message_0>=1)"))||("(i1.u4.Message_1>=1)"))||("(i5.u1.Message_2>=1)"))||("(u2.Message_3>=1)"))))))))
Formula 1 simplified : !XGFXX("(i1.u4.Message_1>=1)" | "(i5.u1.Message_2>=1)" | "(i6.u0.Message_0>=1)" | "(u2.Message_3>=1)" | G"((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))")
[2020-05-21 23:27:58] [INFO ] Proved 38 variables to be positive in 98 ms
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.039999,18412,1,0,1887,78,558,1608,76,158,4988
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G("((((i2.u5.Modify_0<1)&&(i1.u6.Modify_1<1))&&(i6.u7.Modify_2<1))&&(i1.u3.Modify_3<1))"))||((X("((i2.u14.all_active_0<1)&&(i6.u15.all_active_1<1))"))U(("((i2.u14.all_active_0>=1)||(i6.u15.all_active_1>=1))")U("(((((((((i1.u6.Mutex_1>=1)&&(i6.u15.WaitMutex_3>=1))||((i2.u5.Mutex_0>=1)&&(i6.u15.WaitMutex_2>=1)))||((i2.u5.Mutex_0>=1)&&(i2.u14.WaitMutex_0>=1)))||((i1.u6.Mutex_1>=1)&&(i2.u14.WaitMutex_1>=1)))||(i2.u5.Modify_0>=1))||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))")))))
Formula 2 simplified : !(G"((((i2.u5.Modify_0<1)&&(i1.u6.Modify_1<1))&&(i6.u7.Modify_2<1))&&(i1.u3.Modify_3<1))" | (X"((i2.u14.all_active_0<1)&&(i6.u15.all_active_1<1))" U ("((i2.u14.all_active_0>=1)||(i6.u15.all_active_1>=1))" U "(((((((((i1.u6.Mutex_1>=1)&&(i6.u15.WaitMutex_3>=1))||((i2.u5.Mutex_0>=1)&&(i6.u15.WaitMutex_2>=1)))||((i2.u5.Mutex_0>=1)&&(i2.u14.WaitMutex_0>=1)))||((i1.u6.Mutex_1>=1)&&(i2.u14.WaitMutex_1>=1)))||(i2.u5.Modify_0>=1))||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))")))
[2020-05-21 23:27:58] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2020-05-21 23:27:58] [INFO ] Computation of disable matrix completed :0/32 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 23:27:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 23:27:58] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2020-05-21 23:27:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.046049,19408,1,0,1891,78,764,1614,76,158,5162
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(!(F("(((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))||(((((i1.u6.Mutex_1<1)||(i6.u15.WaitMutex_3<1))&&((i2.u5.Mutex_0<1)||(i6.u15.WaitMutex_2<1)))&&((i2.u5.Mutex_0<1)||(i2.u14.WaitMutex_0<1)))&&((i1.u6.Mutex_1<1)||(i2.u14.WaitMutex_1<1))))"))))))
Formula 3 simplified : !XG!F"(((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))||(((((i1.u6.Mutex_1<1)||(i6.u15.WaitMutex_3<1))&&((i2.u5.Mutex_0<1)||(i6.u15.WaitMutex_2<1)))&&((i2.u5.Mutex_0<1)||(i2.u14.WaitMutex_0<1)))&&((i1.u6.Mutex_1<1)||(i2.u14.WaitMutex_1<1))))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.051766,19408,1,0,2326,85,810,2081,77,182,6669
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(!(F(X(F(X(X((F("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))"))&&(G(!(F(G("((i2.u14.all_active_0>=1)||(i6.u15.all_active_1>=1))"))))))))))))))
Formula 4 simplified : !G!FXFXX(F"((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))" & G!FG"((i2.u14.all_active_0>=1)||(i6.u15.all_active_1>=1))")
12 unique states visited
12 strongly connected components in search stack
12 transitions explored
12 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.063683,19912,1,0,4041,85,854,3454,77,185,11015
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(X(!(X(X(!(F(X(G("((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))")))))))))))
Formula 5 simplified : !GX!XX!FXG"((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.069164,20440,1,0,4668,85,881,4116,77,185,12715
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((G(X((F("((((i4.u8.MesBuffReply_0<1)&&(i4.u10.MesBuffReply_1<1))&&(u11.MesBuffReply_2<1))&&(i5.u9.MesBuffReply_3<1))"))&&(X(X("(((((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))||((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1)))||((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1)))||((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1)))"))))))U(((((F("(((((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))||((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1)))||((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1)))||((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1)))"))||("((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))"))||("((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1))"))||("((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1))"))||("((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1))"))))
Formula 6 simplified : !(GX(F"((((i4.u8.MesBuffReply_0<1)&&(i4.u10.MesBuffReply_1<1))&&(u11.MesBuffReply_2<1))&&(i5.u9.MesBuffReply_3<1))" & XX"(((((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))||((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1)))||((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1)))||((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1)))") U ("((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1))" | "((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1))" | "((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1))" | "((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))" | F"(((((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))||((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1)))||((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1)))||((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1)))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.0745,20688,1,0,4981,85,937,4303,77,185,13729
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F("(((((i1.u6.Mutex_1>=1)&&(i6.u15.WaitMutex_3>=1))||((i2.u5.Mutex_0>=1)&&(i6.u15.WaitMutex_2>=1)))||((i2.u5.Mutex_0>=1)&&(i2.u14.WaitMutex_0>=1)))||((i1.u6.Mutex_1>=1)&&(i2.u14.WaitMutex_1>=1)))"))))
Formula 7 simplified : !XF"(((((i1.u6.Mutex_1>=1)&&(i6.u15.WaitMutex_3>=1))||((i2.u5.Mutex_0>=1)&&(i6.u15.WaitMutex_2>=1)))||((i2.u5.Mutex_0>=1)&&(i2.u14.WaitMutex_0>=1)))||((i1.u6.Mutex_1>=1)&&(i2.u14.WaitMutex_1>=1)))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.075259,20688,1,0,4981,85,950,4303,77,185,13745
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((((("(((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))")U("((((i4.u8.MesBuffReply_0>=1)||(i4.u10.MesBuffReply_1>=1))||(u11.MesBuffReply_2>=1))||(i5.u9.MesBuffReply_3>=1))"))U("(((((i1.u6.Mutex_1>=1)&&(i6.u15.WaitMutex_3>=1))||((i2.u5.Mutex_0>=1)&&(i6.u15.WaitMutex_2>=1)))||((i2.u5.Mutex_0>=1)&&(i2.u14.WaitMutex_0>=1)))||((i1.u6.Mutex_1>=1)&&(i2.u14.WaitMutex_1>=1)))"))||(F("((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))"))))
Formula 8 simplified : !((("(((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))" U "((((i4.u8.MesBuffReply_0>=1)||(i4.u10.MesBuffReply_1>=1))||(u11.MesBuffReply_2>=1))||(i5.u9.MesBuffReply_3>=1))") U "(((((i1.u6.Mutex_1>=1)&&(i6.u15.WaitMutex_3>=1))||((i2.u5.Mutex_0>=1)&&(i6.u15.WaitMutex_2>=1)))||((i2.u5.Mutex_0>=1)&&(i2.u14.WaitMutex_0>=1)))||((i1.u6.Mutex_1>=1)&&(i2.u14.WaitMutex_1>=1)))") | F"((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.077833,20688,1,0,4997,85,1018,4319,77,185,13928
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(X(("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))")U("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))"))))))
Formula 9 simplified : XX"((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.078203,20688,1,0,4997,85,1018,4319,77,185,13934
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(G((F((("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))")U(G("((((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))&&((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1)))")))&&(F("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))"))))&&(G("((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))"))))))
Formula 10 simplified : !XG(F(("((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))" U G"((((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))&&((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1)))") & F"((((i5.u13.updating_2>=1)||(i5.u13.updating_3>=1))||(i4.u12.updating_0>=1))||(i4.u12.updating_1>=1))") & G"((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.081064,20688,1,0,5004,85,1045,4324,77,185,13990
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((!(G(((((!(G("((i2.u14.all_active_0>=1)||(i6.u15.all_active_1>=1))")))&&("((i1.u6.Mutex_1<1)||(i6.u15.WaitMutex_3<1))"))&&("((i2.u5.Mutex_0<1)||(i6.u15.WaitMutex_2<1))"))&&("((i2.u5.Mutex_0<1)||(i2.u14.WaitMutex_0<1))"))&&("((i1.u6.Mutex_1<1)||(i2.u14.WaitMutex_1<1))"))))||((G(X("((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1))")))&&(X("((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1))")))))
Formula 11 simplified : !(!G("((i1.u6.Mutex_1<1)||(i2.u14.WaitMutex_1<1))" & "((i1.u6.Mutex_1<1)||(i6.u15.WaitMutex_3<1))" & "((i2.u5.Mutex_0<1)||(i2.u14.WaitMutex_0<1))" & "((i2.u5.Mutex_0<1)||(i6.u15.WaitMutex_2<1))" & !G"((i2.u14.all_active_0>=1)||(i6.u15.all_active_1>=1))") | (X"((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1))" & GX"((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1))"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.082852,20688,1,0,5015,85,1094,4335,77,185,14095
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(X((F(X(("(((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))")U(X(X("((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))"))))))&&(G("(((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))"))))))
Formula 12 simplified : X(FX("(((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))" U XX"((((i2.u5.Modify_0>=1)||(i1.u6.Modify_1>=1))||(i6.u7.Modify_2>=1))||(i1.u3.Modify_3>=1))") & G"(((((i6.u7.Active_2>=1)&&(i4.u8.Acknowledge_0>=1))||((i1.u3.Active_3>=1)&&(i4.u10.Acknowledge_1>=1)))||((i2.u5.Active_0>=1)&&(u11.Acknowledge_2>=1)))||((i1.u6.Active_1>=1)&&(i5.u9.Acknowledge_3>=1)))")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.083648,20688,1,0,5015,85,1095,4335,77,185,14096
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((!(F("((i2.u14.all_active_0<1)&&(i6.u15.all_active_1<1))")))U("((((((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))||((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1)))||((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1)))||((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1)))&&((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1)))")))
Formula 13 simplified : !(!F"((i2.u14.all_active_0<1)&&(i6.u15.all_active_1<1))" U "((((((u2.RecBuff_3>=1)&&(i5.u13.all_passive_1>=1))||((i6.u0.RecBuff_0>=1)&&(i4.u12.all_passive_0>=1)))||((i5.u1.RecBuff_2>=1)&&(i5.u13.all_passive_1>=1)))||((i1.u4.RecBuff_1>=1)&&(i4.u12.all_passive_0>=1)))&&((((i6.u0.Message_0>=1)||(i1.u4.Message_1>=1))||(i5.u1.Message_2>=1))||(u2.Message_3>=1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.087146,20940,1,0,5312,85,1129,4570,77,185,15095
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-21 23:27:58] [WARNING] Script execution failed on command (assert (and (>= (select s0 17) 1) (= (store (store (store s0 17 (- (select s0 17) 1)) 7 (+ (select s0 7) 1)) 15 (+ (select s0 15) 1)) s1))) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 23:27:58] [INFO ] Built C files in 250ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590103678384

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="DatabaseWithMutex-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 DatabaseWithMutex-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814000226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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