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 DatabaseWithMutex-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013kn-qhx2-146347844800123
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-0
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-1
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-15
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-2
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-3
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-4
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-5
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-6
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-7
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-8
FORMULA_NAME DatabaseWithMutex-COL-02-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1463961769742


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(G((((("site0.all_passive_0>=1")&&("SF0.RecBuff_0>=1"))||(("site1.all_passive_1>=1")&&("SF2.RecBuff_2>=1")))||(("site0.all_passive_0>=1")&&("SF1.RecBuff_1>=1")))||(("site1.all_passive_1>=1")&&("SF3.RecBuff_3>=1")))))U(G(F(G(((("SF0.Modify_0>=1")||("SF2.Modify_2>=1"))||("SF1.Modify_1>=1"))||("SF3.Modify_3>=1")))))))
Formula 0 simplified : !(FG(("SF0.RecBuff_0>=1" & "site0.all_passive_0>=1") | ("SF2.RecBuff_2>=1" & "site1.all_passive_1>=1") | ("SF1.RecBuff_1>=1" & "site0.all_passive_0>=1") | ("SF3.RecBuff_3>=1" & "site1.all_passive_1>=1")) U GFG("SF0.Modify_0>=1" | "SF1.Modify_1>=1" | "SF2.Modify_2>=1" | "SF3.Modify_3>=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,0.308755,28720,1,0,5152,587,325,4363,179,2383,13005
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F(F((((("SF0.Message_0>=1")||("SF2.Message_2>=1"))||("SF1.Message_1>=1"))||("SF3.Message_3>=1"))U((((("SF0.WaitMutex_0>=1")&&("file0.Mutex_0>=1"))||(("SF2.WaitMutex_2>=1")&&("file0.Mutex_0>=1")))||(("SF1.WaitMutex_1>=1")&&("file1.Mutex_1>=1")))||(("SF3.WaitMutex_3>=1")&&("file1.Mutex_1>=1"))))))))
Formula 1 simplified : !F(("SF0.Message_0>=1" | "SF1.Message_1>=1" | "SF2.Message_2>=1" | "SF3.Message_3>=1") U (("SF0.WaitMutex_0>=1" & "file0.Mutex_0>=1") | ("SF2.WaitMutex_2>=1" & "file0.Mutex_0>=1") | ("SF1.WaitMutex_1>=1" & "file1.Mutex_1>=1") | ("SF3.WaitMutex_3>=1" & "file1.Mutex_1>=1")))
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,0.316205,28984,1,0,5164,587,370,4367,181,2383,13165
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-1 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X(G(G(X(((("SF0.Message_0>=1")||("SF2.Message_2>=1"))||("SF1.Message_1>=1"))||("SF3.Message_3>=1"))))))))
Formula 2 simplified : !FXGX("SF0.Message_0>=1" | "SF1.Message_1>=1" | "SF2.Message_2>=1" | "SF3.Message_3>=1")
16 unique states visited
15 strongly connected components in search stack
17 transitions explored
16 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.380177,29608,1,0,7023,647,465,6746,186,2802,18921
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(((("SF0.updating_0>=1")||("SF2.updating_2>=1"))||("SF1.updating_1>=1"))||("SF3.updating_3>=1"))))
Formula 3 simplified : !F("SF0.updating_0>=1" | "SF1.updating_1>=1" | "SF2.updating_2>=1" | "SF3.updating_3>=1")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.399028,30092,1,0,8125,647,497,7470,187,2829,22148
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((((("SF0.Modify_0>=1")||("SF2.Modify_2>=1"))||("SF1.Modify_1>=1"))||("SF3.Modify_3>=1"))U(X(X(F(((("SF0.Message_0>=1")||("SF2.Message_2>=1"))||("SF1.Message_1>=1"))||("SF3.Message_3>=1")))))))
Formula 4 simplified : !(("SF0.Modify_0>=1" | "SF1.Modify_1>=1" | "SF2.Modify_2>=1" | "SF3.Modify_3>=1") U XXF("SF0.Message_0>=1" | "SF1.Message_1>=1" | "SF2.Message_2>=1" | "SF3.Message_3>=1"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.407552,30368,1,0,8368,647,504,7659,187,2829,23039
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-4 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((X(F((((((("SF0.Active_0>=1")&&("SF0.Acknowledge_0>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1"))||(((("SF2.Active_2>=1")&&("SF2.Acknowledge_2>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1")))||(((("SF1.Active_1>=1")&&("SF1.Acknowledge_1>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))||(((("SF3.Active_3>=1")&&("SF3.Acknowledge_3>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))))U(((("SF0.MesBuffReply_0>=1")||("SF2.MesBuffReply_2>=1"))||("SF1.MesBuffReply_1>=1"))||("SF3.MesBuffReply_3>=1")))))
Formula 5 simplified : !G(XF(("SF0.Acknowledge_0>=-(1)" & "SF0.Acknowledge_0>=1" & "SF0.Active_0>=1" & "SF2.Acknowledge_2>=1") | ("SF0.Acknowledge_0>=1" & "SF2.Acknowledge_2>=-(1)" & "SF2.Acknowledge_2>=1" & "SF2.Active_2>=1") | ("SF1.Acknowledge_1>=-(1)" & "SF1.Acknowledge_1>=1" & "SF1.Active_1>=1" & "SF3.Acknowledge_3>=1") | ("SF1.Acknowledge_1>=1" & "SF3.Acknowledge_3>=-(1)" & "SF3.Acknowledge_3>=1" & "SF3.Active_3>=1")) U ("SF0.MesBuffReply_0>=1" | "SF1.MesBuffReply_1>=1" | "SF2.MesBuffReply_2>=1" | "SF3.MesBuffReply_3>=1"))
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 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,3.57612,34624,1,0,10074,657,653,9146,206,2985,29220
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G(F(G(((("SF0.Modify_0>=1")||("SF2.Modify_2>=1"))||("SF1.Modify_1>=1"))||("SF3.Modify_3>=1")))))))
Formula 6 simplified : !FGFG("SF0.Modify_0>=1" | "SF1.Modify_1>=1" | "SF2.Modify_2>=1" | "SF3.Modify_3>=1")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.57791,34624,1,0,10074,657,655,9146,206,2985,29220
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(F((((("site0.all_passive_0>=1")&&("SF0.RecBuff_0>=1"))||(("site1.all_passive_1>=1")&&("SF2.RecBuff_2>=1")))||(("site0.all_passive_0>=1")&&("SF1.RecBuff_1>=1")))||(("site1.all_passive_1>=1")&&("SF3.RecBuff_3>=1"))))))
Formula 7 simplified : !F(("SF0.RecBuff_0>=1" & "site0.all_passive_0>=1") | ("SF2.RecBuff_2>=1" & "site1.all_passive_1>=1") | ("SF1.RecBuff_1>=1" & "site0.all_passive_0>=1") | ("SF3.RecBuff_3>=1" & "site1.all_passive_1>=1"))
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,3.58523,34624,1,0,10551,657,702,9472,207,2987,31852
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-7 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((((("site0.all_passive_0>=1")&&("SF0.RecBuff_0>=1"))||(("site1.all_passive_1>=1")&&("SF2.RecBuff_2>=1")))||(("site0.all_passive_0>=1")&&("SF1.RecBuff_1>=1")))||(("site1.all_passive_1>=1")&&("SF3.RecBuff_3>=1"))))
Formula 8 simplified : !(("SF0.RecBuff_0>=1" & "site0.all_passive_0>=1") | ("SF2.RecBuff_2>=1" & "site1.all_passive_1>=1") | ("SF1.RecBuff_1>=1" & "site0.all_passive_0>=1") | ("SF3.RecBuff_3>=1" & "site1.all_passive_1>=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,3.58706,34624,1,0,10551,657,704,9472,207,2987,31855
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((((((("SF0.Active_0>=1")&&("SF0.Acknowledge_0>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1"))||(((("SF2.Active_2>=1")&&("SF2.Acknowledge_2>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1")))||(((("SF1.Active_1>=1")&&("SF1.Acknowledge_1>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))||(((("SF3.Active_3>=1")&&("SF3.Acknowledge_3>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))U(F(((((((("SF0.Active_0>=1")&&("SF0.Acknowledge_0>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1"))||(((("SF2.Active_2>=1")&&("SF2.Acknowledge_2>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1")))||(((("SF1.Active_1>=1")&&("SF1.Acknowledge_1>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))||(((("SF3.Active_3>=1")&&("SF3.Acknowledge_3>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))U(((("SF0.Modify_0>=1")||("SF2.Modify_2>=1"))||("SF1.Modify_1>=1"))||("SF3.Modify_3>=1"))))))
Formula 9 simplified : !((("SF0.Acknowledge_0>=-(1)" & "SF0.Acknowledge_0>=1" & "SF0.Active_0>=1" & "SF2.Acknowledge_2>=1") | ("SF0.Acknowledge_0>=1" & "SF2.Acknowledge_2>=-(1)" & "SF2.Acknowledge_2>=1" & "SF2.Active_2>=1") | ("SF1.Acknowledge_1>=-(1)" & "SF1.Acknowledge_1>=1" & "SF1.Active_1>=1" & "SF3.Acknowledge_3>=1") | ("SF1.Acknowledge_1>=1" & "SF3.Acknowledge_3>=-(1)" & "SF3.Acknowledge_3>=1" & "SF3.Active_3>=1")) U F((("SF0.Acknowledge_0>=-(1)" & "SF0.Acknowledge_0>=1" & "SF0.Active_0>=1" & "SF2.Acknowledge_2>=1") | ("SF0.Acknowledge_0>=1" & "SF2.Acknowledge_2>=-(1)" & "SF2.Acknowledge_2>=1" & "SF2.Active_2>=1") | ("SF1.Acknowledge_1>=-(1)" & "SF1.Acknowledge_1>=1" & "SF1.Active_1>=1" & "SF3.Acknowledge_3>=1") | ("SF1.Acknowledge_1>=1" & "SF3.Acknowledge_3>=-(1)" & "SF3.Acknowledge_3>=1" & "SF3.Active_3>=1")) U ("SF0.Modify_0>=1" | "SF1.Modify_1>=1" | "SF2.Modify_2>=1" | "SF3.Modify_3>=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,3.8662,41124,1,0,10671,657,713,9553,207,2987,32239
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-9 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(X(((("SF0.MesBuffReply_0>=1")||("SF2.MesBuffReply_2>=1"))||("SF1.MesBuffReply_1>=1"))||("SF3.MesBuffReply_3>=1"))))))
Formula 10 simplified : !XXX("SF0.MesBuffReply_0>=1" | "SF1.MesBuffReply_1>=1" | "SF2.MesBuffReply_2>=1" | "SF3.MesBuffReply_3>=1")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,3.87273,41124,1,0,10879,657,713,9806,207,2992,33238
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((G(F(G(X(F((((((("SF0.Active_0>=1")&&("SF0.Acknowledge_0>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1"))||(((("SF2.Active_2>=1")&&("SF2.Acknowledge_2>=-(1)"))&&("SF0.Acknowledge_0>=1"))&&("SF2.Acknowledge_2>=1")))||(((("SF1.Active_1>=1")&&("SF1.Acknowledge_1>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))||(((("SF3.Active_3>=1")&&("SF3.Acknowledge_3>=-(1)"))&&("SF1.Acknowledge_1>=1"))&&("SF3.Acknowledge_3>=1")))))))))
Formula 11 simplified : !GFGXF(("SF0.Acknowledge_0>=-(1)" & "SF0.Acknowledge_0>=1" & "SF0.Active_0>=1" & "SF2.Acknowledge_2>=1") | ("SF0.Acknowledge_0>=1" & "SF2.Acknowledge_2>=-(1)" & "SF2.Acknowledge_2>=1" & "SF2.Active_2>=1") | ("SF1.Acknowledge_1>=-(1)" & "SF1.Acknowledge_1>=1" & "SF1.Active_1>=1" & "SF3.Acknowledge_3>=1") | ("SF1.Acknowledge_1>=1" & "SF3.Acknowledge_3>=-(1)" & "SF3.Acknowledge_3>=1" & "SF3.Active_3>=1"))
17 unique states visited
17 strongly connected components in search stack
18 transitions explored
17 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,4.09328,41124,1,0,10883,657,780,9816,213,2992,33624
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(((("site0.all_active_0>=1")||("site1.all_active_1>=1"))||("site0.all_active_0>=1"))||("site1.all_active_1>=1"))))
Formula 12 simplified : !X("site0.all_active_0>=1" | "site1.all_active_1>=1")
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.09398,41124,1,0,10883,657,788,9816,213,2992,33642
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(X(((("site0.all_active_0>=1")||("site1.all_active_1>=1"))||("site0.all_active_0>=1"))||("site1.all_active_1>=1")))))
Formula 13 simplified : !XX("site0.all_active_0>=1" | "site1.all_active_1>=1")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,4.10146,41124,1,0,11261,657,788,10207,213,2994,34813
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F(((("SF0.Modify_0>=1")||("SF2.Modify_2>=1"))||("SF1.Modify_1>=1"))||("SF3.Modify_3>=1")))))
Formula 14 simplified : !F("SF0.Modify_0>=1" | "SF1.Modify_1>=1" | "SF2.Modify_2>=1" | "SF3.Modify_3>=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,4.10216,41124,1,0,11261,657,788,10207,213,2994,34813
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X(F(X(G((((("SF0.WaitMutex_0>=1")&&("file0.Mutex_0>=1"))||(("SF2.WaitMutex_2>=1")&&("file0.Mutex_0>=1")))||(("SF1.WaitMutex_1>=1")&&("file1.Mutex_1>=1")))||(("SF3.WaitMutex_3>=1")&&("file1.Mutex_1>=1")))))))))
Formula 15 simplified : !GXFXG(("SF0.WaitMutex_0>=1" & "file0.Mutex_0>=1") | ("SF2.WaitMutex_2>=1" & "file0.Mutex_0>=1") | ("SF1.WaitMutex_1>=1" & "file1.Mutex_1>=1") | ("SF3.WaitMutex_3>=1" & "file1.Mutex_1>=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,4.12121,41124,1,0,12155,657,821,10949,213,2999,39139
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DatabaseWithMutex-COL-02-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1463961781373

--------------------
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 23, 2016 12:02:54 AM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 23, 2016 12:02:54 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 23, 2016 12:02:56 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1755 ms
May 23, 2016 12:02:56 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 11 places.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: read order :VarOrder [vars=[RecBuff[0], RecBuff[1], RecBuff[2], RecBuff[3], all_active[0], all_active[1], Active[0], Active[1], Active[2], Active[3], Mutex[0], Mutex[1], Message[0], Message[1], Message[2], Message[3], Modify[0], Modify[1], Modify[2], Modify[3], MesBuffReply[0], MesBuffReply[1], MesBuffReply[2], MesBuffReply[3], Acknowledge[0], Acknowledge[1], Acknowledge[2], Acknowledge[3], all_passive[0], all_passive[1], updating[0], updating[1], updating[2], updating[3], WaitMutex[0], WaitMutex[1], WaitMutex[2], WaitMutex[3]]]
May 23, 2016 12:02:56 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :site->all_active,all_passive,
SF->RecBuff,Active,Message,Modify,MesBuffReply,Acknowledge,updating,WaitMutex,
file->Mutex,

May 23, 2016 12:02:56 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 8 transitions.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains : CompositeGalOrder [children=[VarOrder [vars=[all_active[0], all_passive[0]]], VarOrder [vars=[all_active[1], all_passive[1]]], VarOrder [vars=[RecBuff[0], Active[0], Message[0], Modify[0], MesBuffReply[0], Acknowledge[0], updating[0], WaitMutex[0]]], VarOrder [vars=[RecBuff[1], Active[1], Message[1], Modify[1], MesBuffReply[1], Acknowledge[1], updating[1], WaitMutex[1]]], VarOrder [vars=[RecBuff[2], Active[2], Message[2], Modify[2], MesBuffReply[2], Acknowledge[2], updating[2], WaitMutex[2]]], VarOrder [vars=[RecBuff[3], Active[3], Message[3], Modify[3], MesBuffReply[3], Acknowledge[3], updating[3], WaitMutex[3]]], VarOrder [vars=[Mutex[0]]], VarOrder [vars=[Mutex[1]]]]]
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 91 ms
May 23, 2016 12:02:56 AM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 35 ms
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[all_active[0], all_passive[0], ],[all_active[1], all_passive[1], ],[RecBuff[0], Active[0], Message[0], Modify[0], MesBuffReply[0], Acknowledge[0], updating[0], WaitMutex[0], ],[RecBuff[1], Active[1], Message[1], Modify[1], MesBuffReply[1], Acknowledge[1], updating[1], WaitMutex[1], ],[RecBuff[2], Active[2], Message[2], Modify[2], MesBuffReply[2], Acknowledge[2], updating[2], WaitMutex[2], ],[RecBuff[3], Active[3], Message[3], Modify[3], MesBuffReply[3], Acknowledge[3], updating[3], WaitMutex[3], ],[Mutex[0], ],[Mutex[1], ],

May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array RecBuff to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array all_active to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array Active to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array Mutex to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array Message to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array Modify to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array MesBuffReply to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array Acknowledge to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array all_passive to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array updating to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array WaitMutex to variables to allow decomposition.
May 23, 2016 12:02:56 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 6 redundant transitions.
May 23, 2016 12:02:56 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 15 ms
May 23, 2016 12:02:56 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 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="DatabaseWithMutex-COL-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/fko/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/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-02 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 DatabaseWithMutex-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r013kn-qhx2-146347844800123"
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 ;