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.r126-tajo-158961390000193.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 PhilosophersDyn-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390000193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 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 PhilosophersDyn-COL-03-00
FORMULA_NAME PhilosophersDyn-COL-03-01
FORMULA_NAME PhilosophersDyn-COL-03-02
FORMULA_NAME PhilosophersDyn-COL-03-03
FORMULA_NAME PhilosophersDyn-COL-03-04
FORMULA_NAME PhilosophersDyn-COL-03-05
FORMULA_NAME PhilosophersDyn-COL-03-06
FORMULA_NAME PhilosophersDyn-COL-03-07
FORMULA_NAME PhilosophersDyn-COL-03-08
FORMULA_NAME PhilosophersDyn-COL-03-09
FORMULA_NAME PhilosophersDyn-COL-03-10
FORMULA_NAME PhilosophersDyn-COL-03-11
FORMULA_NAME PhilosophersDyn-COL-03-12
FORMULA_NAME PhilosophersDyn-COL-03-13
FORMULA_NAME PhilosophersDyn-COL-03-14
FORMULA_NAME PhilosophersDyn-COL-03-15

=== Now, execution of the tool begins

BK_START 1589791738427

[2020-05-18 08:49:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-18 08:49:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-18 08:49:00] [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-18 08:49:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 495 ms
[2020-05-18 08:49:00] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2020-05-18 08:49:00] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 15 ms.
[2020-05-18 08:49:00] [INFO ] Computed order based on color domains.
[2020-05-18 08:49:00] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 10 ms.
[2020-05-18 08:49:00] [INFO ] Unfolded HLPN properties in 1 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14313 resets, run finished after 219 ms. (steps per millisecond=456 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1]
[2020-05-18 08:49:01] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 08:49:01] [INFO ] Computed 11 place invariants in 4 ms
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive place invariants in 22 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned unsat
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned unsat
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned unsat
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-05-18 08:49:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-05-18 08:49:01] [INFO ] [Real]Added 36 Read/Feed constraints in 14 ms returned sat
[2020-05-18 08:49:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:49:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Nat]Added 36 Read/Feed constraints in 11 ms returned sat
[2020-05-18 08:49:01] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 32 ms.
[2020-05-18 08:49:01] [INFO ] Added : 28 causal constraints over 6 iterations in 134 ms. Result :sat
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:01] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2020-05-18 08:49:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:49:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 0 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:01] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-05-18 08:49:01] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2020-05-18 08:49:02] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 10 ms.
[2020-05-18 08:49:02] [INFO ] Added : 30 causal constraints over 6 iterations in 85 ms. Result :sat
[2020-05-18 08:49:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:02] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-05-18 08:49:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-18 08:49:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:02] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-05-18 08:49:02] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 27 ms.
[2020-05-18 08:49:02] [INFO ] Added : 32 causal constraints over 7 iterations in 165 ms. Result :sat
[2020-05-18 08:49:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Real]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2020-05-18 08:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-18 08:49:02] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2020-05-18 08:49:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-05-18 08:49:02] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-18 08:49:02] [INFO ] Flatten gal took : 34 ms
FORMULA PhilosophersDyn-COL-03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-18 08:49:02] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
[2020-05-18 08:49:02] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-18 08:49:02] [INFO ] Flatten gal took : 35 ms
[2020-05-18 08:49:02] [INFO ] Input system was already deterministic with 81 transitions.
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/graph5983131596950894903.txt, -o, /tmp/graph5983131596950894903.bin, -w, /tmp/graph5983131596950894903.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/graph5983131596950894903.bin, -l, -1, -v, -w, /tmp/graph5983131596950894903.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-18 08:49:02] [INFO ] Decomposing Gal with order
[2020-05-18 08:49:02] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 57 out of 81 initially.
// Phase 1: matrix 57 rows 30 cols
[2020-05-18 08:49:02] [INFO ] Computed 11 place invariants in 2 ms
inv : Outside_2 + Think_2 + WaitRight_2 + HasRight_2 = 1
inv : Neighbourhood_0 - Neighbourhood_4 - Neighbourhood_5 - Neighbourhood_7 - Neighbourhood_8 + Outside_0 - Outside_1 - Outside_2 = -1
inv : Outside_0 + Think_0 + WaitLeft_0 + HasLeft_0 = 1
inv : Neighbourhood_1 + Neighbourhood_4 + Neighbourhood_7 + Outside_1 = 1
inv : Outside_1 + Think_1 + WaitRight_1 + HasRight_1 = 1
inv : Outside_0 + Think_0 + WaitRight_0 + HasRight_0 = 1
inv : Neighbourhood_2 + Neighbourhood_5 + Neighbourhood_8 + Outside_2 = 1
inv : Outside_2 + Think_2 + WaitLeft_2 + HasLeft_2 = 1
inv : Outside_1 + Think_1 + WaitLeft_1 + HasLeft_1 = 1
inv : Neighbourhood_6 + Neighbourhood_7 + Neighbourhood_8 + Outside_2 = 1
inv : Neighbourhood_3 + Neighbourhood_4 + Neighbourhood_5 + Outside_1 = 1
Total of 11 invariants.
[2020-05-18 08:49:02] [INFO ] Computed 11 place invariants in 2 ms
[2020-05-18 08:49:02] [INFO ] Removed a total of 204 redundant transitions.
[2020-05-18 08:49:02] [INFO ] Flatten gal took : 81 ms
[2020-05-18 08:49:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 8 ms.
[2020-05-18 08:49:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 3 ms
[2020-05-18 08:49:02] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 11 LTL properties
Checking formula 0 : !((G(F(!(G(("(((((((((gu0.Neighbourhood_0+gu0.Neighbourhood_1)+gu0.Neighbourhood_2)+gu0.Neighbourhood_3)+gu0.Neighbourhood_4)+gu0.Neighbourhood_5)+gu0.Neighbourhood_6)+gu0.Neighbourhood_7)+gu0.Neighbourhood_8)<=((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2))")U("(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2))")))))))
Formula 0 simplified : !GF!G("(((((((((gu0.Neighbourhood_0+gu0.Neighbourhood_1)+gu0.Neighbourhood_2)+gu0.Neighbourhood_3)+gu0.Neighbourhood_4)+gu0.Neighbourhood_5)+gu0.Neighbourhood_6)+gu0.Neighbourhood_7)+gu0.Neighbourhood_8)<=((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2))" U "(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2))")
[2020-05-18 08:49:03] [INFO ] Proved 30 variables to be positive in 287 ms
[2020-05-18 08:49:03] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2020-05-18 08:49:03] [INFO ] Computation of disable matrix completed :0/81 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 08:49:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-18 08:49:03] [INFO ] Computing symmetric may enable matrix : 81 transitions.
Reverse transition relation is NOT exact ! Due to transitions Leavel1r0p2, Leavel1r1p1, Leavel1r2p0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :18/27/3/48
Computing Next relation with stutter on 45 deadlock states
[2020-05-18 08:49:03] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
12 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.155909,21004,1,0,82,15871,116,47,1973,14183,150
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G((X(G("(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)>=1)")))||("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<3)")))))
Formula 1 simplified : !XG("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<3)" | XG"(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)>=1)")
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 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.193361,22264,1,0,94,20188,122,63,1985,20326,189
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((F("(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))"))U(F(((G(X("(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)>=2)")))&&("(((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2)>=3)"))&&("(((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2)>((gu7.HasRight_0+gu7.HasRight_1)+gu7.HasRight_2))"))))))
Formula 2 simplified : !X(F"(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))" U F("(((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2)>((gu7.HasRight_0+gu7.HasRight_1)+gu7.HasRight_2))" & "(((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2)>=3)" & GX"(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)>=2)"))
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 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.21698,24712,1,0,104,22762,142,77,2068,23759,236
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((G((G(F("(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)<=((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))")))&&("(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)>((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))")))||("(((((((((gu0.Neighbourhood_0+gu0.Neighbourhood_1)+gu0.Neighbourhood_2)+gu0.Neighbourhood_3)+gu0.Neighbourhood_4)+gu0.Neighbourhood_5)+gu0.Neighbourhood_6)+gu0.Neighbourhood_7)+gu0.Neighbourhood_8)<1)")))))
Formula 3 simplified : !XF("(((((((((gu0.Neighbourhood_0+gu0.Neighbourhood_1)+gu0.Neighbourhood_2)+gu0.Neighbourhood_3)+gu0.Neighbourhood_4)+gu0.Neighbourhood_5)+gu0.Neighbourhood_6)+gu0.Neighbourhood_7)+gu0.Neighbourhood_8)<1)" | G("(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)>((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))" & GF"(((gi2.gu5.WaitRight_0+gi2.gu5.WaitRight_1)+gi2.gu5.WaitRight_2)<=((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))"))
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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.246621,25716,1,0,114,25832,160,87,2174,28642,278
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((X("(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=2)"))U(F("((((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=3)&&(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=2))")))))
Formula 4 simplified : !F(X"(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=2)" U F"((((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=3)&&(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=2))")
Computing Next relation with stutter on 45 deadlock states
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.252238,25980,1,0,120,26016,169,101,2190,29452,320
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((X("(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=2)"))U("(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<2)"))U("(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=2)")))
Formula 5 simplified : !((X"(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=2)" U "(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<2)") U "(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=2)")
Computing Next relation with stutter on 45 deadlock states
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.253552,26500,1,0,120,26016,181,101,2203,29452,329
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F("(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=3)"))&&(X(F(G((X("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)>=1)"))&&((("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)>=1)")U("(((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))"))U(X("(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))")))))))))
Formula 6 simplified : !(F"(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=3)" & XFG(X"(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)>=1)" & (("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)>=1)" U "(((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))") U X"(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))")))
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 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.259222,26984,1,0,120,26138,190,101,2210,29632,352
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F(F("(((gu7.HasRight_0+gu7.HasRight_1)+gu7.HasRight_2)>=1)")))))
Formula 7 simplified : !GF"(((gu7.HasRight_0+gu7.HasRight_1)+gu7.HasRight_2)>=1)"
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 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.283052,27744,1,0,138,29521,199,117,2217,34227,400
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(((("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2))")U("(((gu7.HasRight_0+gu7.HasRight_1)+gu7.HasRight_2)<3)"))||("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2))"))U("(((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2)<2)"))))
Formula 8 simplified : !G(("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2))" | ("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2))" U "(((gu7.HasRight_0+gu7.HasRight_1)+gu7.HasRight_2)<3)")) U "(((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2)<2)")
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 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.296834,28272,1,0,142,30537,229,119,2314,35225,443
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(((F(X(G((X("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))"))||("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))")))))U("(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))"))U(!(X(F("(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=2)")))))))
Formula 9 simplified : !G((FXG("(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))" | X"(((gi1.gu1.Outside_0+gi1.gu1.Outside_1)+gi1.gu1.Outside_2)<=((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))") U "(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)<=((gi2.gu4.WaitLeft_0+gi2.gu4.WaitLeft_1)+gi2.gu4.WaitLeft_2))") U !XF"(((gi2.gu6.HasLeft_0+gi2.gu6.HasLeft_1)+gi2.gu6.HasLeft_2)>=2)")
Computing Next relation with stutter on 45 deadlock states
8 unique states visited
8 strongly connected components in search stack
10 transitions explored
8 items max in DFS search stack
6 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.358068,30108,1,0,173,36260,246,152,2385,45071,533
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)<3)")U(("(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=3)")U("(((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2)>((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))"))))
Formula 10 simplified : !("(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)<3)" U ("(((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2)>=3)" U "(((gi1.gu2.Think_0+gi1.gu2.Think_1)+gi1.gu2.Think_2)>((gi1.gu3.Forks_0+gi1.gu3.Forks_1)+gi1.gu3.Forks_2))"))
Computing Next relation with stutter on 45 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3 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.387588,31160,1,0,195,39939,261,172,2432,50939,596
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA PhilosophersDyn-COL-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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-18 08:49:03] [INFO ] Built C files in 865ms 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 1589791743848

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="PhilosophersDyn-COL-03"
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"

# 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 PhilosophersDyn-COL-03, 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 r126-tajo-158961390000193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 ;