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-2979
Executing tool itstools
Input is S_Philosophers-PT-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169kn-ebro-146433129300861
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464397159560


its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201605191313/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F((((("Eat_4>=1")||("Eat_3>=1"))||("Eat_2>=1"))||("Eat_1>=1"))||("Eat_5>=1"))))
Formula 0 simplified : !F("Eat_1>=1" | "Eat_2>=1" | "Eat_3>=1" | "Eat_4>=1" | "Eat_5>=1")
2 unique states visited
2 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.082575,23516,1,0,29,3195,36,23,622,3057,65
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(F(X(F(((((("Catch1_1>=1")&&("Fork_1>=1"))||(("Catch1_2>=1")&&("Fork_2>=1")))||(("Fork_5>=1")&&("Catch1_5>=1")))||(("Catch1_3>=1")&&("Fork_3>=1")))||(("Catch1_4>=1")&&("Fork_4>=1")))))))))
Formula 1 simplified : !GFXF(("Catch1_1>=1" & "Fork_1>=1") | ("Catch1_2>=1" & "Fork_2>=1") | ("Catch1_5>=1" & "Fork_5>=1") | ("Catch1_3>=1" & "Fork_3>=1") | ("Catch1_4>=1" & "Fork_4>=1"))
3 unique states visited
3 strongly connected components in search stack
4 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.127493,27348,1,0,32,4300,98,28,696,4306,87
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(X(F(F(((((("Catch1_1>=1")&&("Fork_1>=1"))||(("Catch1_2>=1")&&("Fork_2>=1")))||(("Fork_5>=1")&&("Catch1_5>=1")))||(("Catch1_3>=1")&&("Fork_3>=1")))||(("Catch1_4>=1")&&("Fork_4>=1")))))))))
Formula 2 simplified : !FGXF(("Catch1_1>=1" & "Fork_1>=1") | ("Catch1_2>=1" & "Fork_2>=1") | ("Catch1_5>=1" & "Fork_5>=1") | ("Catch1_3>=1" & "Fork_3>=1") | ("Catch1_4>=1" & "Fork_4>=1"))
3 unique states visited
3 strongly connected components in search stack
4 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.155226,27608,1,0,32,4300,98,28,696,4306,87
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(F((F((((("Eat_4>=1")||("Eat_3>=1"))||("Eat_2>=1"))||("Eat_1>=1"))||("Eat_5>=1")))U(F(((((("Fork_1>=1")&&("Think_2>=1"))||(("Fork_5>=1")&&("Think_1>=1")))||(("Think_4>=1")&&("Fork_3>=1")))||(("Fork_2>=1")&&("Think_3>=1")))||(("Fork_4>=1")&&("Think_5>=1"))))))))
Formula 3 simplified : !XF(F("Eat_1>=1" | "Eat_2>=1" | "Eat_3>=1" | "Eat_4>=1" | "Eat_5>=1") U F(("Fork_1>=1" & "Think_2>=1") | ("Fork_5>=1" & "Think_1>=1") | ("Fork_3>=1" & "Think_4>=1") | ("Fork_2>=1" & "Think_3>=1") | ("Fork_4>=1" & "Think_5>=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.164178,27612,1,0,32,4341,146,28,735,4307,91
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((((((("Catch1_1>=1")&&("Fork_1>=1"))||(("Catch1_2>=1")&&("Fork_2>=1")))||(("Fork_5>=1")&&("Catch1_5>=1")))||(("Catch1_3>=1")&&("Fork_3>=1")))||(("Catch1_4>=1")&&("Fork_4>=1")))U(X(G(F(((((("Fork_1>=1")&&("Think_2>=1"))||(("Fork_5>=1")&&("Think_1>=1")))||(("Think_4>=1")&&("Fork_3>=1")))||(("Fork_2>=1")&&("Think_3>=1")))||(("Fork_4>=1")&&("Think_5>=1"))))))))
Formula 4 simplified : !((("Catch1_1>=1" & "Fork_1>=1") | ("Catch1_2>=1" & "Fork_2>=1") | ("Catch1_5>=1" & "Fork_5>=1") | ("Catch1_3>=1" & "Fork_3>=1") | ("Catch1_4>=1" & "Fork_4>=1")) U XGF(("Fork_1>=1" & "Think_2>=1") | ("Fork_5>=1" & "Think_1>=1") | ("Fork_3>=1" & "Think_4>=1") | ("Fork_2>=1" & "Think_3>=1") | ("Fork_4>=1" & "Think_5>=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,1.13099,29076,1,0,41,6729,355,35,952,5903,118
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F(G(G(F((((("Eat_4>=1")||("Eat_3>=1"))||("Eat_2>=1"))||("Eat_1>=1"))||("Eat_5>=1"))))))))
Formula 5 simplified : !XFGF("Eat_1>=1" | "Eat_2>=1" | "Eat_3>=1" | "Eat_4>=1" | "Eat_5>=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,1.13363,29076,1,0,41,6729,355,36,952,6035,122
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(F(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1"))))))
Formula 6 simplified : !XF(("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=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,1.1439,29076,1,0,41,6753,393,36,986,6036,126
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(((((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1")))U(G(F(G(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1"))))))))
Formula 7 simplified : !((("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=1")) U GFG(("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=1")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 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.21013,29076,1,0,60,12651,437,60,1022,13110,190
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(G(X(((((("Catch1_1>=1")&&("Fork_1>=1"))||(("Catch1_2>=1")&&("Fork_2>=1")))||(("Fork_5>=1")&&("Catch1_5>=1")))||(("Catch1_3>=1")&&("Fork_3>=1")))||(("Catch1_4>=1")&&("Fork_4>=1")))))))
Formula 8 simplified : !FGX(("Catch1_1>=1" & "Fork_1>=1") | ("Catch1_2>=1" & "Fork_2>=1") | ("Catch1_5>=1" & "Fork_5>=1") | ("Catch1_3>=1" & "Fork_3>=1") | ("Catch1_4>=1" & "Fork_4>=1"))
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,1.27403,29296,1,0,60,12651,437,60,1022,13116,192
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((((((("Fork_5>=1")&&("Catch2_1>=1"))||(("Catch2_4>=1")&&("Fork_3>=1")))||(("Fork_4>=1")&&("Catch2_5>=1")))||(("Fork_1>=1")&&("Catch2_2>=1")))||(("Fork_2>=1")&&("Catch2_3>=1"))))
Formula 9 simplified : !(("Catch2_1>=1" & "Fork_5>=1") | ("Catch2_4>=1" & "Fork_3>=1") | ("Catch2_5>=1" & "Fork_4>=1") | ("Catch2_2>=1" & "Fork_1>=1") | ("Catch2_3>=1" & "Fork_2>=1"))
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,1.28344,29304,1,0,60,12651,481,60,1062,13120,196
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((((((("Fork_1>=1")&&("Think_2>=1"))||(("Fork_5>=1")&&("Think_1>=1")))||(("Think_4>=1")&&("Fork_3>=1")))||(("Fork_2>=1")&&("Think_3>=1")))||(("Fork_4>=1")&&("Think_5>=1"))))
Formula 10 simplified : !(("Fork_1>=1" & "Think_2>=1") | ("Fork_5>=1" & "Think_1>=1") | ("Fork_3>=1" & "Think_4>=1") | ("Fork_2>=1" & "Think_3>=1") | ("Fork_4>=1" & "Think_5>=1"))
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,1.29082,29304,1,0,60,12651,481,60,1062,13120,198
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X((F(F(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1")))))U(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1"))))))
Formula 11 simplified : !X(F(("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=1")) U (("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=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,1.29971,29376,1,0,60,12651,481,60,1062,13120,198
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G((G(G(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1")))))U(((((("Fork_5>=1")&&("Catch2_1>=1"))||(("Catch2_4>=1")&&("Fork_3>=1")))||(("Fork_4>=1")&&("Catch2_5>=1")))||(("Fork_1>=1")&&("Catch2_2>=1")))||(("Fork_2>=1")&&("Catch2_3>=1"))))))
Formula 12 simplified : !G(G(("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=1")) U (("Catch2_1>=1" & "Fork_5>=1") | ("Catch2_4>=1" & "Fork_3>=1") | ("Catch2_5>=1" & "Fork_4>=1") | ("Catch2_2>=1" & "Fork_1>=1") | ("Catch2_3>=1" & "Fork_2>=1")))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
5 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.55727,38776,1,0,70,16585,1429,70,2020,16878,243
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X((((("Eat_4>=1")||("Eat_3>=1"))||("Eat_2>=1"))||("Eat_1>=1"))||("Eat_5>=1"))))
Formula 13 simplified : !X("Eat_1>=1" | "Eat_2>=1" | "Eat_3>=1" | "Eat_4>=1" | "Eat_5>=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,7.55916,38776,1,0,71,16613,1429,71,2020,16920,250
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((((((("Fork_1>=1")&&("Think_2>=1"))||(("Fork_5>=1")&&("Think_1>=1")))||(("Think_4>=1")&&("Fork_3>=1")))||(("Fork_2>=1")&&("Think_3>=1")))||(("Fork_4>=1")&&("Think_5>=1")))U(G(F(F(((((("Think_2>=1")&&("Fork_2>=1"))||(("Fork_3>=1")&&("Think_3>=1")))||(("Think_1>=1")&&("Fork_1>=1")))||(("Fork_4>=1")&&("Think_4>=1")))||(("Fork_5>=1")&&("Think_5>=1"))))))))
Formula 14 simplified : !((("Fork_1>=1" & "Think_2>=1") | ("Fork_5>=1" & "Think_1>=1") | ("Fork_3>=1" & "Think_4>=1") | ("Fork_2>=1" & "Think_3>=1") | ("Fork_4>=1" & "Think_5>=1")) U GF(("Fork_2>=1" & "Think_2>=1") | ("Fork_3>=1" & "Think_3>=1") | ("Fork_1>=1" & "Think_1>=1") | ("Fork_4>=1" & "Think_4>=1") | ("Fork_5>=1" & "Think_5>=1")))
3 unique states visited
3 strongly connected components in search stack
4 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,7.63522,38776,1,0,74,17784,1557,73,2141,17431,269
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((F(G(X(((((("Catch1_1>=1")&&("Fork_1>=1"))||(("Catch1_2>=1")&&("Fork_2>=1")))||(("Fork_5>=1")&&("Catch1_5>=1")))||(("Catch1_3>=1")&&("Fork_3>=1")))||(("Catch1_4>=1")&&("Fork_4>=1"))))))U(X((((((("Fork_1>=1")&&("Think_2>=1"))||(("Fork_5>=1")&&("Think_1>=1")))||(("Think_4>=1")&&("Fork_3>=1")))||(("Fork_2>=1")&&("Think_3>=1")))||(("Fork_4>=1")&&("Think_5>=1")))U(((((("Catch1_1>=1")&&("Fork_1>=1"))||(("Catch1_2>=1")&&("Fork_2>=1")))||(("Fork_5>=1")&&("Catch1_5>=1")))||(("Catch1_3>=1")&&("Fork_3>=1")))||(("Catch1_4>=1")&&("Fork_4>=1")))))))
Formula 15 simplified : !(FGX(("Catch1_1>=1" & "Fork_1>=1") | ("Catch1_2>=1" & "Fork_2>=1") | ("Catch1_5>=1" & "Fork_5>=1") | ("Catch1_3>=1" & "Fork_3>=1") | ("Catch1_4>=1" & "Fork_4>=1")) U X((("Fork_1>=1" & "Think_2>=1") | ("Fork_5>=1" & "Think_1>=1") | ("Fork_3>=1" & "Think_4>=1") | ("Fork_2>=1" & "Think_3>=1") | ("Fork_4>=1" & "Think_5>=1")) U (("Catch1_1>=1" & "Fork_1>=1") | ("Catch1_2>=1" & "Fork_2>=1") | ("Catch1_5>=1" & "Fork_5>=1") | ("Catch1_3>=1" & "Fork_3>=1") | ("Catch1_4>=1" & "Fork_4>=1"))))
7 unique states visited
5 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
9 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,11.8927,36460,1,0,110,25384,2184,102,2798,26283,350
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

BK_STOP 1464397177976

--------------------
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
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -XX:MaxPermSize=512m -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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 LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its
Java HotSpot(TM) 64-Bit Server VM warning: ignoring option MaxPermSize=512m; support was removed in 8.0
May 28, 2016 12:59:24 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2016 12:59:24 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 48 ms
May 28, 2016 12:59:24 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 places.
May 28, 2016 12:59:25 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 25 transitions.
May 28, 2016 12:59:25 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 44 ms
May 28, 2016 12:59:25 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 56 ms
May 28, 2016 12:59:25 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 5 ms

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_Philosophers-PT-000005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/users/gast00/fkordon/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_Philosophers-PT-000005.tgz
mv S_Philosophers-PT-000005 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool itstools"
echo " Input is S_Philosophers-PT-000005, 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 r169kn-ebro-146433129300861"
echo "====================================================================="
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
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 ;