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_LamportFastMutEx-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157kn-blw3-146416412600177
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464177868404


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(X((((((("pid0.P_ify0_4_0>=1")&&("pid1.y_1>=1"))||(("pid0.P_ify0_4_0>=1")&&("pid2.y_2>=1")))||(("pid1.P_ify0_4_1>=1")&&("pid1.y_1>=1")))||(("pid1.P_ify0_4_1>=1")&&("pid2.y_2>=1")))||(("pid2.P_ify0_4_2>=1")&&("pid1.y_1>=1")))||(("pid2.P_ify0_4_2>=1")&&("pid2.y_2>=1")))))U(X(G(G((((((("pid0.x_0>=1")&&("pid1.P_ifxi_10_1>=1"))||(("pid0.x_0>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid1.x_1>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid1.x_1>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid2.x_2>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid2.x_2>=1")&&("pid1.P_ifxi_10_1>=1"))))))))
Formula 0 simplified : !(FX(("pid0.P_ify0_4_0>=1" & "pid1.y_1>=1") | ("pid0.P_ify0_4_0>=1" & "pid2.y_2>=1") | ("pid1.P_ify0_4_1>=1" & "pid1.y_1>=1") | ("pid1.P_ify0_4_1>=1" & "pid2.y_2>=1") | ("pid1.y_1>=1" & "pid2.P_ify0_4_2>=1") | ("pid2.P_ify0_4_2>=1" & "pid2.y_2>=1")) U XG(("pid0.x_0>=1" & "pid1.P_ifxi_10_1>=1") | ("pid0.x_0>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid1.x_1>=1") | ("pid1.x_1>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid2.x_2>=1") | ("pid1.P_ifxi_10_1>=1" & "pid2.x_2>=1")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
14 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.205344,32464,1,0,8674,4016,1017,10881,344,19586,36227
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(G(X(X(G((((((("pid1.y_1>=1")&&("pid0.P_ifyi_15_0>=1"))||(("pid2.y_2>=1")&&("pid0.P_ifyi_15_0>=1")))||(("pid0.y_0>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid2.y_2>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_ifyi_15_2>=1")))||(("pid1.y_1>=1")&&("pid2.P_ifyi_15_2>=1")))))))))
Formula 1 simplified : !GXXG(("pid0.P_ifyi_15_0>=1" & "pid1.y_1>=1") | ("pid0.P_ifyi_15_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_ifyi_15_1>=1") | ("pid1.P_ifyi_15_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_ifyi_15_2>=1") | ("pid1.y_1>=1" & "pid2.P_ifyi_15_2>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.230698,33304,1,0,9646,4080,1203,12733,352,20884,42581
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((G(G((((((("pid1.y_1>=1")&&("pid0.P_ifyi_15_0>=1"))||(("pid2.y_2>=1")&&("pid0.P_ifyi_15_0>=1")))||(("pid0.y_0>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid2.y_2>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_ifyi_15_2>=1")))||(("pid1.y_1>=1")&&("pid2.P_ifyi_15_2>=1")))))U((((((("pid0.P_setbi_24_0>=1")&&("pid_x_bool0.b_0>=1"))||(("pid0.P_setbi_24_0>=1")&&("pid_x_bool1.b_1>=1")))||(("pid1.P_setbi_24_1>=1")&&("pid_x_bool2.b_2>=1")))||(("pid1.P_setbi_24_1>=1")&&("pid_x_bool3.b_3>=1")))||(("pid2.P_setbi_24_2>=1")&&("pid_x_bool4.b_4>=1")))||(("pid2.P_setbi_24_2>=1")&&("pid_x_bool5.b_5>=1"))))))
Formula 2 simplified : !G(G(("pid0.P_ifyi_15_0>=1" & "pid1.y_1>=1") | ("pid0.P_ifyi_15_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_ifyi_15_1>=1") | ("pid1.P_ifyi_15_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_ifyi_15_2>=1") | ("pid1.y_1>=1" & "pid2.P_ifyi_15_2>=1")) U (("pid0.P_setbi_24_0>=1" & "pid_x_bool0.b_0>=1") | ("pid0.P_setbi_24_0>=1" & "pid_x_bool1.b_1>=1") | ("pid1.P_setbi_24_1>=1" & "pid_x_bool2.b_2>=1") | ("pid1.P_setbi_24_1>=1" & "pid_x_bool3.b_3>=1") | ("pid2.P_setbi_24_2>=1" & "pid_x_bool4.b_4>=1") | ("pid2.P_setbi_24_2>=1" & "pid_x_bool5.b_5>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.75784,43404,1,0,10106,4080,1409,13461,354,21060,45708
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F((F(((((((((("pid0.P_sety_9_0>=1")&&("pid0.y_0>=1"))||(("pid0.P_sety_9_0>=1")&&("pid1.y_1>=1")))||(("pid0.P_sety_9_0>=1")&&("pid2.y_2>=1")))||(("pid1.P_sety_9_1>=1")&&("pid0.y_0>=1")))||(("pid1.P_sety_9_1>=1")&&("pid1.y_1>=1")))||(("pid1.P_sety_9_1>=1")&&("pid2.y_2>=1")))||(("pid2.P_sety_9_2>=1")&&("pid0.y_0>=1")))||(("pid2.P_sety_9_2>=1")&&("pid1.y_1>=1")))||(("pid2.P_sety_9_2>=1")&&("pid2.y_2>=1"))))U(G(((("pid0.P_ifyi_15_0>=1")&&("pid0.y_0>=1"))||(("pid1.P_ifyi_15_1>=1")&&("pid1.y_1>=1")))||(("pid2.P_ifyi_15_2>=1")&&("pid2.y_2>=1"))))))))
Formula 3 simplified : !XF(F(("pid0.P_sety_9_0>=1" & "pid0.y_0>=1") | ("pid0.P_sety_9_0>=1" & "pid1.y_1>=1") | ("pid0.P_sety_9_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_sety_9_1>=1") | ("pid1.P_sety_9_1>=1" & "pid1.y_1>=1") | ("pid1.P_sety_9_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_sety_9_2>=1") | ("pid1.y_1>=1" & "pid2.P_sety_9_2>=1") | ("pid2.P_sety_9_2>=1" & "pid2.y_2>=1")) U G(("pid0.P_ifyi_15_0>=1" & "pid0.y_0>=1") | ("pid1.P_ifyi_15_1>=1" & "pid1.y_1>=1") | ("pid2.P_ifyi_15_2>=1" & "pid2.y_2>=1")))
3 unique states visited
3 strongly connected components in search stack
3 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,3.829,43464,1,0,13844,4132,1509,17381,356,22955,68921
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(X((((((("pid0.x_0>=1")&&("pid1.P_ifxi_10_1>=1"))||(("pid0.x_0>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid1.x_1>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid1.x_1>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid2.x_2>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid2.x_2>=1")&&("pid1.P_ifxi_10_1>=1")))))))
Formula 4 simplified : !XXX(("pid0.x_0>=1" & "pid1.P_ifxi_10_1>=1") | ("pid0.x_0>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid1.x_1>=1") | ("pid1.x_1>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid2.x_2>=1") | ("pid1.P_ifxi_10_1>=1" & "pid2.x_2>=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.8343,43464,1,0,13992,4132,1510,17525,356,23001,70161
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G((G(((((((((("pid0.P_sety_9_0>=1")&&("pid0.y_0>=1"))||(("pid0.P_sety_9_0>=1")&&("pid1.y_1>=1")))||(("pid0.P_sety_9_0>=1")&&("pid2.y_2>=1")))||(("pid1.P_sety_9_1>=1")&&("pid0.y_0>=1")))||(("pid1.P_sety_9_1>=1")&&("pid1.y_1>=1")))||(("pid1.P_sety_9_1>=1")&&("pid2.y_2>=1")))||(("pid2.P_sety_9_2>=1")&&("pid0.y_0>=1")))||(("pid2.P_sety_9_2>=1")&&("pid1.y_1>=1")))||(("pid2.P_sety_9_2>=1")&&("pid2.y_2>=1"))))U((((((("pid0.P_setbi_24_0>=1")&&("pid_x_bool0.b_0>=1"))||(("pid0.P_setbi_24_0>=1")&&("pid_x_bool1.b_1>=1")))||(("pid1.P_setbi_24_1>=1")&&("pid_x_bool2.b_2>=1")))||(("pid1.P_setbi_24_1>=1")&&("pid_x_bool3.b_3>=1")))||(("pid2.P_setbi_24_2>=1")&&("pid_x_bool4.b_4>=1")))||(("pid2.P_setbi_24_2>=1")&&("pid_x_bool5.b_5>=1")))))))
Formula 5 simplified : !XG(G(("pid0.P_sety_9_0>=1" & "pid0.y_0>=1") | ("pid0.P_sety_9_0>=1" & "pid1.y_1>=1") | ("pid0.P_sety_9_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_sety_9_1>=1") | ("pid1.P_sety_9_1>=1" & "pid1.y_1>=1") | ("pid1.P_sety_9_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_sety_9_2>=1") | ("pid1.y_1>=1" & "pid2.P_sety_9_2>=1") | ("pid2.P_sety_9_2>=1" & "pid2.y_2>=1")) U (("pid0.P_setbi_24_0>=1" & "pid_x_bool0.b_0>=1") | ("pid0.P_setbi_24_0>=1" & "pid_x_bool1.b_1>=1") | ("pid1.P_setbi_24_1>=1" & "pid_x_bool2.b_2>=1") | ("pid1.P_setbi_24_1>=1" & "pid_x_bool3.b_3>=1") | ("pid2.P_setbi_24_2>=1" & "pid_x_bool4.b_4>=1") | ("pid2.P_setbi_24_2>=1" & "pid_x_bool5.b_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,7.90209,46120,1,0,14133,4132,1633,17740,361,23002,71614
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(G((((((("pid1.y_1>=1")&&("pid0.P_ifyi_15_0>=1"))||(("pid2.y_2>=1")&&("pid0.P_ifyi_15_0>=1")))||(("pid0.y_0>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid2.y_2>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_ifyi_15_2>=1")))||(("pid1.y_1>=1")&&("pid2.P_ifyi_15_2>=1")))))U((F(((("pid0.y_0>=1")&&("pid0.P_ify0_4_0>=1"))||(("pid0.y_0>=1")&&("pid1.P_ify0_4_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_ify0_4_2>=1"))))U(G((((((("pid0.P_setbi_11_0>=1")&&("pid_x_bool0.b_0>=1"))||(("pid0.P_setbi_11_0>=1")&&("pid_x_bool1.b_1>=1")))||(("pid1.P_setbi_11_1>=1")&&("pid_x_bool2.b_2>=1")))||(("pid1.P_setbi_11_1>=1")&&("pid_x_bool3.b_3>=1")))||(("pid2.P_setbi_11_2>=1")&&("pid_x_bool4.b_4>=1")))||(("pid2.P_setbi_11_2>=1")&&("pid_x_bool5.b_5>=1")))))))
Formula 6 simplified : !(FG(("pid0.P_ifyi_15_0>=1" & "pid1.y_1>=1") | ("pid0.P_ifyi_15_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_ifyi_15_1>=1") | ("pid1.P_ifyi_15_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_ifyi_15_2>=1") | ("pid1.y_1>=1" & "pid2.P_ifyi_15_2>=1")) U (F(("pid0.P_ify0_4_0>=1" & "pid0.y_0>=1") | ("pid0.y_0>=1" & "pid1.P_ify0_4_1>=1") | ("pid0.y_0>=1" & "pid2.P_ify0_4_2>=1")) U G(("pid0.P_setbi_11_0>=1" & "pid_x_bool0.b_0>=1") | ("pid0.P_setbi_11_0>=1" & "pid_x_bool1.b_1>=1") | ("pid1.P_setbi_11_1>=1" & "pid_x_bool2.b_2>=1") | ("pid1.P_setbi_11_1>=1" & "pid_x_bool3.b_3>=1") | ("pid2.P_setbi_11_2>=1" & "pid_x_bool4.b_4>=1") | ("pid2.P_setbi_11_2>=1" & "pid_x_bool5.b_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,33.802,52672,1,0,14730,4138,1774,18253,366,23282,76022
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((F((((((("pid0.x_0>=1")&&("pid1.P_ifxi_10_1>=1"))||(("pid0.x_0>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid1.x_1>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid1.x_1>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid2.x_2>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid2.x_2>=1")&&("pid1.P_ifxi_10_1>=1"))))U(G(((("pid0.P_ifyi_15_0>=1")&&("pid0.y_0>=1"))||(("pid1.P_ifyi_15_1>=1")&&("pid1.y_1>=1")))||(("pid2.P_ifyi_15_2>=1")&&("pid2.y_2>=1"))))))
Formula 7 simplified : !(F(("pid0.x_0>=1" & "pid1.P_ifxi_10_1>=1") | ("pid0.x_0>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid1.x_1>=1") | ("pid1.x_1>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid2.x_2>=1") | ("pid1.P_ifxi_10_1>=1" & "pid2.x_2>=1")) U G(("pid0.P_ifyi_15_0>=1" & "pid0.y_0>=1") | ("pid1.P_ifyi_15_1>=1" & "pid1.y_1>=1") | ("pid2.P_ifyi_15_2>=1" & "pid2.y_2>=1")))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,33.9169,52672,1,0,15699,4152,1871,19077,371,23370,82608
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(((((((((((("pid0.P_sety_9_0>=1")&&("pid0.y_0>=1"))||(("pid0.P_sety_9_0>=1")&&("pid1.y_1>=1")))||(("pid0.P_sety_9_0>=1")&&("pid2.y_2>=1")))||(("pid1.P_sety_9_1>=1")&&("pid0.y_0>=1")))||(("pid1.P_sety_9_1>=1")&&("pid1.y_1>=1")))||(("pid1.P_sety_9_1>=1")&&("pid2.y_2>=1")))||(("pid2.P_sety_9_2>=1")&&("pid0.y_0>=1")))||(("pid2.P_sety_9_2>=1")&&("pid1.y_1>=1")))||(("pid2.P_sety_9_2>=1")&&("pid2.y_2>=1")))U(((((((((("pid0.x_0>=1")&&("pid0.P_setx_3_0>=1"))||(("pid0.x_0>=1")&&("pid1.P_setx_3_1>=1")))||(("pid0.x_0>=1")&&("pid2.P_setx_3_2>=1")))||(("pid1.x_1>=1")&&("pid0.P_setx_3_0>=1")))||(("pid1.x_1>=1")&&("pid1.P_setx_3_1>=1")))||(("pid1.x_1>=1")&&("pid2.P_setx_3_2>=1")))||(("pid2.x_2>=1")&&("pid0.P_setx_3_0>=1")))||(("pid2.x_2>=1")&&("pid1.P_setx_3_1>=1")))||(("pid2.x_2>=1")&&("pid2.P_setx_3_2>=1"))))U(X(G((("pid0.P_fordo_12_0>=1")||("pid1.P_fordo_12_1>=1"))||("pid2.P_fordo_12_2>=1")))))))
Formula 8 simplified : !G(((("pid0.P_sety_9_0>=1" & "pid0.y_0>=1") | ("pid0.P_sety_9_0>=1" & "pid1.y_1>=1") | ("pid0.P_sety_9_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_sety_9_1>=1") | ("pid1.P_sety_9_1>=1" & "pid1.y_1>=1") | ("pid1.P_sety_9_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_sety_9_2>=1") | ("pid1.y_1>=1" & "pid2.P_sety_9_2>=1") | ("pid2.P_sety_9_2>=1" & "pid2.y_2>=1")) U (("pid0.P_setx_3_0>=1" & "pid0.x_0>=1") | ("pid0.x_0>=1" & "pid1.P_setx_3_1>=1") | ("pid0.x_0>=1" & "pid2.P_setx_3_2>=1") | ("pid0.P_setx_3_0>=1" & "pid1.x_1>=1") | ("pid1.P_setx_3_1>=1" & "pid1.x_1>=1") | ("pid1.x_1>=1" & "pid2.P_setx_3_2>=1") | ("pid0.P_setx_3_0>=1" & "pid2.x_2>=1") | ("pid1.P_setx_3_1>=1" & "pid2.x_2>=1") | ("pid2.P_setx_3_2>=1" & "pid2.x_2>=1"))) U XG("pid0.P_fordo_12_0>=1" | "pid1.P_fordo_12_1>=1" | "pid2.P_fordo_12_2>=1"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,37.5674,66784,1,0,17786,4193,2124,21649,388,24967,97099
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((((((((((("pid0.y_0>=1")&&("pid0.P_CS_21_0>=1"))||(("pid1.y_1>=1")&&("pid0.P_CS_21_0>=1")))||(("pid2.y_2>=1")&&("pid0.P_CS_21_0>=1")))||(("pid0.y_0>=1")&&("pid1.P_CS_21_1>=1")))||(("pid1.y_1>=1")&&("pid1.P_CS_21_1>=1")))||(("pid2.y_2>=1")&&("pid1.P_CS_21_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_CS_21_2>=1")))||(("pid1.y_1>=1")&&("pid2.P_CS_21_2>=1")))||(("pid2.y_2>=1")&&("pid2.P_CS_21_2>=1"))))
Formula 9 simplified : !(("pid0.P_CS_21_0>=1" & "pid0.y_0>=1") | ("pid0.P_CS_21_0>=1" & "pid1.y_1>=1") | ("pid0.P_CS_21_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_CS_21_1>=1") | ("pid1.P_CS_21_1>=1" & "pid1.y_1>=1") | ("pid1.P_CS_21_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_CS_21_2>=1") | ("pid1.y_1>=1" & "pid2.P_CS_21_2>=1") | ("pid2.P_CS_21_2>=1" & "pid2.y_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,37.5692,66784,1,0,17786,4193,2166,21649,391,24967,97162
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(G(X((("pid0.P_fordo_12_0>=1")||("pid1.P_fordo_12_1>=1"))||("pid2.P_fordo_12_2>=1")))))))
Formula 10 simplified : !FGX("pid0.P_fordo_12_0>=1" | "pid1.P_fordo_12_1>=1" | "pid2.P_fordo_12_2>=1")
5 unique states visited
4 strongly connected components in search stack
6 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,37.5767,66784,1,0,18132,4201,2173,21968,391,25124,98983
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((F(G(((("pid0.P_ifyi_15_0>=1")&&("pid0.y_0>=1"))||(("pid1.P_ifyi_15_1>=1")&&("pid1.y_1>=1")))||(("pid2.P_ifyi_15_2>=1")&&("pid2.y_2>=1")))))U(((((((((("pid0.y_0>=1")&&("pid0.P_CS_21_0>=1"))||(("pid1.y_1>=1")&&("pid0.P_CS_21_0>=1")))||(("pid2.y_2>=1")&&("pid0.P_CS_21_0>=1")))||(("pid0.y_0>=1")&&("pid1.P_CS_21_1>=1")))||(("pid1.y_1>=1")&&("pid1.P_CS_21_1>=1")))||(("pid2.y_2>=1")&&("pid1.P_CS_21_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_CS_21_2>=1")))||(("pid1.y_1>=1")&&("pid2.P_CS_21_2>=1")))||(("pid2.y_2>=1")&&("pid2.P_CS_21_2>=1"))))))
Formula 11 simplified : !X(FG(("pid0.P_ifyi_15_0>=1" & "pid0.y_0>=1") | ("pid1.P_ifyi_15_1>=1" & "pid1.y_1>=1") | ("pid2.P_ifyi_15_2>=1" & "pid2.y_2>=1")) U (("pid0.P_CS_21_0>=1" & "pid0.y_0>=1") | ("pid0.P_CS_21_0>=1" & "pid1.y_1>=1") | ("pid0.P_CS_21_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_CS_21_1>=1") | ("pid1.P_CS_21_1>=1" & "pid1.y_1>=1") | ("pid1.P_CS_21_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_CS_21_2>=1") | ("pid1.y_1>=1" & "pid2.P_CS_21_2>=1") | ("pid2.P_CS_21_2>=1" & "pid2.y_2>=1")))
18 unique states visited
17 strongly connected components in search stack
18 transitions explored
17 items max in DFS search stack
7 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,37.671,66784,1,0,22218,4210,2198,25462,391,25771,119748
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((F(((((((("pid0.P_setbi_11_0>=1")&&("pid_x_bool0.b_0>=1"))||(("pid0.P_setbi_11_0>=1")&&("pid_x_bool1.b_1>=1")))||(("pid1.P_setbi_11_1>=1")&&("pid_x_bool2.b_2>=1")))||(("pid1.P_setbi_11_1>=1")&&("pid_x_bool3.b_3>=1")))||(("pid2.P_setbi_11_2>=1")&&("pid_x_bool4.b_4>=1")))||(("pid2.P_setbi_11_2>=1")&&("pid_x_bool5.b_5>=1")))U((("pid0.P_fordo_12_0>=1")||("pid1.P_fordo_12_1>=1"))||("pid2.P_fordo_12_2>=1"))))U((((((((((("pid0.x_0>=1")&&("pid0.P_setx_3_0>=1"))||(("pid0.x_0>=1")&&("pid1.P_setx_3_1>=1")))||(("pid0.x_0>=1")&&("pid2.P_setx_3_2>=1")))||(("pid1.x_1>=1")&&("pid0.P_setx_3_0>=1")))||(("pid1.x_1>=1")&&("pid1.P_setx_3_1>=1")))||(("pid1.x_1>=1")&&("pid2.P_setx_3_2>=1")))||(("pid2.x_2>=1")&&("pid0.P_setx_3_0>=1")))||(("pid2.x_2>=1")&&("pid1.P_setx_3_1>=1")))||(("pid2.x_2>=1")&&("pid2.P_setx_3_2>=1")))U(F((((((((((("pid_x_pid0.wait_0>=1")&&("pid0.P_await_13_0>=1"))&&("pid_x_bool0.b_0>=1"))||((("pid_x_pid1.wait_1>=1")&&("pid0.P_await_13_0>=1"))&&("pid_x_bool2.b_2>=1")))||((("pid_x_pid2.wait_2>=1")&&("pid0.P_await_13_0>=1"))&&("pid_x_bool4.b_4>=1")))||((("pid_x_pid3.wait_3>=1")&&("pid1.P_await_13_1>=1"))&&("pid_x_bool0.b_0>=1")))||((("pid_x_pid4.wait_4>=1")&&("pid1.P_await_13_1>=1"))&&("pid_x_bool2.b_2>=1")))||((("pid_x_pid5.wait_5>=1")&&("pid1.P_await_13_1>=1"))&&("pid_x_bool4.b_4>=1")))||((("pid_x_pid6.wait_6>=1")&&("pid2.P_await_13_2>=1"))&&("pid_x_bool0.b_0>=1")))||((("pid_x_pid7.wait_7>=1")&&("pid2.P_await_13_2>=1"))&&("pid_x_bool2.b_2>=1")))||((("pid_x_pid8.wait_8>=1")&&("pid2.P_await_13_2>=1"))&&("pid_x_bool4.b_4>=1")))))))
Formula 12 simplified : !(F((("pid0.P_setbi_11_0>=1" & "pid_x_bool0.b_0>=1") | ("pid0.P_setbi_11_0>=1" & "pid_x_bool1.b_1>=1") | ("pid1.P_setbi_11_1>=1" & "pid_x_bool2.b_2>=1") | ("pid1.P_setbi_11_1>=1" & "pid_x_bool3.b_3>=1") | ("pid2.P_setbi_11_2>=1" & "pid_x_bool4.b_4>=1") | ("pid2.P_setbi_11_2>=1" & "pid_x_bool5.b_5>=1")) U ("pid0.P_fordo_12_0>=1" | "pid1.P_fordo_12_1>=1" | "pid2.P_fordo_12_2>=1")) U ((("pid0.P_setx_3_0>=1" & "pid0.x_0>=1") | ("pid0.x_0>=1" & "pid1.P_setx_3_1>=1") | ("pid0.x_0>=1" & "pid2.P_setx_3_2>=1") | ("pid0.P_setx_3_0>=1" & "pid1.x_1>=1") | ("pid1.P_setx_3_1>=1" & "pid1.x_1>=1") | ("pid1.x_1>=1" & "pid2.P_setx_3_2>=1") | ("pid0.P_setx_3_0>=1" & "pid2.x_2>=1") | ("pid1.P_setx_3_1>=1" & "pid2.x_2>=1") | ("pid2.P_setx_3_2>=1" & "pid2.x_2>=1")) U F(("pid0.P_await_13_0>=1" & "pid_x_bool0.b_0>=1" & "pid_x_pid0.wait_0>=1") | ("pid0.P_await_13_0>=1" & "pid_x_bool2.b_2>=1" & "pid_x_pid1.wait_1>=1") | ("pid0.P_await_13_0>=1" & "pid_x_bool4.b_4>=1" & "pid_x_pid2.wait_2>=1") | ("pid1.P_await_13_1>=1" & "pid_x_bool0.b_0>=1" & "pid_x_pid3.wait_3>=1") | ("pid1.P_await_13_1>=1" & "pid_x_bool2.b_2>=1" & "pid_x_pid4.wait_4>=1") | ("pid1.P_await_13_1>=1" & "pid_x_bool4.b_4>=1" & "pid_x_pid5.wait_5>=1") | ("pid2.P_await_13_2>=1" & "pid_x_bool0.b_0>=1" & "pid_x_pid6.wait_6>=1") | ("pid2.P_await_13_2>=1" & "pid_x_bool2.b_2>=1" & "pid_x_pid7.wait_7>=1") | ("pid2.P_await_13_2>=1" & "pid_x_bool4.b_4>=1" & "pid_x_pid8.wait_8>=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,617.768,853568,1,0,23256,4210,2427,26323,391,25782,133655
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(G(G(((((("pid0.P_await_13_0>=1")&&("pid_x_pid1.done_1>=1"))&&("pid_x_pid2.done_2>=1"))||((("pid1.P_await_13_1>=1")&&("pid_x_pid4.done_4>=1"))&&("pid_x_pid5.done_5>=1")))||((("pid2.P_await_13_2>=1")&&("pid_x_pid7.done_7>=1"))&&("pid_x_pid8.done_8>=1")))U((((((("pid0.P_setbi_11_0>=1")&&("pid_x_bool0.b_0>=1"))||(("pid0.P_setbi_11_0>=1")&&("pid_x_bool1.b_1>=1")))||(("pid1.P_setbi_11_1>=1")&&("pid_x_bool2.b_2>=1")))||(("pid1.P_setbi_11_1>=1")&&("pid_x_bool3.b_3>=1")))||(("pid2.P_setbi_11_2>=1")&&("pid_x_bool4.b_4>=1")))||(("pid2.P_setbi_11_2>=1")&&("pid_x_bool5.b_5>=1"))))))))
Formula 13 simplified : !G((("pid0.P_await_13_0>=1" & "pid_x_pid1.done_1>=1" & "pid_x_pid2.done_2>=1") | ("pid1.P_await_13_1>=1" & "pid_x_pid4.done_4>=1" & "pid_x_pid5.done_5>=1") | ("pid2.P_await_13_2>=1" & "pid_x_pid7.done_7>=1" & "pid_x_pid8.done_8>=1")) U (("pid0.P_setbi_11_0>=1" & "pid_x_bool0.b_0>=1") | ("pid0.P_setbi_11_0>=1" & "pid_x_bool1.b_1>=1") | ("pid1.P_setbi_11_1>=1" & "pid_x_bool2.b_2>=1") | ("pid1.P_setbi_11_1>=1" & "pid_x_bool3.b_3>=1") | ("pid2.P_setbi_11_2>=1" & "pid_x_bool4.b_4>=1") | ("pid2.P_setbi_11_2>=1" & "pid_x_bool5.b_5>=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,638.089,885496,1,0,23256,4210,2571,26323,391,25782,133811
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((X(F(((("pid0.y_0>=1")&&("pid0.P_awaity_0>=1"))||(("pid0.y_0>=1")&&("pid1.P_awaity_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_awaity_2>=1")))))U(G(X(F((((((("pid1.y_1>=1")&&("pid0.P_ifyi_15_0>=1"))||(("pid2.y_2>=1")&&("pid0.P_ifyi_15_0>=1")))||(("pid0.y_0>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid2.y_2>=1")&&("pid1.P_ifyi_15_1>=1")))||(("pid0.y_0>=1")&&("pid2.P_ifyi_15_2>=1")))||(("pid1.y_1>=1")&&("pid2.P_ifyi_15_2>=1"))))))))
Formula 14 simplified : !(XF(("pid0.P_awaity_0>=1" & "pid0.y_0>=1") | ("pid0.y_0>=1" & "pid1.P_awaity_1>=1") | ("pid0.y_0>=1" & "pid2.P_awaity_2>=1")) U GXF(("pid0.P_ifyi_15_0>=1" & "pid1.y_1>=1") | ("pid0.P_ifyi_15_0>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid1.P_ifyi_15_1>=1") | ("pid1.P_ifyi_15_1>=1" & "pid2.y_2>=1") | ("pid0.y_0>=1" & "pid2.P_ifyi_15_2>=1") | ("pid1.y_1>=1" & "pid2.P_ifyi_15_2>=1")))
6 unique states visited
6 strongly connected components in search stack
7 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,638.101,885496,1,0,23363,4210,2619,26460,393,25831,134741
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((((((((("pid0.P_setbi_24_0>=1")&&("pid_x_bool0.b_0>=1"))||(("pid0.P_setbi_24_0>=1")&&("pid_x_bool1.b_1>=1")))||(("pid1.P_setbi_24_1>=1")&&("pid_x_bool2.b_2>=1")))||(("pid1.P_setbi_24_1>=1")&&("pid_x_bool3.b_3>=1")))||(("pid2.P_setbi_24_2>=1")&&("pid_x_bool4.b_4>=1")))||(("pid2.P_setbi_24_2>=1")&&("pid_x_bool5.b_5>=1")))U(G(X(X((((((("pid0.x_0>=1")&&("pid1.P_ifxi_10_1>=1"))||(("pid0.x_0>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid1.x_1>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid1.x_1>=1")&&("pid2.P_ifxi_10_2>=1")))||(("pid2.x_2>=1")&&("pid0.P_ifxi_10_0>=1")))||(("pid2.x_2>=1")&&("pid1.P_ifxi_10_1>=1"))))))))
Formula 15 simplified : !((("pid0.P_setbi_24_0>=1" & "pid_x_bool0.b_0>=1") | ("pid0.P_setbi_24_0>=1" & "pid_x_bool1.b_1>=1") | ("pid1.P_setbi_24_1>=1" & "pid_x_bool2.b_2>=1") | ("pid1.P_setbi_24_1>=1" & "pid_x_bool3.b_3>=1") | ("pid2.P_setbi_24_2>=1" & "pid_x_bool4.b_4>=1") | ("pid2.P_setbi_24_2>=1" & "pid_x_bool5.b_5>=1")) U GXX(("pid0.x_0>=1" & "pid1.P_ifxi_10_1>=1") | ("pid0.x_0>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid1.x_1>=1") | ("pid1.x_1>=1" & "pid2.P_ifxi_10_2>=1") | ("pid0.P_ifxi_10_0>=1" & "pid2.x_2>=1") | ("pid1.P_ifxi_10_1>=1" & "pid2.x_2>=1")))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,641.518,900068,1,0,25129,4226,2623,28347,393,26593,144283
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1464178514613

--------------------
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 25, 2016 12:04:30 PM fr.lip6.move.gal.application.Application transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2016 12:04:30 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 25, 2016 12:04:32 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1620 ms
May 25, 2016 12:04:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 18 places.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: read order :VarOrder [vars=[P_start_1[0], P_start_1[1], P_start_1[2], x[0], x[1], x[2], y[0], y[1], y[2], b[0], b[1], b[2], b[3], b[4], b[5], P_setx_3[0], P_setx_3[1], P_setx_3[2], P_setbi_5[0], P_setbi_5[1], P_setbi_5[2], P_ify0_4[0], P_ify0_4[1], P_ify0_4[2], P_sety_9[0], P_sety_9[1], P_sety_9[2], P_ifxi_10[0], P_ifxi_10[1], P_ifxi_10[2], P_setbi_11[0], P_setbi_11[1], P_setbi_11[2], P_fordo_12[0], P_fordo_12[1], P_fordo_12[2], wait[0], wait[1], wait[2], wait[3], wait[4], wait[5], wait[6], wait[7], wait[8], P_await_13[0], P_await_13[1], P_await_13[2], done[0], done[1], done[2], done[3], done[4], done[5], done[6], done[7], done[8], P_ifyi_15[0], P_ifyi_15[1], P_ifyi_15[2], P_awaity[0], P_awaity[1], P_awaity[2], P_CS_21[0], P_CS_21[1], P_CS_21[2], P_setbi_24[0], P_setbi_24[1], P_setbi_24[2]]]
May 25, 2016 12:04:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

May 25, 2016 12:04:32 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 17 transitions.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains : CompositeGalOrder [children=[VarOrder [vars=[wait[0], done[0]]], VarOrder [vars=[wait[1], done[1]]], VarOrder [vars=[wait[2], done[2]]], VarOrder [vars=[wait[3], done[3]]], VarOrder [vars=[wait[4], done[4]]], VarOrder [vars=[wait[5], done[5]]], VarOrder [vars=[wait[6], done[6]]], VarOrder [vars=[wait[7], done[7]]], VarOrder [vars=[wait[8], done[8]]], VarOrder [vars=[b[0]]], VarOrder [vars=[b[1]]], VarOrder [vars=[b[2]]], VarOrder [vars=[b[3]]], VarOrder [vars=[b[4]]], VarOrder [vars=[b[5]]], VarOrder [vars=[P_start_1[0], x[0], y[0], P_setx_3[0], P_setbi_5[0], P_ify0_4[0], P_sety_9[0], P_ifxi_10[0], P_setbi_11[0], P_fordo_12[0], P_await_13[0], P_ifyi_15[0], P_awaity[0], P_CS_21[0], P_setbi_24[0]]], VarOrder [vars=[P_start_1[1], x[1], y[1], P_setx_3[1], P_setbi_5[1], P_ify0_4[1], P_sety_9[1], P_ifxi_10[1], P_setbi_11[1], P_fordo_12[1], P_await_13[1], P_ifyi_15[1], P_awaity[1], P_CS_21[1], P_setbi_24[1]]], VarOrder [vars=[P_start_1[2], x[2], y[2], P_setx_3[2], P_setbi_5[2], P_ify0_4[2], P_sety_9[2], P_ifxi_10[2], P_setbi_11[2], P_fordo_12[2], P_await_13[2], P_ifyi_15[2], P_awaity[2], P_CS_21[2], P_setbi_24[2]]]]]
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $y of transition T_yeqi_15
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $x of transition T_xeqi_10
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 7 instantiations of transitions. Total transitions/syncs built is 119
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 71 ms
May 25, 2016 12:04:32 PM fr.lip6.move.gal.application.Application applyOrder
INFO: Applying decomposition
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 24 ms
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Partition obtained :[wait[0], done[0], ],[wait[1], done[1], ],[wait[2], done[2], ],[wait[3], done[3], ],[wait[4], done[4], ],[wait[5], done[5], ],[wait[6], done[6], ],[wait[7], done[7], ],[wait[8], done[8], ],[b[0], ],[b[1], ],[b[2], ],[b[3], ],[b[4], ],[b[5], ],[P_start_1[0], x[0], y[0], P_setx_3[0], P_setbi_5[0], P_ify0_4[0], P_sety_9[0], P_ifxi_10[0], P_setbi_11[0], P_fordo_12[0], P_await_13[0], P_ifyi_15[0], P_awaity[0], P_CS_21[0], P_setbi_24[0], ],[P_start_1[1], x[1], y[1], P_setx_3[1], P_setbi_5[1], P_ify0_4[1], P_sety_9[1], P_ifxi_10[1], P_setbi_11[1], P_fordo_12[1], P_await_13[1], P_ifyi_15[1], P_awaity[1], P_CS_21[1], P_setbi_24[1], ],[P_start_1[2], x[2], y[2], P_setx_3[2], P_setbi_5[2], P_ify0_4[2], P_sety_9[2], P_ifxi_10[2], P_setbi_11[2], P_fordo_12[2], P_await_13[2], P_ifyi_15[2], P_awaity[2], P_CS_21[2], P_setbi_24[2], ],

May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_start_1 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array x to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array y to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array b to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_setx_3 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_setbi_5 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_ify0_4 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_sety_9 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_ifxi_10 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_setbi_11 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_fordo_12 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array wait to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_await_13 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array done to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_ifyi_15 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_awaity to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_CS_21 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting array P_setbi_24 to variables to allow decomposition.
May 25, 2016 12:04:32 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 68 redundant transitions.
May 25, 2016 12:04:32 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.gal : 11 ms
May 25, 2016 12:04:32 PM 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="S_LamportFastMutEx-COL-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/home/hulinhub/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_LamportFastMutEx-COL-2.tgz
mv S_LamportFastMutEx-COL-2 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_LamportFastMutEx-COL-2, 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 r157kn-blw3-146416412600177"
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 ;