fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r130-smll-149441682900005
Last Updated
June 27, 2017

About the Execution of ITS-Tools for S_Peterson-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
522.810 14212.00 30927.00 427.80 TFTFFFTFFFTFFTTT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is S_Peterson-COL-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-149441682900005
=====================================================================


--------------------
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 Peterson-COL-2-LTLCardinality-0
FORMULA_NAME Peterson-COL-2-LTLCardinality-1
FORMULA_NAME Peterson-COL-2-LTLCardinality-10
FORMULA_NAME Peterson-COL-2-LTLCardinality-11
FORMULA_NAME Peterson-COL-2-LTLCardinality-12
FORMULA_NAME Peterson-COL-2-LTLCardinality-13
FORMULA_NAME Peterson-COL-2-LTLCardinality-14
FORMULA_NAME Peterson-COL-2-LTLCardinality-15
FORMULA_NAME Peterson-COL-2-LTLCardinality-2
FORMULA_NAME Peterson-COL-2-LTLCardinality-3
FORMULA_NAME Peterson-COL-2-LTLCardinality-4
FORMULA_NAME Peterson-COL-2-LTLCardinality-5
FORMULA_NAME Peterson-COL-2-LTLCardinality-6
FORMULA_NAME Peterson-COL-2-LTLCardinality-7
FORMULA_NAME Peterson-COL-2-LTLCardinality-8
FORMULA_NAME Peterson-COL-2-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496243268916


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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
Read 16 LTL properties
Checking formula 0 : !(("(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])<=(((((((((((((((((testAlone[0]+testAlone[1])+testAlone[2])+testAlone[3])+testAlone[4])+testAlone[5])+testAlone[6])+testAlone[7])+testAlone[8])+testAlone[9])+testAlone[10])+testAlone[11])+testAlone[12])+testAlone[13])+testAlone[14])+testAlone[15])+testAlone[16])+testAlone[17])"))
Formula 0 simplified : !"(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])<=(((((((((((((((((testAlone[0]+testAlone[1])+testAlone[2])+testAlone[3])+testAlone[4])+testAlone[5])+testAlone[6])+testAlone[7])+testAlone[8])+testAlone[9])+testAlone[10])+testAlone[11])+testAlone[12])+testAlone[13])+testAlone[14])+testAlone[15])+testAlone[16])+testAlone[17])"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 138 rows 108 cols
invariant : -1'idle[0] + 1'wantSection[0]= 0
invariant : -1'idle[1] + 1'wantSection[2]= 0
invariant : -1'idle[2] + 1'wantSection[4]= 0
invariant : 1'turn[0] + 1'turn[1] + 1'turn[2]= 1
invariant : 1'idle[1] + 1'askForSection[2] + 1'askForSection[3] + 1'testTurn[2] + 1'testTurn[3] + 1'beginLoop[6] + 1'beginLoop[7] + 1'beginLoop[8] + 1'beginLoop[9] + 1'beginLoop[10] + 1'beginLoop[11] + 1'endTurn[2] + 1'endTurn[3] + 1'CS[1] + 1'testIdentity[6] + 1'testIdentity[7] + 1'testIdentity[8] + 1'testIdentity[9] + 1'testIdentity[10] + 1'testIdentity[11] + 1'testAlone[6] + 1'testAlone[7] + 1'testAlone[8] + 1'testAlone[9] + 1'testAlone[10] + 1'testAlone[11] + 1'isEndLoop[6] + 1'isEndLoop[7] + 1'isEndLoop[8] + 1'isEndLoop[9] + 1'isEndLoop[10] + 1'isEndLoop[11]= 1
invariant : 1'idle[0] + 1'askForSection[0] + 1'askForSection[1] + 1'testTurn[0] + 1'testTurn[1] + 1'beginLoop[0] + 1'beginLoop[1] + 1'beginLoop[2] + 1'beginLoop[3] + 1'beginLoop[4] + 1'beginLoop[5] + 1'endTurn[0] + 1'endTurn[1] + 1'CS[0] + 1'testIdentity[0] + 1'testIdentity[1] + 1'testIdentity[2] + 1'testIdentity[3] + 1'testIdentity[4] + 1'testIdentity[5] + 1'testAlone[0] + 1'testAlone[1] + 1'testAlone[2] + 1'testAlone[3] + 1'testAlone[4] + 1'testAlone[5] + 1'isEndLoop[0] + 1'isEndLoop[1] + 1'isEndLoop[2] + 1'isEndLoop[3] + 1'isEndLoop[4] + 1'isEndLoop[5]= 1
invariant : 1'idle[1] + 1'wantSection[3]= 1
invariant : 1'idle[2] + 1'askForSection[4] + 1'askForSection[5] + 1'testTurn[4] + 1'testTurn[5] + 1'beginLoop[12] + 1'beginLoop[13] + 1'beginLoop[14] + 1'beginLoop[15] + 1'beginLoop[16] + 1'beginLoop[17] + 1'endTurn[4] + 1'endTurn[5] + 1'CS[2] + 1'testIdentity[12] + 1'testIdentity[13] + 1'testIdentity[14] + 1'testIdentity[15] + 1'testIdentity[16] + 1'testIdentity[17] + 1'testAlone[12] + 1'testAlone[13] + 1'testAlone[14] + 1'testAlone[15] + 1'testAlone[16] + 1'testAlone[17] + 1'isEndLoop[12] + 1'isEndLoop[13] + 1'isEndLoop[14] + 1'isEndLoop[15] + 1'isEndLoop[16] + 1'isEndLoop[17]= 1
invariant : 1'idle[0] + 1'wantSection[1]= 1
invariant : 1'idle[2] + 1'wantSection[5]= 1
invariant : 1'turn[3] + 1'turn[4] + 1'turn[5]= 1
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
186 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,1.91867,54124,1,0,254,131298,284,129,3142,126155,272
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X("(((((turn[0]+turn[1])+turn[2])+turn[3])+turn[4])+turn[5])<=(((((askForSection[0]+askForSection[1])+askForSection[2])+askForSection[3])+askForSection[4])+askForSection[5])"))))
Formula 1 simplified : !XX"(((((turn[0]+turn[1])+turn[2])+turn[3])+turn[4])+turn[5])<=(((((askForSection[0]+askForSection[1])+askForSection[2])+askForSection[3])+askForSection[4])+askForSection[5])"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
34 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,2.24903,62888,1,0,258,153286,293,129,3433,175751,293
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G(("(((((((((((((((((beginLoop[0]+beginLoop[1])+beginLoop[2])+beginLoop[3])+beginLoop[4])+beginLoop[5])+beginLoop[6])+beginLoop[7])+beginLoop[8])+beginLoop[9])+beginLoop[10])+beginLoop[11])+beginLoop[12])+beginLoop[13])+beginLoop[14])+beginLoop[15])+beginLoop[16])+beginLoop[17])>=2")U("((CS[0]+CS[1])+CS[2])<=(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])")))))
Formula 2 simplified : !G("(((((((((((((((((beginLoop[0]+beginLoop[1])+beginLoop[2])+beginLoop[3])+beginLoop[4])+beginLoop[5])+beginLoop[6])+beginLoop[7])+beginLoop[8])+beginLoop[9])+beginLoop[10])+beginLoop[11])+beginLoop[12])+beginLoop[13])+beginLoop[14])+beginLoop[15])+beginLoop[16])+beginLoop[17])>=2" U "((CS[0]+CS[1])+CS[2])<=(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])")
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
364 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,5.89744,136992,1,0,428,450070,306,191,3710,547672,609
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X("((CS[0]+CS[1])+CS[2])<=(((((((((((((((((isEndLoop[0]+isEndLoop[1])+isEndLoop[2])+isEndLoop[3])+isEndLoop[4])+isEndLoop[5])+isEndLoop[6])+isEndLoop[7])+isEndLoop[8])+isEndLoop[9])+isEndLoop[10])+isEndLoop[11])+isEndLoop[12])+isEndLoop[13])+isEndLoop[14])+isEndLoop[15])+isEndLoop[16])+isEndLoop[17])"))U(G("(((((((((((((((((testIdentity[0]+testIdentity[1])+testIdentity[2])+testIdentity[3])+testIdentity[4])+testIdentity[5])+testIdentity[6])+testIdentity[7])+testIdentity[8])+testIdentity[9])+testIdentity[10])+testIdentity[11])+testIdentity[12])+testIdentity[13])+testIdentity[14])+testIdentity[15])+testIdentity[16])+testIdentity[17])>=2")))))
Formula 3 simplified : !X(X"((CS[0]+CS[1])+CS[2])<=(((((((((((((((((isEndLoop[0]+isEndLoop[1])+isEndLoop[2])+isEndLoop[3])+isEndLoop[4])+isEndLoop[5])+isEndLoop[6])+isEndLoop[7])+isEndLoop[8])+isEndLoop[9])+isEndLoop[10])+isEndLoop[11])+isEndLoop[12])+isEndLoop[13])+isEndLoop[14])+isEndLoop[15])+isEndLoop[16])+isEndLoop[17])" U G"(((((((((((((((((testIdentity[0]+testIdentity[1])+testIdentity[2])+testIdentity[3])+testIdentity[4])+testIdentity[5])+testIdentity[6])+testIdentity[7])+testIdentity[8])+testIdentity[9])+testIdentity[10])+testIdentity[11])+testIdentity[12])+testIdentity[13])+testIdentity[14])+testIdentity[15])+testIdentity[16])+testIdentity[17])>=2")
7 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
30 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,6.19442,146756,1,0,434,481448,315,191,4017,582100,635
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X(("(((((((((((((((((isEndLoop[0]+isEndLoop[1])+isEndLoop[2])+isEndLoop[3])+isEndLoop[4])+isEndLoop[5])+isEndLoop[6])+isEndLoop[7])+isEndLoop[8])+isEndLoop[9])+isEndLoop[10])+isEndLoop[11])+isEndLoop[12])+isEndLoop[13])+isEndLoop[14])+isEndLoop[15])+isEndLoop[16])+isEndLoop[17])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])")U("(((((((((((((((((testAlone[0]+testAlone[1])+testAlone[2])+testAlone[3])+testAlone[4])+testAlone[5])+testAlone[6])+testAlone[7])+testAlone[8])+testAlone[9])+testAlone[10])+testAlone[11])+testAlone[12])+testAlone[13])+testAlone[14])+testAlone[15])+testAlone[16])+testAlone[17])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])")))))
Formula 4 simplified : !FX("(((((((((((((((((isEndLoop[0]+isEndLoop[1])+isEndLoop[2])+isEndLoop[3])+isEndLoop[4])+isEndLoop[5])+isEndLoop[6])+isEndLoop[7])+isEndLoop[8])+isEndLoop[9])+isEndLoop[10])+isEndLoop[11])+isEndLoop[12])+isEndLoop[13])+isEndLoop[14])+isEndLoop[15])+isEndLoop[16])+isEndLoop[17])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])" U "(((((((((((((((((testAlone[0]+testAlone[1])+testAlone[2])+testAlone[3])+testAlone[4])+testAlone[5])+testAlone[6])+testAlone[7])+testAlone[8])+testAlone[9])+testAlone[10])+testAlone[11])+testAlone[12])+testAlone[13])+testAlone[14])+testAlone[15])+testAlone[16])+testAlone[17])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,6.19653,146812,1,0,434,481448,324,191,4043,582100,639
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F("(((((((((((((((((beginLoop[0]+beginLoop[1])+beginLoop[2])+beginLoop[3])+beginLoop[4])+beginLoop[5])+beginLoop[6])+beginLoop[7])+beginLoop[8])+beginLoop[9])+beginLoop[10])+beginLoop[11])+beginLoop[12])+beginLoop[13])+beginLoop[14])+beginLoop[15])+beginLoop[16])+beginLoop[17])>=1")))
Formula 5 simplified : !F"(((((((((((((((((beginLoop[0]+beginLoop[1])+beginLoop[2])+beginLoop[3])+beginLoop[4])+beginLoop[5])+beginLoop[6])+beginLoop[7])+beginLoop[8])+beginLoop[9])+beginLoop[10])+beginLoop[11])+beginLoop[12])+beginLoop[13])+beginLoop[14])+beginLoop[15])+beginLoop[16])+beginLoop[17])>=1"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 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,6.29737,149704,1,0,492,493475,333,204,4073,596561,770
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(F(X(G("(((((turn[0]+turn[1])+turn[2])+turn[3])+turn[4])+turn[5])<=(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])"))))))
Formula 6 simplified : !XFXG"(((((turn[0]+turn[1])+turn[2])+turn[3])+turn[4])+turn[5])<=(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
144 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,7.7425,186516,1,0,692,633395,346,321,4169,818862,1268
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("(((((((((((((((((testIdentity[0]+testIdentity[1])+testIdentity[2])+testIdentity[3])+testIdentity[4])+testIdentity[5])+testIdentity[6])+testIdentity[7])+testIdentity[8])+testIdentity[9])+testIdentity[10])+testIdentity[11])+testIdentity[12])+testIdentity[13])+testIdentity[14])+testIdentity[15])+testIdentity[16])+testIdentity[17])<=(((((askForSection[0]+askForSection[1])+askForSection[2])+askForSection[3])+askForSection[4])+askForSection[5])")))
Formula 7 simplified : !F"(((((((((((((((((testIdentity[0]+testIdentity[1])+testIdentity[2])+testIdentity[3])+testIdentity[4])+testIdentity[5])+testIdentity[6])+testIdentity[7])+testIdentity[8])+testIdentity[9])+testIdentity[10])+testIdentity[11])+testIdentity[12])+testIdentity[13])+testIdentity[14])+testIdentity[15])+testIdentity[16])+testIdentity[17])<=(((((askForSection[0]+askForSection[1])+askForSection[2])+askForSection[3])+askForSection[4])+askForSection[5])"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,7.74446,186636,1,0,692,633395,355,321,4194,818862,1272
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Checking formula 8 : !(((("(((((((((((((((((isEndLoop[0]+isEndLoop[1])+isEndLoop[2])+isEndLoop[3])+isEndLoop[4])+isEndLoop[5])+isEndLoop[6])+isEndLoop[7])+isEndLoop[8])+isEndLoop[9])+isEndLoop[10])+isEndLoop[11])+isEndLoop[12])+isEndLoop[13])+isEndLoop[14])+isEndLoop[15])+isEndLoop[16])+isEndLoop[17])<=((CS[0]+CS[1])+CS[2])")U("((CS[0]+CS[1])+CS[2])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])"))U(("((CS[0]+CS[1])+CS[2])<=((idle[0]+idle[1])+idle[2])")U("(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])"))))
Formula 8 simplified : !(("(((((((((((((((((isEndLoop[0]+isEndLoop[1])+isEndLoop[2])+isEndLoop[3])+isEndLoop[4])+isEndLoop[5])+isEndLoop[6])+isEndLoop[7])+isEndLoop[8])+isEndLoop[9])+isEndLoop[10])+isEndLoop[11])+isEndLoop[12])+isEndLoop[13])+isEndLoop[14])+isEndLoop[15])+isEndLoop[16])+isEndLoop[17])<=((CS[0]+CS[1])+CS[2])" U "((CS[0]+CS[1])+CS[2])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])") U ("((CS[0]+CS[1])+CS[2])<=((idle[0]+idle[1])+idle[2])" U "(((((endTurn[0]+endTurn[1])+endTurn[2])+endTurn[3])+endTurn[4])+endTurn[5])<=(((((testTurn[0]+testTurn[1])+testTurn[2])+testTurn[3])+testTurn[4])+testTurn[5])"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,7.7518,187764,1,0,692,633395,388,321,4262,818862,1280
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-8 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("(((((turn[0]+turn[1])+turn[2])+turn[3])+turn[4])+turn[5])<=(((((wantSection[0]+wantSection[1])+wantSection[2])+wantSection[3])+wantSection[4])+wantSection[5])"))
Formula 9 simplified : !"(((((turn[0]+turn[1])+turn[2])+turn[3])+turn[4])+turn[5])<=(((((wantSection[0]+wantSection[1])+wantSection[2])+wantSection[3])+wantSection[4])+wantSection[5])"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,7.75282,187816,1,0,692,633395,391,321,4275,818862,1282
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Peterson-COL-2-LTLCardinality-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(G(("(((((wantSection[0]+wantSection[1])+wantSection[2])+wantSection[3])+wantSection[4])+wantSection[5])<=(((((((((((((((((testIdentity[0]+testIdentity[1])+testIdentity[2])+testIdentity[3])+testIdentity[4])+testIdentity[5])+testIdentity[6])+testIdentity[7])+testIdentity[8])+testIdentity[9])+testIdentity[10])+testIdentity[11])+testIdentity[12])+testIdentity[13])+testIdentity[14])+testIdentity[15])+testIdentity[16])+testIdentity[17])")U("(((((wantSection[0]+wantSection[1])+wantSection[2])+wantSection[3])+wantSection[4])+wantSection[5])>=2")))))
Formula 10 simplified : !G("(((((wantSection[0]+wantSection[1])+wantSection[2])+wantSection[3])+wantSection[4])+wantSection[5])<=(((((((((((((((((testIdentity[0]+testIdentity[1])+testIdentity[2])+testIdentity[3])+testIdentity[4])+testIdentity[5])+testIdentity[6])+testIdentity[7])+testIdentity[8])+testIdentity[9])+testIdentity[10])+testIdentity[11])+testIdentity[12])+testIdentity[13])+testIdentity[14])+testIdentity[15])+testIdentity[16])+testIdentity[17])" U "(((((wantSection[0]+wantSection[1])+wantSection[2])+wantSection[3])+wantSection[4])+wantSection[5])>=2")
Exit code :0
Exit code :0
FORMULA Peterson-COL-2-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :0
FORMULA Peterson-COL-2-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Exit code :1
FORMULA Peterson-COL-2-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT

