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 itstoolsl
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 r261-csrt-152732585800034
=====================================================================

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

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph677203630630817403.txt, -o, /tmp/graph677203630630817403.bin, -w, /tmp/graph677203630630817403.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph677203630630817403.bin, -l, -1, -v, -w, /tmp/graph677203630630817403.weights, -q, 0, -e, 0.001], workingDir=null]
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.201805241334/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.201805241334/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("(((((i2.u8.y_0>=1)&&(i3.u5.P_ify0_4_0>=1))||((i2.u8.y_0>=1)&&(i0.u6.P_ify0_4_1>=1)))||((i2.u8.y_0>=1)&&(i4.u7.P_ify0_4_2>=1)))||((i2.u8.y_0>=1)&&(i1.u4.P_ify0_4_3>=1)))")))
Formula 0 simplified : !G"(((((i2.u8.y_0>=1)&&(i3.u5.P_ify0_4_0>=1))||((i2.u8.y_0>=1)&&(i0.u6.P_ify0_4_1>=1)))||((i2.u8.y_0>=1)&&(i4.u7.P_ify0_4_2>=1)))||((i2.u8.y_0>=1)&&(i1.u4.P_ify0_4_3>=1)))"
built 18 ordering constraints for composite.
built 47 ordering constraints for composite.
built 36 ordering constraints for composite.
built 78 ordering constraints for composite.
built 37 ordering constraints for composite.
built 47 ordering constraints for composite.
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 :i0:u14:P_wait_1_0 + i0:u14:P_done_1_0 = 0
invariant :i2:u8:y_0 + i2:u8:y_1 + i2:u8:y_2 + i2:u8:y_3 = 1
invariant :i0:u1:P_start_1_1 + i0:u1:P_fordo_12_1 + i0:u6:P_setx_3_1 + i0:u6:P_setbi_5_1 + i0:u6:P_ify0_4_1 + i0:u9:P_sety_9_1 + i0:u9:P_ifxi_10_1 + i0:u9:P_setbi_11_1 + i0:u28:P_ifyi_15_1 + i0:u28:P_awaity_1 + i0:u34:P_CS_21_1 + i0:u34:P_setbi_24_1 + i0:u20:P_wait_1_2 + i0:u20:P_done_1_2 = 1
invariant :i3:u12:P_await_13_0 + -1'i3:u19:P_wait_0_2 + -1'i3:u19:P_done_0_2 = 0
invariant :i1:u3:P_b_3_false + i1:u3:P_b_3_true = 1
invariant :i4:u2:P_start_1_2 + i4:u2:P_fordo_12_2 + i4:u7:P_setx_3_2 + i4:u7:P_setbi_5_2 + i4:u7:P_ify0_4_2 + i4:u10:P_sety_9_2 + i4:u10:P_ifxi_10_2 + i4:u10:P_setbi_11_2 + i4:u29:P_ifyi_15_2 + i4:u29:P_awaity_2 + i4:u33:P_CS_21_2 + i4:u33:P_setbi_24_2 + i4:u22:P_wait_2_1 + i4:u22:P_done_2_1 = 1
invariant :i4:u21:P_await_13_2 + -1'i4:u22:P_wait_2_1 + -1'i4:u22:P_done_2_1 = 0
invariant :i0:u1:P_b_1_false + i0:u1:P_b_1_true = 1
invariant :i1:u24:P_wait_3_0 + i1:u24:P_done_3_0 = 0
invariant :i1:u24:P_await_13_3 + -1'i1:u26:P_wait_3_2 + -1'i1:u26:P_done_3_2 = 0
invariant :i0:u16:P_wait_1_3 + i0:u16:P_done_1_3 + -1'i0:u20:P_wait_1_2 + -1'i0:u20:P_done_1_2 = 0
invariant :i1:u27:P_wait_3_3 + i1:u27:P_done_3_3 + -1'i1:u26:P_wait_3_2 + -1'i1:u26:P_done_3_2 = 0
invariant :i4:u21:P_wait_2_0 + i4:u21:P_done_2_0 = 0
invariant :i0:u6:x_1 + i1:u4:x_3 + i3:u5:x_0 + i4:u7:x_2 = 1
invariant :i0:u15:P_wait_1_1 + i0:u15:P_done_1_1 + -1'i0:u20:P_wait_1_2 + -1'i0:u20:P_done_1_2 = 0
invariant :i1:u25:P_wait_3_1 + i1:u25:P_done_3_1 + -1'i1:u26:P_wait_3_2 + -1'i1:u26:P_done_3_2 = 0
invariant :i3:u12:P_wait_0_0 + i3:u12:P_done_0_0 = 0
invariant :i3:u13:P_wait_0_3 + i3:u13:P_done_0_3 + -1'i3:u19:P_wait_0_2 + -1'i3:u19:P_done_0_2 = 0
invariant :i3:u0:P_b_0_false + i3:u0:P_b_0_true = 0
invariant :i4:u2:P_b_2_false + i4:u2:P_b_2_true = 1
invariant :i4:u17:P_wait_2_3 + i4:u17:P_done_2_3 + -1'i4:u22:P_wait_2_1 + -1'i4:u22:P_done_2_1 = 0
invariant :i0:u14:P_await_13_1 + -1'i0:u20:P_wait_1_2 + -1'i0:u20:P_done_1_2 = 0
invariant :i2:u8:P_sety_9_0 + i2:u8:P_ifxi_10_0 + i2:u32:P_CS_21_0 + i2:u32:P_setbi_24_0 + i3:u19:P_wait_0_2 + i3:u19:P_done_0_2 + i3:u0:P_start_1_0 + i3:u0:P_setbi_11_0 + i3:u0:P_fordo_12_0 + i3:u5:P_setx_3_0 + i3:u5:P_setbi_5_0 + i3:u5:P_ify0_4_0 + i3:u31:P_ifyi_15_0 + i3:u31:P_awaity_0 = 0
invariant :i3:u18:P_wait_0_1 + i3:u18:P_done_0_1 + -1'i3:u19:P_wait_0_2 + -1'i3:u19:P_done_0_2 = 0
invariant :i1:u3:P_start_1_3 + i1:u3:P_fordo_12_3 + i1:u4:P_setx_3_3 + i1:u4:P_setbi_5_3 + i1:u4:P_ify0_4_3 + i1:u30:P_ifyi_15_3 + i1:u30:P_awaity_3 + i1:u26:P_wait_3_2 + i1:u26:P_done_3_2 + i2:u11:P_sety_9_3 + i2:u11:P_ifxi_10_3 + i2:u11:P_setbi_11_3 + i2:u35:P_CS_21_3 + i2:u35:P_setbi_24_3 = 1
invariant :i4:u23:P_wait_2_2 + i4:u23:P_done_2_2 + -1'i4:u22:P_wait_2_1 + -1'i4:u22:P_done_2_1 = 0
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_5, T_setx_3_7, T_setx_3_8, T_setx_3_9, T_setx_3_10, T_setx_3_12, T_setx_3_13, T_setx_3_14, T_setx_3_15, 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, i0.u6.T_setx_3_6, i1.u4.T_setx_3_16, i4.u7.T_setx_3_11, 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
50 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.560027,31204,1,0,25232,268,1908,70886,336,845,67101
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 USE_NUPN
Checking formula 1 : !((G("(((((((((((((((((i2.u8.y_0>=1)&&(i2.u8.P_sety_9_0>=1))||((i2.u8.y_1>=1)&&(i2.u8.P_sety_9_0>=1)))||((i2.u8.y_2>=1)&&(i2.u8.P_sety_9_0>=1)))||((i2.u8.y_3>=1)&&(i2.u8.P_sety_9_0>=1)))||((i2.u8.y_0>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_1>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_2>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_3>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_0>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_1>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_2>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_3>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_0>=1)&&(i2.u11.P_sety_9_3>=1)))||((i2.u8.y_1>=1)&&(i2.u11.P_sety_9_3>=1)))||((i2.u8.y_2>=1)&&(i2.u11.P_sety_9_3>=1)))||((i2.u8.y_3>=1)&&(i2.u11.P_sety_9_3>=1)))")))
Formula 1 simplified : !G"(((((((((((((((((i2.u8.y_0>=1)&&(i2.u8.P_sety_9_0>=1))||((i2.u8.y_1>=1)&&(i2.u8.P_sety_9_0>=1)))||((i2.u8.y_2>=1)&&(i2.u8.P_sety_9_0>=1)))||((i2.u8.y_3>=1)&&(i2.u8.P_sety_9_0>=1)))||((i2.u8.y_0>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_1>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_2>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_3>=1)&&(i0.u9.P_sety_9_1>=1)))||((i2.u8.y_0>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_1>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_2>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_3>=1)&&(i4.u10.P_sety_9_2>=1)))||((i2.u8.y_0>=1)&&(i2.u11.P_sety_9_3>=1)))||((i2.u8.y_1>=1)&&(i2.u11.P_sety_9_3>=1)))||((i2.u8.y_2>=1)&&(i2.u11.P_sety_9_3>=1)))||((i2.u8.y_3>=1)&&(i2.u11.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,0.567213,31904,1,0,25232,268,2022,70886,346,845,67141
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 USE_NUPN
Checking formula 2 : !((F(G("((((((((((((((((((i3.u0.P_b_0_false>=1)&&(i3.u12.P_wait_0_0>=1))&&(i3.u12.P_await_13_0>=1))||(((i0.u1.P_b_1_false>=1)&&(i3.u18.P_wait_0_1>=1))&&(i3.u12.P_await_13_0>=1)))||(((i4.u2.P_b_2_false>=1)&&(i3.u19.P_wait_0_2>=1))&&(i3.u12.P_await_13_0>=1)))||(((i1.u3.P_b_3_false>=1)&&(i3.u13.P_wait_0_3>=1))&&(i3.u12.P_await_13_0>=1)))||(((i3.u0.P_b_0_false>=1)&&(i0.u14.P_wait_1_0>=1))&&(i0.u14.P_await_13_1>=1)))||(((i0.u1.P_b_1_false>=1)&&(i0.u15.P_wait_1_1>=1))&&(i0.u14.P_await_13_1>=1)))||(((i4.u2.P_b_2_false>=1)&&(i0.u20.P_wait_1_2>=1))&&(i0.u14.P_await_13_1>=1)))||(((i1.u3.P_b_3_false>=1)&&(i0.u16.P_wait_1_3>=1))&&(i0.u14.P_await_13_1>=1)))||(((i3.u0.P_b_0_false>=1)&&(i4.u21.P_wait_2_0>=1))&&(i4.u21.P_await_13_2>=1)))||(((i0.u1.P_b_1_false>=1)&&(i4.u22.P_wait_2_1>=1))&&(i4.u21.P_await_13_2>=1)))||(((i4.u2.P_b_2_false>=1)&&(i4.u23.P_wait_2_2>=1))&&(i4.u21.P_await_13_2>=1)))||(((i1.u3.P_b_3_false>=1)&&(i4.u17.P_wait_2_3>=1))&&(i4.u21.P_await_13_2>=1)))||(((i3.u0.P_b_0_false>=1)&&(i1.u24.P_wait_3_0>=1))&&(i1.u24.P_await_13_3>=1)))||(((i0.u1.P_b_1_false>=1)&&(i1.u25.P_wait_3_1>=1))&&(i1.u24.P_await_13_3>=1)))||(((i4.u2.P_b_2_false>=1)&&(i1.u26.P_wait_3_2>=1))&&(i1.u24.P_await_13_3>=1)))||(((i1.u3.P_b_3_false>=1)&&(i1.u27.P_wait_3_3>=1))&&(i1.u24.P_await_13_3>=1)))"))))
Formula 2 simplified : !FG"((((((((((((((((((i3.u0.P_b_0_false>=1)&&(i3.u12.P_wait_0_0>=1))&&(i3.u12.P_await_13_0>=1))||(((i0.u1.P_b_1_false>=1)&&(i3.u18.P_wait_0_1>=1))&&(i3.u12.P_await_13_0>=1)))||(((i4.u2.P_b_2_false>=1)&&(i3.u19.P_wait_0_2>=1))&&(i3.u12.P_await_13_0>=1)))||(((i1.u3.P_b_3_false>=1)&&(i3.u13.P_wait_0_3>=1))&&(i3.u12.P_await_13_0>=1)))||(((i3.u0.P_b_0_false>=1)&&(i0.u14.P_wait_1_0>=1))&&(i0.u14.P_await_13_1>=1)))||(((i0.u1.P_b_1_false>=1)&&(i0.u15.P_wait_1_1>=1))&&(i0.u14.P_await_13_1>=1)))||(((i4.u2.P_b_2_false>=1)&&(i0.u20.P_wait_1_2>=1))&&(i0.u14.P_await_13_1>=1)))||(((i1.u3.P_b_3_false>=1)&&(i0.u16.P_wait_1_3>=1))&&(i0.u14.P_await_13_1>=1)))||(((i3.u0.P_b_0_false>=1)&&(i4.u21.P_wait_2_0>=1))&&(i4.u21.P_await_13_2>=1)))||(((i0.u1.P_b_1_false>=1)&&(i4.u22.P_wait_2_1>=1))&&(i4.u21.P_await_13_2>=1)))||(((i4.u2.P_b_2_false>=1)&&(i4.u23.P_wait_2_2>=1))&&(i4.u21.P_await_13_2>=1)))||(((i1.u3.P_b_3_false>=1)&&(i4.u17.P_wait_2_3>=1))&&(i4.u21.P_await_13_2>=1)))||(((i3.u0.P_b_0_false>=1)&&(i1.u24.P_wait_3_0>=1))&&(i1.u24.P_await_13_3>=1)))||(((i0.u1.P_b_1_false>=1)&&(i1.u25.P_wait_3_1>=1))&&(i1.u24.P_await_13_3>=1)))||(((i4.u2.P_b_2_false>=1)&&(i1.u26.P_wait_3_2>=1))&&(i1.u24.P_await_13_3>=1)))||(((i1.u3.P_b_3_false>=1)&&(i1.u27.P_wait_3_3>=1))&&(i1.u24.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
190 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.47408,90140,1,0,128309,268,2216,296410,349,859,313407
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 USE_NUPN
Checking formula 3 : !(((G(F(X("(((((i2.u8.y_0>=1)&&(i3.u31.P_awaity_0>=1))||((i2.u8.y_0>=1)&&(i0.u28.P_awaity_1>=1)))||((i2.u8.y_0>=1)&&(i4.u29.P_awaity_2>=1)))||((i2.u8.y_0>=1)&&(i1.u30.P_awaity_3>=1)))"))))U(("(((((i2.u8.y_0>=1)&&(i3.u5.P_ify0_4_0>=1))||((i2.u8.y_0>=1)&&(i0.u6.P_ify0_4_1>=1)))||((i2.u8.y_0>=1)&&(i4.u7.P_ify0_4_2>=1)))||((i2.u8.y_0>=1)&&(i1.u4.P_ify0_4_3>=1)))")U(G("(((((((((i3.u0.P_b_0_false>=1)&&(i2.u32.P_setbi_24_0>=1))||((i3.u0.P_b_0_true>=1)&&(i2.u32.P_setbi_24_0>=1)))||((i0.u1.P_b_1_false>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i0.u1.P_b_1_true>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i4.u2.P_b_2_false>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i4.u2.P_b_2_true>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i1.u3.P_b_3_false>=1)&&(i2.u35.P_setbi_24_3>=1)))||((i1.u3.P_b_3_true>=1)&&(i2.u35.P_setbi_24_3>=1)))")))))
Formula 3 simplified : !(GFX"(((((i2.u8.y_0>=1)&&(i3.u31.P_awaity_0>=1))||((i2.u8.y_0>=1)&&(i0.u28.P_awaity_1>=1)))||((i2.u8.y_0>=1)&&(i4.u29.P_awaity_2>=1)))||((i2.u8.y_0>=1)&&(i1.u30.P_awaity_3>=1)))" U ("(((((i2.u8.y_0>=1)&&(i3.u5.P_ify0_4_0>=1))||((i2.u8.y_0>=1)&&(i0.u6.P_ify0_4_1>=1)))||((i2.u8.y_0>=1)&&(i4.u7.P_ify0_4_2>=1)))||((i2.u8.y_0>=1)&&(i1.u4.P_ify0_4_3>=1)))" U G"(((((((((i3.u0.P_b_0_false>=1)&&(i2.u32.P_setbi_24_0>=1))||((i3.u0.P_b_0_true>=1)&&(i2.u32.P_setbi_24_0>=1)))||((i0.u1.P_b_1_false>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i0.u1.P_b_1_true>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i4.u2.P_b_2_false>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i4.u2.P_b_2_true>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i1.u3.P_b_3_false>=1)&&(i2.u35.P_setbi_24_3>=1)))||((i1.u3.P_b_3_true>=1)&&(i2.u35.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
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.57601,94048,1,0,132442,268,2284,304747,351,874,326435
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 USE_NUPN
Checking formula 4 : !((G(G(F(F("(((((i2.u8.y_0>=1)&&(i3.u31.P_awaity_0>=1))||((i2.u8.y_0>=1)&&(i0.u28.P_awaity_1>=1)))||((i2.u8.y_0>=1)&&(i4.u29.P_awaity_2>=1)))||((i2.u8.y_0>=1)&&(i1.u30.P_awaity_3>=1)))"))))))
Formula 4 simplified : !GF"(((((i2.u8.y_0>=1)&&(i3.u31.P_awaity_0>=1))||((i2.u8.y_0>=1)&&(i0.u28.P_awaity_1>=1)))||((i2.u8.y_0>=1)&&(i4.u29.P_awaity_2>=1)))||((i2.u8.y_0>=1)&&(i1.u30.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
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.59708,94576,1,0,133268,268,2318,306456,351,874,328946
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 USE_NUPN
Checking formula 5 : !((G(F(G(F("(((((i3.u5.x_0>=1)&&(i2.u8.P_ifxi_10_0>=1))||((i0.u6.x_1>=1)&&(i0.u9.P_ifxi_10_1>=1)))||((i4.u7.x_2>=1)&&(i4.u10.P_ifxi_10_2>=1)))||((i1.u4.x_3>=1)&&(i2.u11.P_ifxi_10_3>=1)))"))))))
Formula 5 simplified : !GFGF"(((((i3.u5.x_0>=1)&&(i2.u8.P_ifxi_10_0>=1))||((i0.u6.x_1>=1)&&(i0.u9.P_ifxi_10_1>=1)))||((i4.u7.x_2>=1)&&(i4.u10.P_ifxi_10_2>=1)))||((i1.u4.x_3>=1)&&(i2.u11.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
51 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.10433,110916,1,0,162446,268,2348,371815,351,876,399272
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 USE_NUPN
Checking formula 6 : !((X(X(X(X("(((((((((i3.u0.P_b_0_false>=1)&&(i2.u32.P_setbi_24_0>=1))||((i3.u0.P_b_0_true>=1)&&(i2.u32.P_setbi_24_0>=1)))||((i0.u1.P_b_1_false>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i0.u1.P_b_1_true>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i4.u2.P_b_2_false>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i4.u2.P_b_2_true>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i1.u3.P_b_3_false>=1)&&(i2.u35.P_setbi_24_3>=1)))||((i1.u3.P_b_3_true>=1)&&(i2.u35.P_setbi_24_3>=1)))"))))))
Formula 6 simplified : !XXXX"(((((((((i3.u0.P_b_0_false>=1)&&(i2.u32.P_setbi_24_0>=1))||((i3.u0.P_b_0_true>=1)&&(i2.u32.P_setbi_24_0>=1)))||((i0.u1.P_b_1_false>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i0.u1.P_b_1_true>=1)&&(i0.u34.P_setbi_24_1>=1)))||((i4.u2.P_b_2_false>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i4.u2.P_b_2_true>=1)&&(i4.u33.P_setbi_24_2>=1)))||((i1.u3.P_b_3_false>=1)&&(i2.u35.P_setbi_24_3>=1)))||((i1.u3.P_b_3_true>=1)&&(i2.u35.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
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.14739,111968,1,0,164247,268,2348,375053,351,876,405808
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 USE_NUPN
Checking formula 7 : !(("(((((((((i3.u0.P_start_1_0>=1)&&(i3.u0.P_b_0_false>=1))||((i3.u0.P_start_1_0>=1)&&(i3.u0.P_b_0_true>=1)))||((i0.u1.P_start_1_1>=1)&&(i0.u1.P_b_1_false>=1)))||((i0.u1.P_start_1_1>=1)&&(i0.u1.P_b_1_true>=1)))||((i4.u2.P_start_1_2>=1)&&(i4.u2.P_b_2_false>=1)))||((i4.u2.P_start_1_2>=1)&&(i4.u2.P_b_2_true>=1)))||((i1.u3.P_start_1_3>=1)&&(i1.u3.P_b_3_false>=1)))||((i1.u3.P_start_1_3>=1)&&(i1.u3.P_b_3_true>=1)))"))
Formula 7 simplified : !"(((((((((i3.u0.P_start_1_0>=1)&&(i3.u0.P_b_0_false>=1))||((i3.u0.P_start_1_0>=1)&&(i3.u0.P_b_0_true>=1)))||((i0.u1.P_start_1_1>=1)&&(i0.u1.P_b_1_false>=1)))||((i0.u1.P_start_1_1>=1)&&(i0.u1.P_b_1_true>=1)))||((i4.u2.P_start_1_2>=1)&&(i4.u2.P_b_2_false>=1)))||((i4.u2.P_start_1_2>=1)&&(i4.u2.P_b_2_true>=1)))||((i1.u3.P_start_1_3>=1)&&(i1.u3.P_b_3_false>=1)))||((i1.u3.P_start_1_3>=1)&&(i1.u3.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
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.14947,112232,1,0,164247,268,2406,375053,356,876,405842
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(("((i2.u8.y_0>=1)&&(i4.u29.P_ifyi_15_2>=1))")U(("((i1.u3.P_start_1_3>=1)&&(i1.u3.P_b_3_true>=1))")U("((i2.u8.y_3>=1)&&(i3.u5.P_ify0_4_0>=1))")))))
Formula 8 simplified : !F("((i2.u8.y_0>=1)&&(i4.u29.P_ifyi_15_2>=1))" U ("((i1.u3.P_start_1_3>=1)&&(i1.u3.P_b_3_true>=1))" U "((i2.u8.y_3>=1)&&(i3.u5.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
26 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.40778,118832,1,0,176449,268,2447,391237,356,876,443254
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 USE_NUPN
Checking formula 9 : !((G((G(G("((i1.u3.P_b_3_false>=1)&&(i1.u4.P_setbi_5_3>=1))")))U("((i1.u3.P_b_3_true>=1)&&(i2.u11.P_setbi_11_3>=1))"))))
Formula 9 simplified : !G(G"((i1.u3.P_b_3_false>=1)&&(i1.u4.P_setbi_5_3>=1))" U "((i1.u3.P_b_3_true>=1)&&(i2.u11.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,3.41065,119520,1,0,176449,268,2498,391237,356,876,443297
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 USE_NUPN
Checking formula 10 : !((X("((i1.u4.x_3>=1)&&(i2.u8.P_ifxi_10_0>=1))")))
Formula 10 simplified : !X"((i1.u4.x_3>=1)&&(i2.u8.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
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.41441,119520,1,0,176526,268,2502,391378,356,876,443628
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 USE_NUPN
Checking formula 11 : !((G("(((i0.u1.P_b_1_false>=1)&&(i1.u25.P_wait_3_1>=1))&&(i1.u24.P_await_13_3>=1))")))
Formula 11 simplified : !G"(((i0.u1.P_b_1_false>=1)&&(i1.u25.P_wait_3_1>=1))&&(i1.u24.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,3.41536,119520,1,0,176526,268,2520,391378,356,876,443642
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 USE_NUPN
Checking formula 12 : !((F("((i1.u4.x_3>=1)&&(i4.u10.P_ifxi_10_2>=1))")))
Formula 12 simplified : !F"((i1.u4.x_3>=1)&&(i4.u10.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
54 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.95068,131664,1,0,200196,268,2575,422885,357,876,505403
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 USE_NUPN
Checking formula 13 : !((F("((i0.u1.P_start_1_1>=1)&&(i0.u1.P_b_1_false>=1))")))
Formula 13 simplified : !F"((i0.u1.P_start_1_1>=1)&&(i0.u1.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,3.95206,131928,1,0,200196,268,2607,422885,360,876,505422
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F((("(((i4.u2.P_b_2_false>=1)&&(i4.u23.P_wait_2_2>=1))&&(i4.u21.P_await_13_2>=1))")U("((i1.u4.x_3>=1)&&(i4.u7.P_setx_3_2>=1))"))U(("((i2.u8.y_1>=1)&&(i4.u10.P_sety_9_2>=1))")U("((i3.u5.x_0>=1)&&(i2.u8.P_ifxi_10_0>=1))")))))
Formula 14 simplified : !F(("(((i4.u2.P_b_2_false>=1)&&(i4.u23.P_wait_2_2>=1))&&(i4.u21.P_await_13_2>=1))" U "((i1.u4.x_3>=1)&&(i4.u7.P_setx_3_2>=1))") U ("((i2.u8.y_1>=1)&&(i4.u10.P_sety_9_2>=1))" U "((i3.u5.x_0>=1)&&(i2.u8.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
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.95441,132192,1,0,200196,268,2620,422885,360,876,506301
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 USE_NUPN
Checking formula 15 : !(((X(("((((i0.u14.P_await_13_1>=1)&&(i0.u15.P_done_1_1>=1))&&(i0.u20.P_done_1_2>=1))&&(i0.u16.P_done_1_3>=1))")U("((i0.u1.P_start_1_1>=1)&&(i0.u1.P_b_1_true>=1))")))U(F(G(F("((i1.u3.P_start_1_3>=1)&&(i1.u3.P_b_3_true>=1))"))))))
Formula 15 simplified : !(X("((((i0.u14.P_await_13_1>=1)&&(i0.u15.P_done_1_1>=1))&&(i0.u20.P_done_1_2>=1))&&(i0.u16.P_done_1_3>=1))" U "((i0.u1.P_start_1_1>=1)&&(i0.u1.P_b_1_true>=1))") U FGF"((i1.u3.P_start_1_3>=1)&&(i1.u3.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
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.96095,132352,1,0,200326,268,2646,423272,362,879,506787
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 USE_NUPN
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 1527499795793

--------------------
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/ -louvain -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/ -louvain -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 9:29:49 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/, -louvain, -smt]
May 28, 2018 9:29:49 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 9:29:49 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 82 ms
May 28, 2018 9:29:49 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
May 28, 2018 9:29:49 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 156 transitions.
May 28, 2018 9:29:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
May 28, 2018 9:29:50 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 9:29:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 116 ms
May 28, 2018 9:29:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 54 ms
Begin: Mon May 28 09:29:50 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Mon May 28 09:29:50 2018
network size: 100 nodes, 612 links, 312 weight
quality increased from -0.015976 to 0.347723
end computation: Mon May 28 09:29:50 2018
level 1:
start computation: Mon May 28 09:29:50 2018
network size: 36 nodes, 288 links, 312 weight
quality increased from 0.347723 to 0.468361
end computation: Mon May 28 09:29:50 2018
level 2:
start computation: Mon May 28 09:29:50 2018
network size: 9 nodes, 61 links, 312 weight
quality increased from 0.468361 to 0.488484
end computation: Mon May 28 09:29:50 2018
level 3:
start computation: Mon May 28 09:29:50 2018
network size: 5 nodes, 25 links, 312 weight
quality increased from 0.488484 to 0.488484
end computation: Mon May 28 09:29:50 2018
End: Mon May 28 09:29:50 2018
Total duration: 0 sec
0.488484
May 28, 2018 9:29:50 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 9:29:50 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 26 ms
May 28, 2018 9:29:50 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 9:29:50 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 170 redundant transitions.
May 28, 2018 9:29:50 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
May 28, 2018 9:29:50 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
May 28, 2018 9:29:50 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 156 transitions.
May 28, 2018 9:29:51 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 26 place invariants in 29 ms
May 28, 2018 9:29:51 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 373 ms
May 28, 2018 9:29:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 156 transitions.
May 28, 2018 9:29: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 9:29:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 9:29:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 156 transitions.
May 28, 2018 9:29: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 9:29:53 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 156 transitions.
May 28, 2018 9:29:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(25/156) took 1081 ms. Total solver calls (SAT/UNSAT): 1397(87/1310)
java.io.IOException: Broken pipe
at java.io.FileOutputStream.writeBytes(Native Method)
at java.io.FileOutputStream.write(FileOutputStream.java:326)
at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82)
at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140)
at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297)
at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141)
at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229)
at org.smtlib.SolverProcess.send(SolverProcess.java:163)
at org.smtlib.SolverProcess.sendAndListen(SolverProcess.java:170)
at org.smtlib.solvers.Solver_z3_4_3.start(Solver_z3_4_3.java:140)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:98)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:381)
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)
Skipping mayMatrices nes/nds Could not start solver Z3 from path /home/mcc/BenchKit//z3/bin/z3 raised error :(error "Failed to start process /home/mcc/BenchKit//z3/bin/z3 : with command line [/home/mcc/BenchKit//z3/bin/z3, -smt2, -in, -t:225] Failed with error : Broken pipe")
java.lang.RuntimeException: Could not start solver Z3 from path /home/mcc/BenchKit//z3/bin/z3 raised error :(error "Failed to start process /home/mcc/BenchKit//z3/bin/z3 : with command line [/home/mcc/BenchKit//z3/bin/z3, -smt2, -in, -t:225] Failed with error : Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.buildSolver(NecessaryEnablingsolver.java:100)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:381)
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 9:29:55 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 4734ms 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="itstoolsl"
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 itstoolsl"
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 r261-csrt-152732585800034"
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 ;