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-COL-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169kn-ebro-146433129000744
=====================================================================

--------------------
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 1464392133842


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((((("Philo0.eat_0>=1")||("Philo1.eat_1>=1"))||("Philo2.eat_2>=1"))||("Philo3.eat_3>=1"))||("Philo4.eat_4>=1"))))
Formula 0 simplified : !F("Philo0.eat_0>=1" | "Philo1.eat_1>=1" | "Philo2.eat_2>=1" | "Philo3.eat_3>=1" | "Philo4.eat_4>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.069919,23356,1,0,935,142,222,575,117,173,1496
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 USE_NUPN
Checking formula 1 : !((G(G(F(X(F(((((("Philo0.fork_0>=1")&&("Philo0.catch1_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.catch1_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.catch1_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.catch1_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.catch1_4>=1")))))))))
Formula 1 simplified : !GFXF(("Philo0.catch1_0>=1" & "Philo0.fork_0>=1") | ("Philo1.catch1_1>=1" & "Philo1.fork_1>=1") | ("Philo2.catch1_2>=1" & "Philo2.fork_2>=1") | ("Philo3.catch1_3>=1" & "Philo3.fork_3>=1") | ("Philo4.catch1_4>=1" & "Philo4.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.11265,26944,1,0,1191,145,346,780,125,193,2162
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 USE_NUPN
Checking formula 2 : !((F(G(X(F(F(((((("Philo0.fork_0>=1")&&("Philo0.catch1_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.catch1_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.catch1_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.catch1_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.catch1_4>=1")))))))))
Formula 2 simplified : !FGXF(("Philo0.catch1_0>=1" & "Philo0.fork_0>=1") | ("Philo1.catch1_1>=1" & "Philo1.fork_1>=1") | ("Philo2.catch1_2>=1" & "Philo2.fork_2>=1") | ("Philo3.catch1_3>=1" & "Philo3.fork_3>=1") | ("Philo4.catch1_4>=1" & "Philo4.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.140917,26944,1,0,1191,145,346,780,125,193,2162
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 USE_NUPN
Checking formula 3 : !((X(F((F((((("Philo0.eat_0>=1")||("Philo1.eat_1>=1"))||("Philo2.eat_2>=1"))||("Philo3.eat_3>=1"))||("Philo4.eat_4>=1")))U(F(((((("Philo4.fork_4>=1")&&("Philo0.think_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.think_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.think_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.think_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.think_4>=1"))))))))
Formula 3 simplified : !XF(F("Philo0.eat_0>=1" | "Philo1.eat_1>=1" | "Philo2.eat_2>=1" | "Philo3.eat_3>=1" | "Philo4.eat_4>=1") U F(("Philo0.think_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.think_1>=1") | ("Philo1.fork_1>=1" & "Philo2.think_2>=1") | ("Philo2.fork_2>=1" & "Philo3.think_3>=1") | ("Philo3.fork_3>=1" & "Philo4.think_4>=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.15046,27020,1,0,1195,145,399,782,126,193,2216
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((((((("Philo0.fork_0>=1")&&("Philo0.catch1_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.catch1_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.catch1_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.catch1_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.catch1_4>=1")))U(X(G(F(((((("Philo4.fork_4>=1")&&("Philo0.think_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.think_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.think_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.think_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.think_4>=1"))))))))
Formula 4 simplified : !((("Philo0.catch1_0>=1" & "Philo0.fork_0>=1") | ("Philo1.catch1_1>=1" & "Philo1.fork_1>=1") | ("Philo2.catch1_2>=1" & "Philo2.fork_2>=1") | ("Philo3.catch1_3>=1" & "Philo3.fork_3>=1") | ("Philo4.catch1_4>=1" & "Philo4.fork_4>=1")) U XGF(("Philo0.think_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.think_1>=1") | ("Philo1.fork_1>=1" & "Philo2.think_2>=1") | ("Philo2.fork_2>=1" & "Philo3.think_3>=1") | ("Philo3.fork_3>=1" & "Philo4.think_4>=1")))
4 unique states visited
4 strongly connected components in search stack
4 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,1.33627,28584,1,0,2233,145,661,1330,130,197,4943
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 USE_NUPN
Checking formula 5 : !((X(F(G(G(F((((("Philo0.eat_0>=1")||("Philo1.eat_1>=1"))||("Philo2.eat_2>=1"))||("Philo3.eat_3>=1"))||("Philo4.eat_4>=1"))))))))
Formula 5 simplified : !XFGF("Philo0.eat_0>=1" | "Philo1.eat_1>=1" | "Philo2.eat_2>=1" | "Philo3.eat_3>=1" | "Philo4.eat_4>=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.33881,28584,1,0,2236,145,661,1341,130,197,4959
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 USE_NUPN
Checking formula 6 : !((X(F(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1"))))))
Formula 6 simplified : !XF(("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=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.35011,28584,1,0,2237,145,706,1342,131,197,4986
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-6 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1")))U(G(F(G(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1"))))))))
Formula 7 simplified : !((("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=1")) U GFG(("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=1")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.39688,28588,1,0,3689,145,752,2529,133,199,7793
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 USE_NUPN
Checking formula 8 : !((F(G(X(((((("Philo0.fork_0>=1")&&("Philo0.catch1_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.catch1_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.catch1_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.catch1_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.catch1_4>=1")))))))
Formula 8 simplified : !FGX(("Philo0.catch1_0>=1" & "Philo0.fork_0>=1") | ("Philo1.catch1_1>=1" & "Philo1.fork_1>=1") | ("Philo2.catch1_2>=1" & "Philo2.fork_2>=1") | ("Philo3.catch1_3>=1" & "Philo3.fork_3>=1") | ("Philo4.catch1_4>=1" & "Philo4.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.46384,28588,1,0,3695,145,752,2551,133,199,7908
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 USE_NUPN
Checking formula 9 : !((((((("Philo4.fork_4>=1")&&("Philo0.catch2_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.catch2_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.catch2_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.catch2_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.catch2_4>=1"))))
Formula 9 simplified : !(("Philo0.catch2_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.catch2_1>=1") | ("Philo1.fork_1>=1" & "Philo2.catch2_2>=1") | ("Philo2.fork_2>=1" & "Philo3.catch2_3>=1") | ("Philo3.fork_3>=1" & "Philo4.catch2_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.47424,28588,1,0,3695,145,801,2551,134,199,7946
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 USE_NUPN
Checking formula 10 : !((((((("Philo4.fork_4>=1")&&("Philo0.think_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.think_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.think_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.think_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.think_4>=1"))))
Formula 10 simplified : !(("Philo0.think_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.think_1>=1") | ("Philo1.fork_1>=1" & "Philo2.think_2>=1") | ("Philo2.fork_2>=1" & "Philo3.think_3>=1") | ("Philo3.fork_3>=1" & "Philo4.think_4>=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.48234,28588,1,0,3695,145,801,2551,134,199,7962
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((F(F(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1")))))U(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1"))))))
Formula 11 simplified : !X(F(("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=1")) U (("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=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.49227,28588,1,0,3695,145,801,2551,134,199,7962
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Philosophers-COL-000005-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G((G(G(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1")))))U(((((("Philo4.fork_4>=1")&&("Philo0.catch2_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.catch2_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.catch2_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.catch2_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.catch2_4>=1"))))))
Formula 12 simplified : !G(G(("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_4>=1")) U (("Philo0.catch2_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.catch2_1>=1") | ("Philo1.fork_1>=1" & "Philo2.catch2_2>=1") | ("Philo2.fork_2>=1" & "Philo3.catch2_3>=1") | ("Philo3.fork_3>=1" & "Philo4.catch2_4>=1")))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,8.60451,35968,1,0,6084,145,1868,4131,148,200,13285
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 USE_NUPN
Checking formula 13 : !((X((((("Philo0.eat_0>=1")||("Philo1.eat_1>=1"))||("Philo2.eat_2>=1"))||("Philo3.eat_3>=1"))||("Philo4.eat_4>=1"))))
Formula 13 simplified : !X("Philo0.eat_0>=1" | "Philo1.eat_1>=1" | "Philo2.eat_2>=1" | "Philo3.eat_3>=1" | "Philo4.eat_4>=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,8.60662,35968,1,0,6106,145,1868,4146,148,200,13378
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 USE_NUPN
Checking formula 14 : !(((((((("Philo4.fork_4>=1")&&("Philo0.think_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.think_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.think_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.think_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.think_4>=1")))U(G(F(F(((((("Philo0.fork_0>=1")&&("Philo0.think_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.think_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.think_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.think_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.think_4>=1"))))))))
Formula 14 simplified : !((("Philo0.think_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.think_1>=1") | ("Philo1.fork_1>=1" & "Philo2.think_2>=1") | ("Philo2.fork_2>=1" & "Philo3.think_3>=1") | ("Philo3.fork_3>=1" & "Philo4.think_4>=1")) U GF(("Philo0.fork_0>=1" & "Philo0.think_0>=1") | ("Philo1.fork_1>=1" & "Philo1.think_1>=1") | ("Philo2.fork_2>=1" & "Philo2.think_2>=1") | ("Philo3.fork_3>=1" & "Philo3.think_3>=1") | ("Philo4.fork_4>=1" & "Philo4.think_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,8.67532,35968,1,0,6281,145,1943,4246,151,200,14092
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 USE_NUPN
Checking formula 15 : !(((F(G(X(((((("Philo0.fork_0>=1")&&("Philo0.catch1_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.catch1_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.catch1_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.catch1_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.catch1_4>=1"))))))U(X((((((("Philo4.fork_4>=1")&&("Philo0.think_0>=1"))||(("Philo0.fork_0>=1")&&("Philo1.think_1>=1")))||(("Philo1.fork_1>=1")&&("Philo2.think_2>=1")))||(("Philo2.fork_2>=1")&&("Philo3.think_3>=1")))||(("Philo3.fork_3>=1")&&("Philo4.think_4>=1")))U(((((("Philo0.fork_0>=1")&&("Philo0.catch1_0>=1"))||(("Philo1.fork_1>=1")&&("Philo1.catch1_1>=1")))||(("Philo2.fork_2>=1")&&("Philo2.catch1_2>=1")))||(("Philo3.fork_3>=1")&&("Philo3.catch1_3>=1")))||(("Philo4.fork_4>=1")&&("Philo4.catch1_4>=1")))))))
Formula 15 simplified : !(FGX(("Philo0.catch1_0>=1" & "Philo0.fork_0>=1") | ("Philo1.catch1_1>=1" & "Philo1.fork_1>=1") | ("Philo2.catch1_2>=1" & "Philo2.fork_2>=1") | ("Philo3.catch1_3>=1" & "Philo3.fork_3>=1") | ("Philo4.catch1_4>=1" & "Philo4.fork_4>=1")) U X((("Philo0.think_0>=1" & "Philo4.fork_4>=1") | ("Philo0.fork_0>=1" & "Philo1.think_1>=1") | ("Philo1.fork_1>=1" & "Philo2.think_2>=1") | ("Philo2.fork_2>=1" & "Philo3.think_3>=1") | ("Philo3.fork_3>=1" & "Philo4.think_4>=1")) U (("Philo0.catch1_0>=1" & "Philo0.fork_0>=1") | ("Philo1.catch1_1>=1" & "Philo1.fork_1>=1") | ("Philo2.catch1_2>=1" & "Philo2.fork_2>=1") | ("Philo3.catch1_3>=1" & "Philo3.fork_3>=1") | ("Philo4.catch1_4>=1" & "Philo4.fork_4>=1"))))
7 unique states visited
5 strongly connected components in search stack
8 transitions explored
7 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,13.5347,35068,1,0,8993,145,2526,6189,159,200,20072
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 USE_NUPN

BK_STOP 1464392157450

--------------------
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 27, 2016 11:35:38 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 27, 2016 11:35:38 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 27, 2016 11:35:42 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 4161 ms
May 27, 2016 11:35:42 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
May 27, 2016 11:35:42 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: read order :VarOrder [vars=[think[0], think[1], think[2], think[3], think[4], fork[0], fork[1], fork[2], fork[3], fork[4], catch1[0], catch1[1], catch1[2], catch1[3], catch1[4], catch2[0], catch2[1], catch2[2], catch2[3], catch2[4], eat[0], eat[1], eat[2], eat[3], eat[4]]]
May 27, 2016 11:35:42 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

May 27, 2016 11:35:43 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 27, 2016 11:35:43 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains : CompositeGalOrder [children=[VarOrder [vars=[think[0], fork[0], catch1[0], catch2[0], eat[0]]], VarOrder [vars=[think[1], fork[1], catch1[1], catch2[1], eat[1]]], VarOrder [vars=[think[2], fork[2], catch1[2], catch2[2], eat[2]]], VarOrder [vars=[think[3], fork[3], catch1[3], catch2[3], eat[3]]], VarOrder [vars=[think[4], fork[4], catch1[4], catch2[4], eat[4]]]]]
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 42 ms
May 27, 2016 11:35:43 PM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 20 ms
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[think[0], fork[0], catch1[0], catch2[0], eat[0], ],[think[1], fork[1], catch1[1], catch2[1], eat[1], ],[think[2], fork[2], catch1[2], catch2[2], eat[2], ],[think[3], fork[3], catch1[3], catch2[3], eat[3], ],[think[4], fork[4], catch1[4], catch2[4], eat[4], ],

May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array think to variables to allow decomposition.
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array fork to variables to allow decomposition.
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array catch1 to variables to allow decomposition.
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array catch2 to variables to allow decomposition.
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array eat to variables to allow decomposition.
May 27, 2016 11:35:43 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 5 redundant transitions.
May 27, 2016 11:35:43 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 15 ms
May 27, 2016 11:35:43 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 6 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-COL-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-COL-000005.tgz
mv S_Philosophers-COL-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-COL-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-146433129000744"
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 ;