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)
......................
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 75K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is LamportFastMutEx-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585200034
=====================================================================

--------------------
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-PT-3-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527484367825

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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 : !((G("(((((y_0>=1)&&(P_ify0_4_0>=1))||((y_0>=1)&&(P_ify0_4_1>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_3>=1)))")))
Formula 0 simplified : !G"(((((y_0>=1)&&(P_ify0_4_0>=1))||((y_0>=1)&&(P_ify0_4_1>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_3>=1)))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 132
// Phase 1: matrix 132 rows 100 cols
invariant :P_wait_2_3 + -1'P_await_13_2 + P_done_2_3 = 0
invariant :P_wait_0_3 + -1'P_await_13_0 + P_done_0_3 = 0
invariant :P_wait_1_3 + -1'P_await_13_1 + P_done_1_3 = 0
invariant :P_wait_0_2 + -1'P_await_13_0 + P_done_0_2 = 0
invariant :P_wait_2_0 + P_done_2_0 = 0
invariant :P_wait_3_3 + -1'P_await_13_3 + P_done_3_3 = 0
invariant :P_b_0_false + P_b_0_true = 0
invariant :P_start_1_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 = 0
invariant :P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + P_await_13_3 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
invariant :y_0 + y_1 + y_2 + y_3 = 1
invariant :P_b_3_false + P_b_3_true = 1
invariant :P_wait_1_0 + P_done_1_0 = 0
invariant :P_wait_0_1 + -1'P_await_13_0 + P_done_0_1 = 0
invariant :P_wait_3_1 + -1'P_await_13_3 + P_done_3_1 = 0
invariant :P_wait_3_2 + -1'P_await_13_3 + P_done_3_2 = 0
invariant :P_b_2_false + P_b_2_true = 1
invariant :P_start_1_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 = 1
invariant :P_wait_0_0 + P_done_0_0 = 0
invariant :P_start_1_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 = 1
invariant :P_wait_3_0 + P_done_3_0 = 0
invariant :P_wait_2_2 + -1'P_await_13_2 + P_done_2_2 = 0
invariant :P_b_1_false + P_b_1_true = 1
invariant :P_wait_2_1 + -1'P_await_13_2 + P_done_2_1 = 0
invariant :P_wait_1_2 + -1'P_await_13_1 + P_done_1_2 = 0
invariant :x_0 + x_1 + x_2 + x_3 = 1
invariant :P_wait_1_1 + -1'P_await_13_1 + P_done_1_1 = 0
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_5, T_setx_3_6, T_setx_3_7, T_setx_3_8, T_setx_3_9, T_setx_3_10, T_setx_3_11, T_setx_3_12, T_setx_3_13, T_setx_3_14, T_setx_3_15, T_setx_3_16, T_setbi_5_4, T_setbi_5_6, T_setbi_5_8, T_awaity_2, T_awaity_3, T_awaity_4, T_sety_9_5, T_sety_9_7, T_sety_9_8, T_sety_9_9, T_sety_9_10, T_sety_9_12, T_sety_9_13, T_sety_9_14, T_sety_9_15, T_setbi_11_4, T_setbi_11_6, T_setbi_11_8, T_ynei_15_5, T_ynei_15_7, T_ynei_15_8, T_ynei_15_9, T_ynei_15_10, T_ynei_15_12, T_ynei_15_13, T_ynei_15_14, T_ynei_15_15, T_yeqi_15_6, T_yeqi_15_11, T_yeqi_15_16, T_sety0_23_6, T_sety0_23_7, T_sety0_23_8, T_sety0_23_10, T_sety0_23_11, T_sety0_23_12, T_sety0_23_14, T_sety0_23_15, T_sety0_23_16, T_setbi_24_3, T_setbi_24_4, T_setbi_24_5, T_setbi_24_6, T_setbi_24_7, T_setbi_24_8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :63/36/57/156
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
157 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.63758,60316,1,0,258,167616,278,96,3410,206383,285
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((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_3>=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_3>=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)))||((y_3>=1)&&(P_sety_9_2>=1)))||((y_0>=1)&&(P_sety_9_3>=1)))||((y_1>=1)&&(P_sety_9_3>=1)))||((y_2>=1)&&(P_sety_9_3>=1)))||((y_3>=1)&&(P_sety_9_3>=1)))")))
Formula 1 simplified : !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_3>=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_3>=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)))||((y_3>=1)&&(P_sety_9_2>=1)))||((y_0>=1)&&(P_sety_9_3>=1)))||((y_1>=1)&&(P_sety_9_3>=1)))||((y_2>=1)&&(P_sety_9_3>=1)))||((y_3>=1)&&(P_sety_9_3>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.64309,60952,1,0,258,167616,284,96,3446,206390,290
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(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_3_false>=1)&&(P_wait_0_3>=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_3_false>=1)&&(P_wait_1_3>=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)))||(((P_b_3_false>=1)&&(P_wait_2_3>=1))&&(P_await_13_2>=1)))||(((P_b_0_false>=1)&&(P_wait_3_0>=1))&&(P_await_13_3>=1)))||(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=1)))||(((P_b_2_false>=1)&&(P_wait_3_2>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_3_3>=1))&&(P_await_13_3>=1)))"))))
Formula 2 simplified : !FG"((((((((((((((((((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_3_false>=1)&&(P_wait_0_3>=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_3_false>=1)&&(P_wait_1_3>=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)))||(((P_b_3_false>=1)&&(P_wait_2_3>=1))&&(P_await_13_2>=1)))||(((P_b_0_false>=1)&&(P_wait_3_0>=1))&&(P_await_13_3>=1)))||(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=1)))||(((P_b_2_false>=1)&&(P_wait_3_2>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_3_3>=1))&&(P_await_13_3>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
871 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,10.3671,279996,1,0,495,964665,297,202,3546,1.59823e+06,791
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((G(F(X("(((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))"))))U(("(((((y_0>=1)&&(P_ify0_4_0>=1))||((y_0>=1)&&(P_ify0_4_1>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_3>=1)))")U(G("(((((((((P_b_0_false>=1)&&(P_setbi_24_0>=1))||((P_b_0_true>=1)&&(P_setbi_24_0>=1)))||((P_b_1_false>=1)&&(P_setbi_24_1>=1)))||((P_b_1_true>=1)&&(P_setbi_24_1>=1)))||((P_b_2_false>=1)&&(P_setbi_24_2>=1)))||((P_b_2_true>=1)&&(P_setbi_24_2>=1)))||((P_b_3_false>=1)&&(P_setbi_24_3>=1)))||((P_b_3_true>=1)&&(P_setbi_24_3>=1)))")))))
Formula 3 simplified : !(GFX"(((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))" U ("(((((y_0>=1)&&(P_ify0_4_0>=1))||((y_0>=1)&&(P_ify0_4_1>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_3>=1)))" U G"(((((((((P_b_0_false>=1)&&(P_setbi_24_0>=1))||((P_b_0_true>=1)&&(P_setbi_24_0>=1)))||((P_b_1_false>=1)&&(P_setbi_24_1>=1)))||((P_b_1_true>=1)&&(P_setbi_24_1>=1)))||((P_b_2_false>=1)&&(P_setbi_24_2>=1)))||((P_b_2_true>=1)&&(P_setbi_24_2>=1)))||((P_b_3_false>=1)&&(P_setbi_24_3>=1)))||((P_b_3_true>=1)&&(P_setbi_24_3>=1)))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
40 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,10.7715,293380,1,0,506,997052,312,203,3587,1.65103e+06,848
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(G(F(F("(((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))"))))))
Formula 4 simplified : !GF"(((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))"
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
18 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,10.9562,298132,1,0,515,1.00782e+06,321,203,3600,1.66789e+06,889
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((G(F(G(F("(((((x_0>=1)&&(P_ifxi_10_0>=1))||((x_1>=1)&&(P_ifxi_10_1>=1)))||((x_2>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_3>=1)))"))))))
Formula 5 simplified : !GFGF"(((((x_0>=1)&&(P_ifxi_10_0>=1))||((x_1>=1)&&(P_ifxi_10_1>=1)))||((x_2>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_3>=1)))"
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
236 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.3194,355888,1,0,584,1.20943e+06,330,204,3617,1.88969e+06,1072
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((X(X(X(X("(((((((((P_b_0_false>=1)&&(P_setbi_24_0>=1))||((P_b_0_true>=1)&&(P_setbi_24_0>=1)))||((P_b_1_false>=1)&&(P_setbi_24_1>=1)))||((P_b_1_true>=1)&&(P_setbi_24_1>=1)))||((P_b_2_false>=1)&&(P_setbi_24_2>=1)))||((P_b_2_true>=1)&&(P_setbi_24_2>=1)))||((P_b_3_false>=1)&&(P_setbi_24_3>=1)))||((P_b_3_true>=1)&&(P_setbi_24_3>=1)))"))))))
Formula 6 simplified : !XXXX"(((((((((P_b_0_false>=1)&&(P_setbi_24_0>=1))||((P_b_0_true>=1)&&(P_setbi_24_0>=1)))||((P_b_1_false>=1)&&(P_setbi_24_1>=1)))||((P_b_1_true>=1)&&(P_setbi_24_1>=1)))||((P_b_2_false>=1)&&(P_setbi_24_2>=1)))||((P_b_2_true>=1)&&(P_setbi_24_2>=1)))||((P_b_3_false>=1)&&(P_setbi_24_3>=1)))||((P_b_3_true>=1)&&(P_setbi_24_3>=1)))"
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.4052,358260,1,0,588,1.21422e+06,330,204,3617,1.89808e+06,1088
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(((((((((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)))||((P_start_1_3>=1)&&(P_b_3_false>=1)))||((P_start_1_3>=1)&&(P_b_3_true>=1)))"))
Formula 7 simplified : !"(((((((((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)))||((P_start_1_3>=1)&&(P_b_3_false>=1)))||((P_start_1_3>=1)&&(P_b_3_true>=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,13.4072,358524,1,0,588,1.21422e+06,333,204,3638,1.89808e+06,1090
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(("((y_0>=1)&&(P_ifyi_15_2>=1))")U(("((P_start_1_3>=1)&&(P_b_3_true>=1))")U("((y_3>=1)&&(P_ify0_4_0>=1))")))))
Formula 8 simplified : !F("((y_0>=1)&&(P_ifyi_15_2>=1))" U ("((P_start_1_3>=1)&&(P_b_3_true>=1))" U "((y_3>=1)&&(P_ify0_4_0>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
142 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,14.8303,393636,1,0,644,1.33737e+06,342,238,3639,2.11572e+06,1289
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((G((G(G("((P_b_3_false>=1)&&(P_setbi_5_3>=1))")))U("((P_b_3_true>=1)&&(P_setbi_11_3>=1))"))))
Formula 9 simplified : !G(G"((P_b_3_false>=1)&&(P_setbi_5_3>=1))" U "((P_b_3_true>=1)&&(P_setbi_11_3>=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,14.8324,394060,1,0,644,1.33737e+06,358,238,3651,2.11572e+06,1296
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X("((x_3>=1)&&(P_ifxi_10_0>=1))")))
Formula 10 simplified : !X"((x_3>=1)&&(P_ifxi_10_0>=1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,14.87,394588,1,0,644,1.33929e+06,361,238,3652,2.11894e+06,1301
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G("(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=1))")))
Formula 11 simplified : !G"(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=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,14.8724,394852,1,0,644,1.33929e+06,367,238,3652,2.11894e+06,1306
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F("((x_3>=1)&&(P_ifxi_10_2>=1))")))
Formula 12 simplified : !F"((x_3>=1)&&(P_ifxi_10_2>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
83 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,15.7039,416236,1,0,760,1.41708e+06,376,275,3653,2.22823e+06,1529
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F("((P_start_1_1>=1)&&(P_b_1_false>=1))")))
Formula 13 simplified : !F"((P_start_1_1>=1)&&(P_b_1_false>=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,15.7046,416500,1,0,760,1.41708e+06,385,275,3653,2.22823e+06,1533
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F((("(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1))")U("((x_3>=1)&&(P_setx_3_2>=1))"))U(("((y_1>=1)&&(P_sety_9_2>=1))")U("((x_0>=1)&&(P_ifxi_10_0>=1))")))))
Formula 14 simplified : !F(("(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1))" U "((x_3>=1)&&(P_setx_3_2>=1))") U ("((y_1>=1)&&(P_sety_9_2>=1))" U "((x_0>=1)&&(P_ifxi_10_0>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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,15.7804,418876,1,0,760,1.41708e+06,394,275,3653,2.22902e+06,1633
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((X(("((((P_await_13_1>=1)&&(P_done_1_1>=1))&&(P_done_1_2>=1))&&(P_done_1_3>=1))")U("((P_start_1_1>=1)&&(P_b_1_true>=1))")))U(F(G(F("((P_start_1_3>=1)&&(P_b_3_true>=1))"))))))
Formula 15 simplified : !(X("((((P_await_13_1>=1)&&(P_done_1_1>=1))&&(P_done_1_2>=1))&&(P_done_1_3>=1))" U "((P_start_1_1>=1)&&(P_b_1_true>=1))") U FGF"((P_start_1_3>=1)&&(P_b_3_true>=1))")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,15.7824,419044,1,0,760,1.41709e+06,403,275,3653,2.22905e+06,1647
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527484390265

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 5:12:50 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 5:12:50 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 5:12:50 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 64 ms
May 28, 2018 5:12:50 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
May 28, 2018 5:12:50 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 156 transitions.
May 28, 2018 5:12:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 21 ms
May 28, 2018 5:12:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 70 ms
May 28, 2018 5:12:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
May 28, 2018 5:12:50 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
May 28, 2018 5:12:51 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 156 transitions.
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 26 place invariants in 27 ms
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 195 ms
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 156 transitions.
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/156 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 156 transitions.
May 28, 2018 5:12:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 156 transitions.
May 28, 2018 5:12:55 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/156) took 57 ms. Total solver calls (SAT/UNSAT): 41(0/41)
May 28, 2018 5:12:59 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(6/156) took 3646 ms. Total solver calls (SAT/UNSAT): 284(9/275)
May 28, 2018 5:13:02 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(21/156) took 6747 ms. Total solver calls (SAT/UNSAT): 1073(51/1022)
May 28, 2018 5:13:06 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(31/156) took 10729 ms. Total solver calls (SAT/UNSAT): 1800(110/1690)
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:480)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
May 28, 2018 5:13:09 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 19003ms conformant to PINS in folder :/home/mcc/execution

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-3"
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-3.tgz
mv LamportFastMutEx-PT-3 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-3, 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 r260-csrt-152732585200034"
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 ;