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 216K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 2.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 39K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is LamportFastMutEx-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585200020
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527484352827

05:12:35.173 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
05:12:35.177 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
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("(((((pid0.P_ify0_4_0>=1)&&(pid0.y_0>=1))||((pid1.P_ify0_4_1>=1)&&(pid0.y_0>=1)))||((pid2.P_ify0_4_2>=1)&&(pid0.y_0>=1)))||((pid3.P_ify0_4_3>=1)&&(pid0.y_0>=1)))")))
Formula 0 simplified : !G"(((((pid0.P_ify0_4_0>=1)&&(pid0.y_0>=1))||((pid1.P_ify0_4_1>=1)&&(pid0.y_0>=1)))||((pid2.P_ify0_4_2>=1)&&(pid0.y_0>=1)))||((pid3.P_ify0_4_3>=1)&&(pid0.y_0>=1)))"
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 :pid_x_pid10:wait_10 + pid_x_pid10:done_10 + -1'pid2:P_await_13_2 = 0
invariant :pid_x_pid1:wait_1 + pid_x_pid1:done_1 + -1'pid0:P_await_13_0 = 0
invariant :pid_x_pid5:wait_5 + pid_x_pid5:done_5 + -1'pid1:P_await_13_1 = 0
invariant :pid0:y_0 + pid1:y_1 + pid2:y_2 + pid3:y_3 = 1
invariant :pid_x_pid3:wait_3 + pid_x_pid3:done_3 + -1'pid0:P_await_13_0 = 0
invariant :pid_x_pid15:wait_15 + pid_x_pid15:done_15 + -1'pid3:P_await_13_3 = 0
invariant :pid_x_pid14:wait_14 + pid_x_pid14:done_14 + -1'pid3:P_await_13_3 = 0
invariant :pid_x_pid9:wait_9 + pid_x_pid9:done_9 + -1'pid2:P_await_13_2 = 0
invariant :pid3:P_start_1_3 + pid3:P_setx_3_3 + pid3:P_setbi_5_3 + pid3:P_ify0_4_3 + pid3:P_sety_9_3 + pid3:P_ifxi_10_3 + pid3:P_setbi_11_3 + pid3:P_fordo_12_3 + pid3:P_await_13_3 + pid3:P_ifyi_15_3 + pid3:P_awaity_3 + pid3:P_CS_21_3 + pid3:P_setbi_24_3 = 1
invariant :pid_x_pid13:wait_13 + pid_x_pid13:done_13 + -1'pid3:P_await_13_3 = 0
invariant :pid_x_bool4:b_4 + pid_x_bool5:b_5 = 1
invariant :pid0:x_0 + pid1:x_1 + pid2:x_2 + pid3:x_3 = 1
invariant :pid_x_bool0:b_0 + pid_x_bool1:b_1 = 0
invariant :pid_x_bool2:b_2 + pid_x_bool3:b_3 = 1
invariant :pid_x_bool6:b_6 + pid_x_bool7:b_7 = 1
invariant :pid2:P_start_1_2 + pid2:P_setx_3_2 + pid2:P_setbi_5_2 + pid2:P_ify0_4_2 + pid2:P_sety_9_2 + pid2:P_ifxi_10_2 + pid2:P_setbi_11_2 + pid2:P_fordo_12_2 + pid2:P_await_13_2 + pid2:P_ifyi_15_2 + pid2:P_awaity_2 + pid2:P_CS_21_2 + pid2:P_setbi_24_2 = 1
invariant :pid_x_pid7:wait_7 + pid_x_pid7:done_7 + -1'pid1:P_await_13_1 = 0
invariant :pid_x_pid8:wait_8 + pid_x_pid8:done_8 = 0
invariant :pid_x_pid2:wait_2 + pid_x_pid2:done_2 + -1'pid0:P_await_13_0 = 0
invariant :pid_x_pid12:wait_12 + pid_x_pid12:done_12 = 0
invariant :pid1:P_start_1_1 + pid1:P_setx_3_1 + pid1:P_setbi_5_1 + pid1:P_ify0_4_1 + pid1:P_sety_9_1 + pid1:P_ifxi_10_1 + pid1:P_setbi_11_1 + pid1:P_fordo_12_1 + pid1:P_await_13_1 + pid1:P_ifyi_15_1 + pid1:P_awaity_1 + pid1:P_CS_21_1 + pid1:P_setbi_24_1 = 1
invariant :pid_x_pid0:wait_0 + pid_x_pid0:done_0 = 0
invariant :pid_x_pid6:wait_6 + pid_x_pid6:done_6 + -1'pid1:P_await_13_1 = 0
invariant :pid0:P_start_1_0 + pid0:P_setx_3_0 + pid0:P_setbi_5_0 + pid0:P_ify0_4_0 + pid0:P_sety_9_0 + pid0:P_ifxi_10_0 + pid0:P_setbi_11_0 + pid0:P_fordo_12_0 + pid0:P_await_13_0 + pid0:P_ifyi_15_0 + pid0:P_awaity_0 + pid0:P_CS_21_0 + pid0:P_setbi_24_0 = 0
invariant :pid_x_pid11:wait_11 + pid_x_pid11:done_11 + -1'pid2:P_await_13_2 = 0
invariant :pid_x_pid4:wait_4 + pid_x_pid4:done_4 = 0
Reverse transition relation is NOT exact ! Due to transitions T_setbi_2_1, T_setbi_2_2, T_setbi_2_3, T_setx_3_0, T_setx_3_1, T_setx_3_2, T_setx_3_3, T_setbi_5_1, T_awaity, T_sety_9_0, T_sety_9_1, T_sety_9_2, T_sety_9_3, T_setbi_11_1, T_ynei_15_0, T_ynei_15_1, T_ynei_15_2, T_ynei_15_3, T_sety0_23, T_setbi_24_1, T_setbi_24_2, T_setbi_24_3, pid1.T_yeqi_15_1, pid2.T_yeqi_15_2, pid3.T_yeqi_15_3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :10/17/25/52
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
132 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.3436,52596,1,0,69874,6445,1403,100599,353,49212,219303
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G("(((((((((((((((((pid0.y_0>=1)&&(pid0.P_sety_9_0>=1))||((pid1.y_1>=1)&&(pid0.P_sety_9_0>=1)))||((pid2.y_2>=1)&&(pid0.P_sety_9_0>=1)))||((pid3.y_3>=1)&&(pid0.P_sety_9_0>=1)))||((pid0.y_0>=1)&&(pid1.P_sety_9_1>=1)))||((pid1.y_1>=1)&&(pid1.P_sety_9_1>=1)))||((pid2.y_2>=1)&&(pid1.P_sety_9_1>=1)))||((pid3.y_3>=1)&&(pid1.P_sety_9_1>=1)))||((pid0.y_0>=1)&&(pid2.P_sety_9_2>=1)))||((pid1.y_1>=1)&&(pid2.P_sety_9_2>=1)))||((pid2.y_2>=1)&&(pid2.P_sety_9_2>=1)))||((pid3.y_3>=1)&&(pid2.P_sety_9_2>=1)))||((pid0.y_0>=1)&&(pid3.P_sety_9_3>=1)))||((pid1.y_1>=1)&&(pid3.P_sety_9_3>=1)))||((pid2.y_2>=1)&&(pid3.P_sety_9_3>=1)))||((pid3.y_3>=1)&&(pid3.P_sety_9_3>=1)))")))
Formula 1 simplified : !G"(((((((((((((((((pid0.y_0>=1)&&(pid0.P_sety_9_0>=1))||((pid1.y_1>=1)&&(pid0.P_sety_9_0>=1)))||((pid2.y_2>=1)&&(pid0.P_sety_9_0>=1)))||((pid3.y_3>=1)&&(pid0.P_sety_9_0>=1)))||((pid0.y_0>=1)&&(pid1.P_sety_9_1>=1)))||((pid1.y_1>=1)&&(pid1.P_sety_9_1>=1)))||((pid2.y_2>=1)&&(pid1.P_sety_9_1>=1)))||((pid3.y_3>=1)&&(pid1.P_sety_9_1>=1)))||((pid0.y_0>=1)&&(pid2.P_sety_9_2>=1)))||((pid1.y_1>=1)&&(pid2.P_sety_9_2>=1)))||((pid2.y_2>=1)&&(pid2.P_sety_9_2>=1)))||((pid3.y_3>=1)&&(pid2.P_sety_9_2>=1)))||((pid0.y_0>=1)&&(pid3.P_sety_9_3>=1)))||((pid1.y_1>=1)&&(pid3.P_sety_9_3>=1)))||((pid2.y_2>=1)&&(pid3.P_sety_9_3>=1)))||((pid3.y_3>=1)&&(pid3.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.34902,52936,1,0,69874,6445,1478,100599,355,49212,219360
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G("((((((((((((((((((pid0.P_await_13_0>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid0.P_await_13_0>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid8.wait_8>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid9.wait_9>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid10.wait_10>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid11.wait_11>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid12.wait_12>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid13.wait_13>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid14.wait_14>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid15.wait_15>=1)))"))))
Formula 2 simplified : !FG"((((((((((((((((((pid0.P_await_13_0>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid0.P_await_13_0>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid8.wait_8>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid9.wait_9>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid10.wait_10>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid11.wait_11>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid12.wait_12>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid13.wait_13>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid14.wait_14>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid15.wait_15>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
271 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.0591,154276,1,0,295405,6857,1632,337514,355,60673,931215
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G(F(X("(((((pid0.y_0>=1)&&(pid0.P_awaity_0>=1))||((pid0.y_0>=1)&&(pid1.P_awaity_1>=1)))||((pid0.y_0>=1)&&(pid2.P_awaity_2>=1)))||((pid0.y_0>=1)&&(pid3.P_awaity_3>=1)))"))))U(("(((((pid0.P_ify0_4_0>=1)&&(pid0.y_0>=1))||((pid1.P_ify0_4_1>=1)&&(pid0.y_0>=1)))||((pid2.P_ify0_4_2>=1)&&(pid0.y_0>=1)))||((pid3.P_ify0_4_3>=1)&&(pid0.y_0>=1)))")U(G("(((((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool7.b_7>=1)))")))))
Formula 3 simplified : !(GFX"(((((pid0.y_0>=1)&&(pid0.P_awaity_0>=1))||((pid0.y_0>=1)&&(pid1.P_awaity_1>=1)))||((pid0.y_0>=1)&&(pid2.P_awaity_2>=1)))||((pid0.y_0>=1)&&(pid3.P_awaity_3>=1)))" U ("(((((pid0.P_ify0_4_0>=1)&&(pid0.y_0>=1))||((pid1.P_ify0_4_1>=1)&&(pid0.y_0>=1)))||((pid2.P_ify0_4_2>=1)&&(pid0.y_0>=1)))||((pid3.P_ify0_4_3>=1)&&(pid0.y_0>=1)))" U G"(((((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool7.b_7>=1)))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.36924,166868,1,0,318156,6893,1691,366775,355,61475,1002620
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(F(F("(((((pid0.y_0>=1)&&(pid0.P_awaity_0>=1))||((pid0.y_0>=1)&&(pid1.P_awaity_1>=1)))||((pid0.y_0>=1)&&(pid2.P_awaity_2>=1)))||((pid0.y_0>=1)&&(pid3.P_awaity_3>=1)))"))))))
Formula 4 simplified : !GF"(((((pid0.y_0>=1)&&(pid0.P_awaity_0>=1))||((pid0.y_0>=1)&&(pid1.P_awaity_1>=1)))||((pid0.y_0>=1)&&(pid2.P_awaity_2>=1)))||((pid0.y_0>=1)&&(pid3.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
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.49215,170564,1,0,326543,6964,1723,376471,357,62085,1030165
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(F(G(F("(((((pid0.P_ifxi_10_0>=1)&&(pid0.x_0>=1))||((pid1.P_ifxi_10_1>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid2.x_2>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid3.x_3>=1)))"))))))
Formula 5 simplified : !GFGF"(((((pid0.P_ifxi_10_0>=1)&&(pid0.x_0>=1))||((pid1.P_ifxi_10_1>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid2.x_2>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid3.x_3>=1)))"
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
155 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,6.04126,216736,1,0,432528,7304,1749,485232,358,66385,1309998
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(X(X("(((((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool7.b_7>=1)))"))))))
Formula 6 simplified : !XXXX"(((((((((pid0.P_setbi_24_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_setbi_24_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_setbi_24_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_setbi_24_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_setbi_24_3>=1)&&(pid_x_bool7.b_7>=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,6.13781,219900,1,0,438967,7343,1749,492070,358,66626,1333610
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("(((((((((pid0.P_start_1_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_start_1_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_start_1_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_start_1_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool7.b_7>=1)))"))
Formula 7 simplified : !"(((((((((pid0.P_start_1_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_start_1_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_start_1_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_start_1_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool7.b_7>=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,6.13976,220164,1,0,438967,7343,1796,492070,358,66626,1333665
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(F(G(("(((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid3.P_ifyi_15_3>=1)))")U("(((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid3.P_ifyi_15_3>=1)))"))))))
Formula 8 simplified : !FG"(((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid3.P_ifyi_15_3>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
89 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.03703,250524,1,0,507597,7373,1826,566112,360,67400,1515466
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(F(G("(((((((((((((((((pid0.P_setx_3_0>=1)&&(pid0.x_0>=1))||((pid0.P_setx_3_0>=1)&&(pid1.x_1>=1)))||((pid0.P_setx_3_0>=1)&&(pid2.x_2>=1)))||((pid0.P_setx_3_0>=1)&&(pid3.x_3>=1)))||((pid1.P_setx_3_1>=1)&&(pid0.x_0>=1)))||((pid1.P_setx_3_1>=1)&&(pid1.x_1>=1)))||((pid1.P_setx_3_1>=1)&&(pid2.x_2>=1)))||((pid1.P_setx_3_1>=1)&&(pid3.x_3>=1)))||((pid2.P_setx_3_2>=1)&&(pid0.x_0>=1)))||((pid2.P_setx_3_2>=1)&&(pid1.x_1>=1)))||((pid2.P_setx_3_2>=1)&&(pid2.x_2>=1)))||((pid2.P_setx_3_2>=1)&&(pid3.x_3>=1)))||((pid3.P_setx_3_3>=1)&&(pid0.x_0>=1)))||((pid3.P_setx_3_3>=1)&&(pid1.x_1>=1)))||((pid3.P_setx_3_3>=1)&&(pid2.x_2>=1)))||((pid3.P_setx_3_3>=1)&&(pid3.x_3>=1)))"))))U(G(("((((((((((((((((((pid0.P_await_13_0>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid0.P_await_13_0>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid8.wait_8>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid9.wait_9>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid10.wait_10>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid11.wait_11>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid12.wait_12>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid13.wait_13>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid14.wait_14>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid15.wait_15>=1)))")U("(((((((((((((((((pid0.P_setx_3_0>=1)&&(pid0.x_0>=1))||((pid0.P_setx_3_0>=1)&&(pid1.x_1>=1)))||((pid0.P_setx_3_0>=1)&&(pid2.x_2>=1)))||((pid0.P_setx_3_0>=1)&&(pid3.x_3>=1)))||((pid1.P_setx_3_1>=1)&&(pid0.x_0>=1)))||((pid1.P_setx_3_1>=1)&&(pid1.x_1>=1)))||((pid1.P_setx_3_1>=1)&&(pid2.x_2>=1)))||((pid1.P_setx_3_1>=1)&&(pid3.x_3>=1)))||((pid2.P_setx_3_2>=1)&&(pid0.x_0>=1)))||((pid2.P_setx_3_2>=1)&&(pid1.x_1>=1)))||((pid2.P_setx_3_2>=1)&&(pid2.x_2>=1)))||((pid2.P_setx_3_2>=1)&&(pid3.x_3>=1)))||((pid3.P_setx_3_3>=1)&&(pid0.x_0>=1)))||((pid3.P_setx_3_3>=1)&&(pid1.x_1>=1)))||((pid3.P_setx_3_3>=1)&&(pid2.x_2>=1)))||((pid3.P_setx_3_3>=1)&&(pid3.x_3>=1)))")))))
Formula 9 simplified : !(FG"(((((((((((((((((pid0.P_setx_3_0>=1)&&(pid0.x_0>=1))||((pid0.P_setx_3_0>=1)&&(pid1.x_1>=1)))||((pid0.P_setx_3_0>=1)&&(pid2.x_2>=1)))||((pid0.P_setx_3_0>=1)&&(pid3.x_3>=1)))||((pid1.P_setx_3_1>=1)&&(pid0.x_0>=1)))||((pid1.P_setx_3_1>=1)&&(pid1.x_1>=1)))||((pid1.P_setx_3_1>=1)&&(pid2.x_2>=1)))||((pid1.P_setx_3_1>=1)&&(pid3.x_3>=1)))||((pid2.P_setx_3_2>=1)&&(pid0.x_0>=1)))||((pid2.P_setx_3_2>=1)&&(pid1.x_1>=1)))||((pid2.P_setx_3_2>=1)&&(pid2.x_2>=1)))||((pid2.P_setx_3_2>=1)&&(pid3.x_3>=1)))||((pid3.P_setx_3_3>=1)&&(pid0.x_0>=1)))||((pid3.P_setx_3_3>=1)&&(pid1.x_1>=1)))||((pid3.P_setx_3_3>=1)&&(pid2.x_2>=1)))||((pid3.P_setx_3_3>=1)&&(pid3.x_3>=1)))" U G("((((((((((((((((((pid0.P_await_13_0>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid0.wait_0>=1))||(((pid0.P_await_13_0>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid1.wait_1>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid2.wait_2>=1)))||(((pid0.P_await_13_0>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid3.wait_3>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid4.wait_4>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid5.wait_5>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid6.wait_6>=1)))||(((pid1.P_await_13_1>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid7.wait_7>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid8.wait_8>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid9.wait_9>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid10.wait_10>=1)))||(((pid2.P_await_13_2>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid11.wait_11>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool0.b_0>=1))&&(pid_x_pid12.wait_12>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool2.b_2>=1))&&(pid_x_pid13.wait_13>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool4.b_4>=1))&&(pid_x_pid14.wait_14>=1)))||(((pid3.P_await_13_3>=1)&&(pid_x_bool6.b_6>=1))&&(pid_x_pid15.wait_15>=1)))" U "(((((((((((((((((pid0.P_setx_3_0>=1)&&(pid0.x_0>=1))||((pid0.P_setx_3_0>=1)&&(pid1.x_1>=1)))||((pid0.P_setx_3_0>=1)&&(pid2.x_2>=1)))||((pid0.P_setx_3_0>=1)&&(pid3.x_3>=1)))||((pid1.P_setx_3_1>=1)&&(pid0.x_0>=1)))||((pid1.P_setx_3_1>=1)&&(pid1.x_1>=1)))||((pid1.P_setx_3_1>=1)&&(pid2.x_2>=1)))||((pid1.P_setx_3_1>=1)&&(pid3.x_3>=1)))||((pid2.P_setx_3_2>=1)&&(pid0.x_0>=1)))||((pid2.P_setx_3_2>=1)&&(pid1.x_1>=1)))||((pid2.P_setx_3_2>=1)&&(pid2.x_2>=1)))||((pid2.P_setx_3_2>=1)&&(pid3.x_3>=1)))||((pid3.P_setx_3_3>=1)&&(pid0.x_0>=1)))||((pid3.P_setx_3_3>=1)&&(pid1.x_1>=1)))||((pid3.P_setx_3_3>=1)&&(pid2.x_2>=1)))||((pid3.P_setx_3_3>=1)&&(pid3.x_3>=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]
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
202 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,9.055,312312,1,0,649349,7537,1918,713850,362,70130,1902274
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X("(((((((((((((pid1.y_1>=1)&&(pid0.P_ifyi_15_0>=1))||((pid2.y_2>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid3.y_3>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid0.y_0>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid3.y_3>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid0.y_0>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid1.y_1>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid0.y_0>=1)&&(pid3.P_ifyi_15_3>=1)))||((pid1.y_1>=1)&&(pid3.P_ifyi_15_3>=1)))||((pid2.y_2>=1)&&(pid3.P_ifyi_15_3>=1)))")))
Formula 10 simplified : !X"(((((((((((((pid1.y_1>=1)&&(pid0.P_ifyi_15_0>=1))||((pid2.y_2>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid3.y_3>=1)&&(pid0.P_ifyi_15_0>=1)))||((pid0.y_0>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid3.y_3>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid0.y_0>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid1.y_1>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid0.y_0>=1)&&(pid3.P_ifyi_15_3>=1)))||((pid1.y_1>=1)&&(pid3.P_ifyi_15_3>=1)))||((pid2.y_2>=1)&&(pid3.P_ifyi_15_3>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.12034,313896,1,0,652118,7553,1969,717367,362,70209,1912471
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(F(X("(((((((((((((((((pid0.y_0>=1)&&(pid0.P_CS_21_0>=1))||((pid1.y_1>=1)&&(pid0.P_CS_21_0>=1)))||((pid2.y_2>=1)&&(pid0.P_CS_21_0>=1)))||((pid3.y_3>=1)&&(pid0.P_CS_21_0>=1)))||((pid0.y_0>=1)&&(pid1.P_CS_21_1>=1)))||((pid1.y_1>=1)&&(pid1.P_CS_21_1>=1)))||((pid2.y_2>=1)&&(pid1.P_CS_21_1>=1)))||((pid3.y_3>=1)&&(pid1.P_CS_21_1>=1)))||((pid0.y_0>=1)&&(pid2.P_CS_21_2>=1)))||((pid1.y_1>=1)&&(pid2.P_CS_21_2>=1)))||((pid2.y_2>=1)&&(pid2.P_CS_21_2>=1)))||((pid3.y_3>=1)&&(pid2.P_CS_21_2>=1)))||((pid0.y_0>=1)&&(pid3.P_CS_21_3>=1)))||((pid1.y_1>=1)&&(pid3.P_CS_21_3>=1)))||((pid2.y_2>=1)&&(pid3.P_CS_21_3>=1)))||((pid3.y_3>=1)&&(pid3.P_CS_21_3>=1)))")))))
Formula 11 simplified : !XFX"(((((((((((((((((pid0.y_0>=1)&&(pid0.P_CS_21_0>=1))||((pid1.y_1>=1)&&(pid0.P_CS_21_0>=1)))||((pid2.y_2>=1)&&(pid0.P_CS_21_0>=1)))||((pid3.y_3>=1)&&(pid0.P_CS_21_0>=1)))||((pid0.y_0>=1)&&(pid1.P_CS_21_1>=1)))||((pid1.y_1>=1)&&(pid1.P_CS_21_1>=1)))||((pid2.y_2>=1)&&(pid1.P_CS_21_1>=1)))||((pid3.y_3>=1)&&(pid1.P_CS_21_1>=1)))||((pid0.y_0>=1)&&(pid2.P_CS_21_2>=1)))||((pid1.y_1>=1)&&(pid2.P_CS_21_2>=1)))||((pid2.y_2>=1)&&(pid2.P_CS_21_2>=1)))||((pid3.y_3>=1)&&(pid2.P_CS_21_2>=1)))||((pid0.y_0>=1)&&(pid3.P_CS_21_3>=1)))||((pid1.y_1>=1)&&(pid3.P_CS_21_3>=1)))||((pid2.y_2>=1)&&(pid3.P_CS_21_3>=1)))||((pid3.y_3>=1)&&(pid3.P_CS_21_3>=1)))"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
52 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,9.64254,332904,1,0,697856,7666,2045,757406,364,70819,2058437
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F((("(((((((((pid0.P_start_1_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_start_1_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_start_1_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_start_1_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool7.b_7>=1)))")U("(((((((((((((pid0.P_ifxi_10_0>=1)&&(pid1.x_1>=1))||((pid0.P_ifxi_10_0>=1)&&(pid2.x_2>=1)))||((pid0.P_ifxi_10_0>=1)&&(pid3.x_3>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid0.x_0>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid2.x_2>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid3.x_3>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid0.x_0>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid3.x_3>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid0.x_0>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid1.x_1>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid2.x_2>=1)))"))U(G(X("(((((((((((((pid0.P_ify0_4_0>=1)&&(pid1.y_1>=1))||((pid0.P_ify0_4_0>=1)&&(pid2.y_2>=1)))||((pid0.P_ify0_4_0>=1)&&(pid3.y_3>=1)))||((pid1.P_ify0_4_1>=1)&&(pid1.y_1>=1)))||((pid1.P_ify0_4_1>=1)&&(pid2.y_2>=1)))||((pid1.P_ify0_4_1>=1)&&(pid3.y_3>=1)))||((pid2.P_ify0_4_2>=1)&&(pid1.y_1>=1)))||((pid2.P_ify0_4_2>=1)&&(pid2.y_2>=1)))||((pid2.P_ify0_4_2>=1)&&(pid3.y_3>=1)))||((pid3.P_ify0_4_3>=1)&&(pid1.y_1>=1)))||((pid3.P_ify0_4_3>=1)&&(pid2.y_2>=1)))||((pid3.P_ify0_4_3>=1)&&(pid3.y_3>=1)))"))))))
Formula 12 simplified : !F(("(((((((((pid0.P_start_1_0>=1)&&(pid_x_bool0.b_0>=1))||((pid1.P_start_1_1>=1)&&(pid_x_bool2.b_2>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool4.b_4>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool6.b_6>=1)))||((pid0.P_start_1_0>=1)&&(pid_x_bool1.b_1>=1)))||((pid1.P_start_1_1>=1)&&(pid_x_bool3.b_3>=1)))||((pid2.P_start_1_2>=1)&&(pid_x_bool5.b_5>=1)))||((pid3.P_start_1_3>=1)&&(pid_x_bool7.b_7>=1)))" U "(((((((((((((pid0.P_ifxi_10_0>=1)&&(pid1.x_1>=1))||((pid0.P_ifxi_10_0>=1)&&(pid2.x_2>=1)))||((pid0.P_ifxi_10_0>=1)&&(pid3.x_3>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid0.x_0>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid2.x_2>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid3.x_3>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid0.x_0>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid3.x_3>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid0.x_0>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid1.x_1>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid2.x_2>=1)))") U GX"(((((((((((((pid0.P_ify0_4_0>=1)&&(pid1.y_1>=1))||((pid0.P_ify0_4_0>=1)&&(pid2.y_2>=1)))||((pid0.P_ify0_4_0>=1)&&(pid3.y_3>=1)))||((pid1.P_ify0_4_1>=1)&&(pid1.y_1>=1)))||((pid1.P_ify0_4_1>=1)&&(pid2.y_2>=1)))||((pid1.P_ify0_4_1>=1)&&(pid3.y_3>=1)))||((pid2.P_ify0_4_2>=1)&&(pid1.y_1>=1)))||((pid2.P_ify0_4_2>=1)&&(pid2.y_2>=1)))||((pid2.P_ify0_4_2>=1)&&(pid3.y_3>=1)))||((pid3.P_ify0_4_3>=1)&&(pid1.y_1>=1)))||((pid3.P_ify0_4_3>=1)&&(pid2.y_2>=1)))||((pid3.P_ify0_4_3>=1)&&(pid3.y_3>=1)))")
6 unique states visited
5 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
28 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,9.94127,339708,1,0,712027,7711,2096,775631,364,71713,2102448
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F("(((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid3.P_ifyi_15_3>=1)))")))
Formula 13 simplified : !F"(((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid3.P_ifyi_15_3>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,10.4483,354228,1,0,745335,7719,2102,814285,364,71837,2176031
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X("(((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid3.P_ifyi_15_3>=1)))"))))
Formula 14 simplified : !GX"(((((pid0.y_0>=1)&&(pid0.P_ifyi_15_0>=1))||((pid1.y_1>=1)&&(pid1.P_ifyi_15_1>=1)))||((pid2.y_2>=1)&&(pid2.P_ifyi_15_2>=1)))||((pid3.y_3>=1)&&(pid3.P_ifyi_15_3>=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,10.4503,354492,1,0,745335,7719,2102,814285,364,71837,2176066
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((G(X("(((((((((((((pid0.P_ifxi_10_0>=1)&&(pid1.x_1>=1))||((pid0.P_ifxi_10_0>=1)&&(pid2.x_2>=1)))||((pid0.P_ifxi_10_0>=1)&&(pid3.x_3>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid0.x_0>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid2.x_2>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid3.x_3>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid0.x_0>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid3.x_3>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid0.x_0>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid1.x_1>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid2.x_2>=1)))"))))
Formula 15 simplified : !GX"(((((((((((((pid0.P_ifxi_10_0>=1)&&(pid1.x_1>=1))||((pid0.P_ifxi_10_0>=1)&&(pid2.x_2>=1)))||((pid0.P_ifxi_10_0>=1)&&(pid3.x_3>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid0.x_0>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid2.x_2>=1)))||((pid1.P_ifxi_10_1>=1)&&(pid3.x_3>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid0.x_0>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid1.x_1>=1)))||((pid2.P_ifxi_10_2>=1)&&(pid3.x_3>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid0.x_0>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid1.x_1>=1)))||((pid3.P_ifxi_10_3>=1)&&(pid2.x_2>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
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,10.454,354752,1,0,745335,7719,2156,814285,364,71837,2176146
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA LamportFastMutEx-COL-3-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Compilation finished in 3215 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 113 ms.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1527484368761

