Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is LamportFastMutEx-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-blw7-149440486400177
=====================================================================

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


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

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !(((((((("P_start_1_0>=1")&&("P_b_0_false>=1"))||(("P_start_1_0>=1")&&("P_b_0_true>=1")))||(("P_start_1_1>=1")&&("P_b_1_false>=1")))||(("P_start_1_1>=1")&&("P_b_1_true>=1")))||(("P_start_1_2>=1")&&("P_b_2_false>=1")))||(("P_start_1_2>=1")&&("P_b_2_true>=1"))))
Formula 0 simplified : !(("P_b_0_false>=1" & "P_start_1_0>=1") | ("P_b_0_true>=1" & "P_start_1_0>=1") | ("P_b_1_false>=1" & "P_start_1_1>=1") | ("P_b_1_true>=1" & "P_start_1_1>=1") | ("P_b_2_false>=1" & "P_start_1_2>=1") | ("P_b_2_true>=1" & "P_start_1_2>=1"))
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.120642,30448,1,0,128,13832,203,51,2061,11817,152
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X((((("y_0>=1")&&("P_ify0_4_0>=1"))||(("y_0>=1")&&("P_ify0_4_1>=1")))||(("y_0>=1")&&("P_ify0_4_2>=1")))U(X(F(((("y_0>=1")&&("P_ifyi_15_0>=1"))||(("y_1>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_2>=1"))))))))
Formula 1 simplified : !X((("P_ify0_4_0>=1" & "y_0>=1") | ("P_ify0_4_1>=1" & "y_0>=1") | ("P_ify0_4_2>=1" & "y_0>=1")) U XF(("P_ifyi_15_0>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_1>=1") | ("P_ifyi_15_2>=1" & "y_2>=1")))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 96 rows 69 cols
invariant : 1'P_wait_1_0 + 1'P_done_1_0= 0
invariant : 1'P_wait_1_1 + -1'P_await_13_1 + 1'P_done_1_1= 0
invariant : 1'P_start_1_1 + 1'P_setx_3_1 + 1'P_setbi_5_1 + 1'P_ify0_4_1 + 1'P_sety_9_1 + 1'P_ifxi_10_1 + 1'P_setbi_11_1 + 1'P_fordo_12_1 + 1'P_await_13_1 + 1'P_ifyi_15_1 + 1'P_awaity_1 + 1'P_CS_21_1 + 1'P_setbi_24_1= 1
invariant : 1'P_wait_1_2 + -1'P_await_13_1 + 1'P_done_1_2= 0
invariant : 1'P_wait_0_1 + -1'P_await_13_0 + 1'P_done_0_1= 0
invariant : 1'P_wait_2_2 + -1'P_await_13_2 + 1'P_done_2_2= 0
invariant : 1'P_b_2_false + 1'P_b_2_true= 1
invariant : 1'P_b_1_false + 1'P_b_1_true= 1
invariant : 1'y_0 + 1'y_1 + 1'y_2= 1
invariant : 1'P_b_0_false + 1'P_b_0_true= 0
invariant : 1'P_start_1_2 + 1'P_setx_3_2 + 1'P_setbi_5_2 + 1'P_ify0_4_2 + 1'P_sety_9_2 + 1'P_ifxi_10_2 + 1'P_setbi_11_2 + 1'P_fordo_12_2 + 1'P_await_13_2 + 1'P_ifyi_15_2 + 1'P_awaity_2 + 1'P_CS_21_2 + 1'P_setbi_24_2= 1
invariant : 1'P_start_1_0 + 1'P_setx_3_0 + 1'P_setbi_5_0 + 1'P_ify0_4_0 + 1'P_sety_9_0 + 1'P_ifxi_10_0 + 1'P_setbi_11_0 + 1'P_fordo_12_0 + 1'P_await_13_0 + 1'P_ifyi_15_0 + 1'P_awaity_0 + 1'P_CS_21_0 + 1'P_setbi_24_0= 0
invariant : 1'P_wait_2_0 + 1'P_done_2_0= 0
invariant : 1'x_0 + 1'x_1 + 1'x_2= 1
invariant : 1'P_wait_2_1 + -1'P_await_13_2 + 1'P_done_2_1= 0
invariant : 1'P_wait_0_0 + 1'P_done_0_0= 0
invariant : 1'P_wait_0_2 + -1'P_await_13_0 + 1'P_done_0_2= 0
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.214865,33736,1,0,183,24192,239,73,2127,27534,279
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
Checking formula 2 : !((((("y_0>=1")&&("P_awaity_0>=1"))||(("y_0>=1")&&("P_awaity_1>=1")))||(("y_0>=1")&&("P_awaity_2>=1"))))
Formula 2 simplified : !(("P_awaity_0>=1" & "y_0>=1") | ("P_awaity_1>=1" & "y_0>=1") | ("P_awaity_2>=1" & "y_0>=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,0.2289,34100,1,0,186,24864,259,73,2223,29712,300
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
Checking formula 3 : !((F(((("y_0>=1")&&("P_ify0_4_0>=1"))||(("y_0>=1")&&("P_ify0_4_1>=1")))||(("y_0>=1")&&("P_ify0_4_2>=1")))))
Formula 3 simplified : !F(("P_ify0_4_0>=1" & "y_0>=1") | ("P_ify0_4_1>=1" & "y_0>=1") | ("P_ify0_4_2>=1" & "y_0>=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,0.231321,34372,1,0,196,24930,279,77,2236,30118,328
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-3 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !(((((((("x_1>=1")&&("P_ifxi_10_0>=1"))||(("x_2>=1")&&("P_ifxi_10_0>=1")))||(("x_0>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_1>=1")))||(("x_0>=1")&&("P_ifxi_10_2>=1")))||(("x_1>=1")&&("P_ifxi_10_2>=1"))))
Formula 4 simplified : !(("P_ifxi_10_0>=1" & "x_1>=1") | ("P_ifxi_10_0>=1" & "x_2>=1") | ("P_ifxi_10_1>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_2>=1") | ("P_ifxi_10_2>=1" & "x_0>=1") | ("P_ifxi_10_2>=1" & "x_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,0.233542,34372,1,0,196,24930,325,77,2279,30123,330
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
Checking formula 5 : !((F(X(G(G((("P_fordo_12_0>=1")||("P_fordo_12_1>=1"))||("P_fordo_12_2>=1")))))))
Formula 5 simplified : !FXG("P_fordo_12_0>=1" | "P_fordo_12_1>=1" | "P_fordo_12_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,0.292704,37380,1,0,273,34254,352,118,2294,47098,534
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
Checking formula 6 : !((G(((((("x_0>=1")&&("P_ifxi_10_0>=1"))||(("x_1>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_2>=1")))U((("P_fordo_12_0>=1")||("P_fordo_12_1>=1"))||("P_fordo_12_2>=1")))U(X(X((("P_fordo_12_0>=1")||("P_fordo_12_1>=1"))||("P_fordo_12_2>=1")))))))
Formula 6 simplified : !G(((("P_ifxi_10_0>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_1>=1") | ("P_ifxi_10_2>=1" & "x_2>=1")) U ("P_fordo_12_0>=1" | "P_fordo_12_1>=1" | "P_fordo_12_2>=1")) U XX("P_fordo_12_0>=1" | "P_fordo_12_1>=1" | "P_fordo_12_2>=1"))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.391266,38488,1,0,281,36425,399,118,2352,49608,563
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
Checking formula 7 : !((((("y_0>=1")&&("P_awaity_0>=1"))||(("y_0>=1")&&("P_awaity_1>=1")))||(("y_0>=1")&&("P_awaity_2>=1"))))
Formula 7 simplified : !(("P_awaity_0>=1" & "y_0>=1") | ("P_awaity_1>=1" & "y_0>=1") | ("P_awaity_2>=1" & "y_0>=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,0.392378,38748,1,0,281,36425,399,118,2352,49608,563
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
Checking formula 8 : !((G(((((((((("y_0>=1")&&("P_sety_9_0>=1"))||(("y_1>=1")&&("P_sety_9_0>=1")))||(("y_2>=1")&&("P_sety_9_0>=1")))||(("y_0>=1")&&("P_sety_9_1>=1")))||(("y_1>=1")&&("P_sety_9_1>=1")))||(("y_2>=1")&&("P_sety_9_1>=1")))||(("y_0>=1")&&("P_sety_9_2>=1")))||(("y_1>=1")&&("P_sety_9_2>=1")))||(("y_2>=1")&&("P_sety_9_2>=1")))))
Formula 8 simplified : !G(("P_sety_9_0>=1" & "y_0>=1") | ("P_sety_9_0>=1" & "y_1>=1") | ("P_sety_9_0>=1" & "y_2>=1") | ("P_sety_9_1>=1" & "y_0>=1") | ("P_sety_9_1>=1" & "y_1>=1") | ("P_sety_9_1>=1" & "y_2>=1") | ("P_sety_9_2>=1" & "y_0>=1") | ("P_sety_9_2>=1" & "y_1>=1") | ("P_sety_9_2>=1" & "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,0.395841,38756,1,0,281,36425,459,118,2408,49611,568
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
Checking formula 9 : !((G((G((((((("P_start_1_0>=1")&&("P_b_0_false>=1"))||(("P_start_1_0>=1")&&("P_b_0_true>=1")))||(("P_start_1_1>=1")&&("P_b_1_false>=1")))||(("P_start_1_1>=1")&&("P_b_1_true>=1")))||(("P_start_1_2>=1")&&("P_b_2_false>=1")))||(("P_start_1_2>=1")&&("P_b_2_true>=1"))))U(F(G((((((("x_1>=1")&&("P_ifxi_10_0>=1"))||(("x_2>=1")&&("P_ifxi_10_0>=1")))||(("x_0>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_1>=1")))||(("x_0>=1")&&("P_ifxi_10_2>=1")))||(("x_1>=1")&&("P_ifxi_10_2>=1"))))))))
Formula 9 simplified : !G(G(("P_b_0_false>=1" & "P_start_1_0>=1") | ("P_b_0_true>=1" & "P_start_1_0>=1") | ("P_b_1_false>=1" & "P_start_1_1>=1") | ("P_b_1_true>=1" & "P_start_1_1>=1") | ("P_b_2_false>=1" & "P_start_1_2>=1") | ("P_b_2_true>=1" & "P_start_1_2>=1")) U FG(("P_ifxi_10_0>=1" & "x_1>=1") | ("P_ifxi_10_0>=1" & "x_2>=1") | ("P_ifxi_10_1>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_2>=1") | ("P_ifxi_10_2>=1" & "x_0>=1") | ("P_ifxi_10_2>=1" & "x_1>=1")))
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.31945,40812,1,0,374,46263,504,170,2445,69048,807
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
Checking formula 10 : !((F(((((((((("y_0>=1")&&("P_CS_21_0>=1"))||(("y_1>=1")&&("P_CS_21_0>=1")))||(("y_2>=1")&&("P_CS_21_0>=1")))||(("y_0>=1")&&("P_CS_21_1>=1")))||(("y_1>=1")&&("P_CS_21_1>=1")))||(("y_2>=1")&&("P_CS_21_1>=1")))||(("y_0>=1")&&("P_CS_21_2>=1")))||(("y_1>=1")&&("P_CS_21_2>=1")))||(("y_2>=1")&&("P_CS_21_2>=1")))))
Formula 10 simplified : !F(("P_CS_21_0>=1" & "y_0>=1") | ("P_CS_21_0>=1" & "y_1>=1") | ("P_CS_21_0>=1" & "y_2>=1") | ("P_CS_21_1>=1" & "y_0>=1") | ("P_CS_21_1>=1" & "y_1>=1") | ("P_CS_21_1>=1" & "y_2>=1") | ("P_CS_21_2>=1" & "y_0>=1") | ("P_CS_21_2>=1" & "y_1>=1") | ("P_CS_21_2>=1" & "y_2>=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,1.34125,42116,1,0,432,49463,539,181,2476,72518,943
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-2-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(X(F(X(G((((((((((("P_b_0_false>=1")&&("P_wait_0_0>=1"))&&("P_await_13_0>=1"))||((("P_b_1_false>=1")&&("P_wait_0_1>=1"))&&("P_await_13_0>=1")))||((("P_b_2_false>=1")&&("P_wait_0_2>=1"))&&("P_await_13_0>=1")))||((("P_b_0_false>=1")&&("P_wait_1_0>=1"))&&("P_await_13_1>=1")))||((("P_b_1_false>=1")&&("P_wait_1_1>=1"))&&("P_await_13_1>=1")))||((("P_b_2_false>=1")&&("P_wait_1_2>=1"))&&("P_await_13_1>=1")))||((("P_b_0_false>=1")&&("P_wait_2_0>=1"))&&("P_await_13_2>=1")))||((("P_b_1_false>=1")&&("P_wait_2_1>=1"))&&("P_await_13_2>=1")))||((("P_b_2_false>=1")&&("P_wait_2_2>=1"))&&("P_await_13_2>=1")))))))))
Formula 11 simplified : !XXFXG(("P_await_13_0>=1" & "P_b_0_false>=1" & "P_wait_0_0>=1") | ("P_await_13_0>=1" & "P_b_1_false>=1" & "P_wait_0_1>=1") | ("P_await_13_0>=1" & "P_b_2_false>=1" & "P_wait_0_2>=1") | ("P_await_13_1>=1" & "P_b_0_false>=1" & "P_wait_1_0>=1") | ("P_await_13_1>=1" & "P_b_1_false>=1" & "P_wait_1_1>=1") | ("P_await_13_1>=1" & "P_b_2_false>=1" & "P_wait_1_2>=1") | ("P_await_13_2>=1" & "P_b_0_false>=1" & "P_wait_2_0>=1") | ("P_await_13_2>=1" & "P_b_1_false>=1" & "P_wait_2_1>=1") | ("P_await_13_2>=1" & "P_b_2_false>=1" & "P_wait_2_2>=1"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.16414,46268,1,0,526,62006,934,228,2856,93216,1162
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
Checking formula 12 : !((G(G(X(X(((((((((("y_0>=1")&&("P_CS_21_0>=1"))||(("y_1>=1")&&("P_CS_21_0>=1")))||(("y_2>=1")&&("P_CS_21_0>=1")))||(("y_0>=1")&&("P_CS_21_1>=1")))||(("y_1>=1")&&("P_CS_21_1>=1")))||(("y_2>=1")&&("P_CS_21_1>=1")))||(("y_0>=1")&&("P_CS_21_2>=1")))||(("y_1>=1")&&("P_CS_21_2>=1")))||(("y_2>=1")&&("P_CS_21_2>=1"))))))))
Formula 12 simplified : !GXX(("P_CS_21_0>=1" & "y_0>=1") | ("P_CS_21_0>=1" & "y_1>=1") | ("P_CS_21_0>=1" & "y_2>=1") | ("P_CS_21_1>=1" & "y_0>=1") | ("P_CS_21_1>=1" & "y_1>=1") | ("P_CS_21_1>=1" & "y_2>=1") | ("P_CS_21_2>=1" & "y_0>=1") | ("P_CS_21_2>=1" & "y_1>=1") | ("P_CS_21_2>=1" & "y_2>=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,2.16901,46552,1,0,526,62145,960,228,2879,93480,1169
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
Checking formula 13 : !((G(X((((((("y_1>=1")&&("P_ifyi_15_0>=1"))||(("y_2>=1")&&("P_ifyi_15_0>=1")))||(("y_0>=1")&&("P_ifyi_15_1>=1")))||(("y_2>=1")&&("P_ifyi_15_1>=1")))||(("y_0>=1")&&("P_ifyi_15_2>=1")))||(("y_1>=1")&&("P_ifyi_15_2>=1"))))))
Formula 13 simplified : !GX(("P_ifyi_15_0>=1" & "y_1>=1") | ("P_ifyi_15_0>=1" & "y_2>=1") | ("P_ifyi_15_1>=1" & "y_0>=1") | ("P_ifyi_15_1>=1" & "y_2>=1") | ("P_ifyi_15_2>=1" & "y_0>=1") | ("P_ifyi_15_2>=1" & "y_1>=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,2.17276,46652,1,0,526,62182,1032,228,2951,93654,1179
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
Checking formula 14 : !(((X(F(G(((((((((("y_0>=1")&&("P_sety_9_0>=1"))||(("y_1>=1")&&("P_sety_9_0>=1")))||(("y_2>=1")&&("P_sety_9_0>=1")))||(("y_0>=1")&&("P_sety_9_1>=1")))||(("y_1>=1")&&("P_sety_9_1>=1")))||(("y_2>=1")&&("P_sety_9_1>=1")))||(("y_0>=1")&&("P_sety_9_2>=1")))||(("y_1>=1")&&("P_sety_9_2>=1")))||(("y_2>=1")&&("P_sety_9_2>=1"))))))U((((((("x_1>=1")&&("P_ifxi_10_0>=1"))||(("x_2>=1")&&("P_ifxi_10_0>=1")))||(("x_0>=1")&&("P_ifxi_10_1>=1")))||(("x_2>=1")&&("P_ifxi_10_1>=1")))||(("x_0>=1")&&("P_ifxi_10_2>=1")))||(("x_1>=1")&&("P_ifxi_10_2>=1")))))
Formula 14 simplified : !(XFG(("P_sety_9_0>=1" & "y_0>=1") | ("P_sety_9_0>=1" & "y_1>=1") | ("P_sety_9_0>=1" & "y_2>=1") | ("P_sety_9_1>=1" & "y_0>=1") | ("P_sety_9_1>=1" & "y_1>=1") | ("P_sety_9_1>=1" & "y_2>=1") | ("P_sety_9_2>=1" & "y_0>=1") | ("P_sety_9_2>=1" & "y_1>=1") | ("P_sety_9_2>=1" & "y_2>=1")) U (("P_ifxi_10_0>=1" & "x_1>=1") | ("P_ifxi_10_0>=1" & "x_2>=1") | ("P_ifxi_10_1>=1" & "x_0>=1") | ("P_ifxi_10_1>=1" & "x_2>=1") | ("P_ifxi_10_2>=1" & "x_0>=1") | ("P_ifxi_10_2>=1" & "x_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,2.2699,47504,1,0,574,65021,1034,250,2951,98591,1291
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
Checking formula 15 : !((((("y_0>=1")&&("P_awaity_0>=1"))||(("y_0>=1")&&("P_awaity_1>=1")))||(("y_0>=1")&&("P_awaity_2>=1"))))
Formula 15 simplified : !(("P_awaity_0>=1" & "y_0>=1") | ("P_awaity_1>=1" & "y_0>=1") | ("P_awaity_2>=1" & "y_0>=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,2.27063,47768,1,0,574,65021,1034,250,2951,98591,1291
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
Exit code :0

BK_STOP 1496272506067

--------------------
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 -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
May 31, 2017 11:15:02 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 31, 2017 11:15:02 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
May 31, 2017 11:15:02 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 69 places.
May 31, 2017 11:15:03 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 96 transitions.
May 31, 2017 11:15:03 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 35 ms
May 31, 2017 11:15:03 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
May 31, 2017 11:15:03 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 31, 2017 11:15:03 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 17 place invariants in 34 ms
May 31, 2017 11:15:03 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 69 variables to be positive in 139 ms
May 31, 2017 11:15:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 96 transitions.
May 31, 2017 11:15:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/96 took 2 ms. Total solver calls (SAT/UNSAT): 8(1/7)
May 31, 2017 11:15:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 179 ms. Total solver calls (SAT/UNSAT): 897(106/791)
May 31, 2017 11:15:03 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 96 transitions.
May 31, 2017 11:15:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 153 ms. Total solver calls (SAT/UNSAT): 897(168/729)
May 31, 2017 11:15:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 96 transitions.
May 31, 2017 11:15:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished enabling matrix. took 411 ms. Total solver calls (SAT/UNSAT): 4656(819/3837)
May 31, 2017 11:15:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 96 transitions.
May 31, 2017 11:15:04 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 31, 2017 11:15:04 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 1158ms conformant to PINS in folder :/home/mcc/execution
May 31, 2017 11:15:05 PM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_4, T_setx_3_5, T_setx_3_6, T_setx_3_7, T_setx_3_8, T_setx_3_9, T_awaity_2, T_awaity_3, T_sety_9_4, T_sety_9_6, T_sety_9_7, T_sety_9_8, T_ynei_15_4, T_ynei_15_6, T_ynei_15_7, T_ynei_15_8, T_yeqi_15_5, T_yeqi_15_9, T_sety0_23_5, T_sety0_23_6, T_sety0_23_8, T_sety0_23_9, T_setbi_24_3, T_setbi_24_4, T_setbi_24_5, T_setbi_24_6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :48/22/26/96

May 31, 2017 11:15:05 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
May 31, 2017 11:15:05 PM fr.lip6.move.gal.itstools.ProcessController forwardStream
WARNING: Stream closed
LTS min runner thread failed on error :java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
java.lang.RuntimeException: Compilation of executable timed out or was killed.CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:66)
at java.lang.Thread.run(Thread.java:748)
May 31, 2017 11:15:05 PM fr.lip6.move.gal.itstools.ProcessController$1 run
WARNING: null

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-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 r040-blw7-149440486400177"
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 ;