BK_STOP 1496243283128

--------------------
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/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLCardinality -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 3:07:51 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 3:07:52 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 31, 2017 3:07:53 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1653 ms
May 31, 2017 3:07:53 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 places.
May 31, 2017 3:07:53 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 31, 2017 3:07:53 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
ProcTour->askForSection,testTurn,endTurn,
TourProc->turn,
Process->idle,CS,

May 31, 2017 3:07:53 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 14 transitions.
May 31, 2017 3:07:53 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 31, 2017 3:07:53 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 19 instantiations of transitions. Total transitions/syncs built is 141
May 31, 2017 3:07:53 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 177 ms
May 31, 2017 3:07:53 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 20 ms
May 31, 2017 3:07:53 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 5 ms
May 31, 2017 3:07:54 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 11 place invariants in 77 ms
May 31, 2017 3:07:55 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 108 variables to be positive in 693 ms
May 31, 2017 3:07:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 138 transitions.
May 31, 2017 3:07:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/138 took 3 ms. Total solver calls (SAT/UNSAT): 3(1/2)
May 31, 2017 3:07:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 467 ms. Total solver calls (SAT/UNSAT): 651(204/447)
May 31, 2017 3:07:55 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 138 transitions.
May 31, 2017 3:07:56 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 493 ms. Total solver calls (SAT/UNSAT): 651(264/387)
May 31, 2017 3:07:56 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 138 transitions.
May 31, 2017 3:07:57 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(25/138) took 1017 ms. Total solver calls (SAT/UNSAT): 3263(1099/2164)
May 31, 2017 3:07:58 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(53/138) took 2032 ms. Total solver calls (SAT/UNSAT): 6021(2916/3105)
May 31, 2017 3:07:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of enabling matrix(102/138) took 3040 ms. Total solver calls (SAT/UNSAT): 8961(4832/4129)
May 31, 2017 3:07:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 3217 ms. Total solver calls (SAT/UNSAT): 9591(5124/4467)
May 31, 2017 3:07:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 138 transitions.
May 31, 2017 3:07:59 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 31, 2017 3:07:59 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 5282ms conformant to PINS in folder :/home/mcc/execution
May 31, 2017 3:08:02 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, []([](((LTLAP16==true))U((LTLAP17==true))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.001: Registering PINS so language module
pins2lts-seq, 0.001: Loading model from ./gal.so
pins2lts-seq, 0.001: library has no initializer
pins2lts-seq, 0.001: loading model GAL
pins2lts-seq, 0.003: completed loading model GAL
pins2lts-seq, 0.003: Initializing POR dependencies: labels 162, guards 138
pins2lts-seq, 0.021: LTL layer: formula: []([](((LTLAP16==true))U((LTLAP17==true))))
pins2lts-seq, 0.021: Expression is: ([] ([] ((LTLAP16 == true ) U (LTLAP17 == true ))))
pins2lts-seq, 0.022: buchi has 3 states
pins2lts-seq, 0.022: state 0: non-accepting
pins2lts-seq, 0.022: -> 0, | true
pins2lts-seq, 0.022: -> 1, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.022: -> 2, | !(LTLAP17 == true )
pins2lts-seq, 0.022: state 1: accepting
pins2lts-seq, 0.022: -> 1, | true
pins2lts-seq, 0.022: state 2: accepting
pins2lts-seq, 0.022: -> 2, | !(LTLAP17 == true )
pins2lts-seq, 0.022: -> 1, | !(LTLAP17 == true ) && !(LTLAP16 == true )
pins2lts-seq, 0.022: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.023: There are 163 state labels and 1 edge labels
pins2lts-seq, 0.023: State length is 109, there are 144 groups
pins2lts-seq, 0.023: Running scc search strategy
pins2lts-seq, 0.023: Using a tree for state storage
pins2lts-seq, 0.023: Visible groups: 0 / 144, labels: 2 / 163
pins2lts-seq, 0.023: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.455: explored 687 levels ~10000 states ~25019 transitions
pins2lts-seq, 0.714: state space 687 levels, 16028 states 39052 transitions

May 31, 2017 3:08:02 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, <>(<>([]([]((LTLAP18==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 162, guards 138
pins2lts-seq, 0.020: LTL layer: formula: <>(<>([]([]((LTLAP18==true)))))
pins2lts-seq, 0.020: Expression is: (<> (<> ([] ([] (LTLAP18 == true )))))
pins2lts-seq, 0.020: buchi has 2 states
pins2lts-seq, 0.020: state 0: non-accepting
pins2lts-seq, 0.020: -> 1, | !(LTLAP18 == true )
pins2lts-seq, 0.020: -> 0, | true
pins2lts-seq, 0.020: state 1: accepting
pins2lts-seq, 0.020: -> 1, | !(LTLAP18 == true )
pins2lts-seq, 0.020: -> 0, | true
pins2lts-seq, 0.021: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.021: There are 163 state labels and 1 edge labels
pins2lts-seq, 0.021: State length is 109, there are 142 groups
pins2lts-seq, 0.021: Running scc search strategy
pins2lts-seq, 0.021: Using a tree for state storage
pins2lts-seq, 0.021: Visible groups: 0 / 142, labels: 1 / 163
pins2lts-seq, 0.021: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.023: accepting cycle found!
pins2lts-seq, 0.023: exiting now

May 31, 2017 3:08:02 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, (LTLAP19==true)], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 162, guards 138
pins2lts-seq, 0.019: LTL layer: formula: (LTLAP19==true)
pins2lts-seq, 0.019: Expression is: (LTLAP19 == true )
pins2lts-seq, 0.019: buchi has 2 states
pins2lts-seq, 0.019: state 0: accepting
pins2lts-seq, 0.019: -> 1, | !(LTLAP19 == true )
pins2lts-seq, 0.019: state 1: accepting
pins2lts-seq, 0.019: -> 1, | true
pins2lts-seq, 0.020: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.020: There are 163 state labels and 1 edge labels
pins2lts-seq, 0.020: State length is 109, there are 140 groups
pins2lts-seq, 0.020: Running scc search strategy
pins2lts-seq, 0.020: Using a tree for state storage
pins2lts-seq, 0.020: Visible groups: 0 / 140, labels: 1 / 163
pins2lts-seq, 0.020: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.022: accepting cycle found!
pins2lts-seq, 0.022: exiting now

May 31, 2017 3:08:02 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, <>(<>(<>(X((LTLAP20==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: <>(<>(<>(X((LTLAP20==true)))))
pins2lts-seq, 0.001: Expression is: (<> (<> (<> (X (LTLAP20 == true )))))
pins2lts-seq, 0.001: buchi has 2 states
pins2lts-seq, 0.001: state 0: accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: accepting
pins2lts-seq, 0.001: -> 1, | !(LTLAP20 == true )
pins2lts-seq, 0.002: There are 163 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 109, there are 140 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

May 31, 2017 3:08:02 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, -p, --pins-guards, --when, --ltl, ((LTLAP21==true))U((LTLAP22==true))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: Initializing POR dependencies: labels 162, guards 138
pins2lts-seq, 0.019: LTL layer: formula: ((LTLAP21==true))U((LTLAP22==true))
pins2lts-seq, 0.019: Expression is: ((LTLAP21 == true ) U (LTLAP22 == true ))
pins2lts-seq, 0.019: buchi has 2 states
pins2lts-seq, 0.019: state 0: accepting
pins2lts-seq, 0.019: -> 0, | !(LTLAP22 == true )
pins2lts-seq, 0.019: -> 1, | !(LTLAP22 == true ) && !(LTLAP21 == true )
pins2lts-seq, 0.019: state 1: accepting
pins2lts-seq, 0.019: -> 1, | true
pins2lts-seq, 0.020: Forcing the use of a cycle proviso. For best results use --proviso=color.
pins2lts-seq, 0.020: There are 163 state labels and 1 edge labels
pins2lts-seq, 0.020: State length is 109, there are 141 groups
pins2lts-seq, 0.020: Running scc search strategy
pins2lts-seq, 0.020: Using a tree for state storage
pins2lts-seq, 0.020: Visible groups: 0 / 141, labels: 2 / 163
pins2lts-seq, 0.020: POR cycle proviso: stack (ltl)
pins2lts-seq, 0.021: state space 1 levels, 1 states 0 transitions

May 31, 2017 3:08:02 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-seq, ./gal.so, --when, --ltl, [](X(X(X((LTLAP23==true)))))], workingDir=/home/mcc/execution]
pins2lts-seq, 0.000: Registering PINS so language module
pins2lts-seq, 0.000: Loading model from ./gal.so
pins2lts-seq, 0.000: library has no initializer
pins2lts-seq, 0.000: loading model GAL
pins2lts-seq, 0.001: completed loading model GAL
pins2lts-seq, 0.001: LTL layer: formula: [](X(X(X((LTLAP23==true)))))
pins2lts-seq, 0.001: Expression is: ([] (X (X (X (LTLAP23 == true )))))
pins2lts-seq, 0.001: buchi has 5 states
pins2lts-seq, 0.001: state 0: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: state 1: non-accepting
pins2lts-seq, 0.001: -> 1, | true
pins2lts-seq, 0.001: -> 2, | true
pins2lts-seq, 0.001: state 2: accepting
pins2lts-seq, 0.001: -> 3, | true
pins2lts-seq, 0.001: state 3: accepting
pins2lts-seq, 0.001: -> 4, | !(LTLAP23 == true )
pins2lts-seq, 0.001: state 4: accepting
pins2lts-seq, 0.001: -> 4, | true
pins2lts-seq, 0.002: There are 163 state labels and 1 edge labels
pins2lts-seq, 0.002: State length is 109, there are 144 groups
pins2lts-seq, 0.002: Running scc search strategy
pins2lts-seq, 0.002: Using a tree for state storage
pins2lts-seq, 0.004: accepting cycle found!
pins2lts-seq, 0.004: exiting now

May 31, 2017 3:08:02 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null

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="S_Peterson-COL-2"
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

tar xzf /home/mcc/BenchKit/INPUTS/S_Peterson-COL-2.tgz
mv S_Peterson-COL-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is S_Peterson-COL-2, 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 r130-smll-149441682900005"
echo "====================================================================="
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
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 ;