--------------------
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:34 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:34 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 5:12:34 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 1004 ms
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 18 places.
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :pid * pid->wait,done,
pid * bool->b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 17 transitions.
May 28, 2018 5:12:35 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 28, 2018 5:12:35 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 6 ms
May 28, 2018 5:12:35 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $y of transition T_yeqi_15
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.Instantiator fuseEqualParameters
INFO: Fused parameters : $i and $x of transition T_xeqi_10
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 9.0 instantiations of transitions. Total transitions/syncs built is 179
May 28, 2018 5:12:35 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 106 ms
May 28, 2018 5:12:36 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays P_start_1, x, y, b, P_setx_3, P_setbi_5, P_ify0_4, P_sety_9, P_ifxi_10, P_setbi_11, P_fordo_12, wait, P_await_13, done, P_ifyi_15, P_awaity, P_CS_21, P_setbi_24 to variables to allow decomposition.
May 28, 2018 5:12:36 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 107 redundant transitions.
May 28, 2018 5:12:36 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:36 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 15 ms
May 28, 2018 5:12:37 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 52 transitions. Expanding to a total of 207 deterministic transitions.
May 28, 2018 5:12:37 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 14 ms.
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 26 place invariants in 32 ms
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 303 ms
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 156 transitions.
May 28, 2018 5:12:37 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:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 156 transitions.
May 28, 2018 5:12:37 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:40 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 156 transitions.
May 28, 2018 5:12:40 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(10/156) took 440 ms. Total solver calls (SAT/UNSAT): 501(18/483)
May 28, 2018 5:12:43 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(95/156) took 3464 ms. Total solver calls (SAT/UNSAT): 4356(333/4023)
May 28, 2018 5:12:44 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 4624 ms. Total solver calls (SAT/UNSAT): 5202(420/4782)
May 28, 2018 5:12:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 156 transitions.
May 28, 2018 5:12:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 5:12:45 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 7971ms 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-COL-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-COL-3.tgz
mv LamportFastMutEx-COL-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-COL-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-152732585200020"
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 ;