Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r096-smll-155246587300187.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstools
Input is LamportFastMutEx-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-155246587300187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 5.1K Feb 11 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 11 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 7 23:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 7 23:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.5K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jan 31 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jan 31 23:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 46K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552781695429

Working with output stream class java.io.PrintStream
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.201903111103/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.201903111103/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 : !((X(X(G(F(X("((((((((((y_0>=1)&&(P_sety_9_0>=1))||((y_1>=1)&&(P_sety_9_0>=1)))||((y_2>=1)&&(P_sety_9_0>=1)))||((y_0>=1)&&(P_sety_9_1>=1)))||((y_1>=1)&&(P_sety_9_1>=1)))||((y_2>=1)&&(P_sety_9_1>=1)))||((y_0>=1)&&(P_sety_9_2>=1)))||((y_1>=1)&&(P_sety_9_2>=1)))||((y_2>=1)&&(P_sety_9_2>=1)))")))))))
Formula 0 simplified : !XXGFX"((((((((((y_0>=1)&&(P_sety_9_0>=1))||((y_1>=1)&&(P_sety_9_0>=1)))||((y_2>=1)&&(P_sety_9_0>=1)))||((y_0>=1)&&(P_sety_9_1>=1)))||((y_1>=1)&&(P_sety_9_1>=1)))||((y_2>=1)&&(P_sety_9_1>=1)))||((y_0>=1)&&(P_sety_9_2>=1)))||((y_1>=1)&&(P_sety_9_2>=1)))||((y_2>=1)&&(P_sety_9_2>=1)))"
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_4, T_setx_3_5, T_setx_3_6, T_setx_3_7, T_setx_3_8, T_setx_3_9, T_awaity_2, T_awaity_3, T_sety_9_4, T_sety_9_6, T_sety_9_7, T_sety_9_8, T_ynei_15_4, T_ynei_15_6, T_ynei_15_7, T_ynei_15_8, T_yeqi_15_5, T_yeqi_15_9, T_sety0_23_5, T_sety0_23_6, T_sety0_23_8, T_sety0_23_9, T_setbi_24_3, T_setbi_24_4, T_setbi_24_5, T_setbi_24_6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :48/22/26/96
5 unique states visited
0 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
20 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.234694,22952,1,0,172,22790,174,52,2158,20725,273
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F(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)))")U(X("(((((((((((P_b_0_false>=1)&&(P_wait_0_0>=1))&&(P_await_13_0>=1))||(((P_b_1_false>=1)&&(P_wait_0_1>=1))&&(P_await_13_0>=1)))||(((P_b_2_false>=1)&&(P_wait_0_2>=1))&&(P_await_13_0>=1)))||(((P_b_0_false>=1)&&(P_wait_1_0>=1))&&(P_await_13_1>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))"))))))
Formula 1 simplified : !FG("(((((((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)))" U X"(((((((((((P_b_0_false>=1)&&(P_wait_0_0>=1))&&(P_await_13_0>=1))||(((P_b_1_false>=1)&&(P_wait_0_1>=1))&&(P_await_13_0>=1)))||(((P_b_2_false>=1)&&(P_wait_0_2>=1))&&(P_await_13_0>=1)))||(((P_b_0_false>=1)&&(P_wait_1_0>=1))&&(P_await_13_1>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 87
// Phase 1: matrix 87 rows 69 cols
invariant :P_wait_1_0 + P_done_1_0 = 0
invariant :P_wait_1_1 + -1'P_await_13_1 + P_done_1_1 = 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_1_2 + -1'P_await_13_1 + P_done_1_2 = 0
invariant :P_wait_0_1 + -1'P_await_13_0 + P_done_0_1 = 0
invariant :P_wait_2_2 + -1'P_await_13_2 + P_done_2_2 = 0
invariant :P_b_2_false + P_b_2_true = 1
invariant :P_b_1_false + P_b_1_true = 1
invariant :y_0 + y_1 + y_2 = 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_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_wait_2_0 + P_done_2_0 = 0
invariant :x_0 + x_1 + x_2 = 1
invariant :P_wait_2_1 + -1'P_await_13_2 + P_done_2_1 = 0
invariant :P_wait_0_0 + P_done_0_0 = 0
invariant :P_wait_0_2 + -1'P_await_13_0 + P_done_0_2 = 0
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
5 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,0.308562,25148,1,0,193,28592,191,57,2241,28598,349
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G(X("((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))")))))
Formula 2 simplified : !XGX"((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.312832,25664,1,0,194,28655,199,57,2252,28733,361
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(G((F("(((P_fordo_12_0>=1)||(P_fordo_12_1>=1))||(P_fordo_12_2>=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)))")))))
Formula 3 simplified : !FG(F"(((P_fordo_12_0>=1)||(P_fordo_12_1>=1))||(P_fordo_12_2>=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)))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
6 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.371047,27428,1,0,255,37391,219,88,2278,40170,532
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(F(F(G("((((((((((x_0>=1)&&(P_setx_3_0>=1))||((x_1>=1)&&(P_setx_3_0>=1)))||((x_2>=1)&&(P_setx_3_0>=1)))||((x_0>=1)&&(P_setx_3_1>=1)))||((x_1>=1)&&(P_setx_3_1>=1)))||((x_2>=1)&&(P_setx_3_1>=1)))||((x_0>=1)&&(P_setx_3_2>=1)))||((x_1>=1)&&(P_setx_3_2>=1)))||((x_2>=1)&&(P_setx_3_2>=1)))"))))))
Formula 4 simplified : !XFG"((((((((((x_0>=1)&&(P_setx_3_0>=1))||((x_1>=1)&&(P_setx_3_0>=1)))||((x_2>=1)&&(P_setx_3_0>=1)))||((x_0>=1)&&(P_setx_3_1>=1)))||((x_1>=1)&&(P_setx_3_1>=1)))||((x_2>=1)&&(P_setx_3_1>=1)))||((x_0>=1)&&(P_setx_3_2>=1)))||((x_1>=1)&&(P_setx_3_2>=1)))||((x_2>=1)&&(P_setx_3_2>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.555677,31384,1,0,366,54259,232,137,2302,69540,760
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !(((G(G(G("(((((((y_1>=1)&&(P_ify0_4_0>=1))||((y_2>=1)&&(P_ify0_4_0>=1)))||((y_1>=1)&&(P_ify0_4_1>=1)))||((y_2>=1)&&(P_ify0_4_1>=1)))||((y_1>=1)&&(P_ify0_4_2>=1)))||((y_2>=1)&&(P_ify0_4_2>=1)))"))))U(F(("(((((((((((P_b_0_false>=1)&&(P_wait_0_0>=1))&&(P_await_13_0>=1))||(((P_b_1_false>=1)&&(P_wait_0_1>=1))&&(P_await_13_0>=1)))||(((P_b_2_false>=1)&&(P_wait_0_2>=1))&&(P_await_13_0>=1)))||(((P_b_0_false>=1)&&(P_wait_1_0>=1))&&(P_await_13_1>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))")U("(((((((((((P_b_0_false>=1)&&(P_wait_0_0>=1))&&(P_await_13_0>=1))||(((P_b_1_false>=1)&&(P_wait_0_1>=1))&&(P_await_13_0>=1)))||(((P_b_2_false>=1)&&(P_wait_0_2>=1))&&(P_await_13_0>=1)))||(((P_b_0_false>=1)&&(P_wait_1_0>=1))&&(P_await_13_1>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))")))))
Formula 5 simplified : !(G"(((((((y_1>=1)&&(P_ify0_4_0>=1))||((y_2>=1)&&(P_ify0_4_0>=1)))||((y_1>=1)&&(P_ify0_4_1>=1)))||((y_2>=1)&&(P_ify0_4_1>=1)))||((y_1>=1)&&(P_ify0_4_2>=1)))||((y_2>=1)&&(P_ify0_4_2>=1)))" U F"(((((((((((P_b_0_false>=1)&&(P_wait_0_0>=1))&&(P_await_13_0>=1))||(((P_b_1_false>=1)&&(P_wait_0_1>=1))&&(P_await_13_0>=1)))||(((P_b_2_false>=1)&&(P_wait_0_2>=1))&&(P_await_13_0>=1)))||(((P_b_0_false>=1)&&(P_wait_1_0>=1))&&(P_await_13_1>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.599969,32940,1,0,411,58468,238,155,2302,77508,865
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((G(F(F(("(((((((P_start_1_0>=1)&&(P_b_0_false>=1))||((P_start_1_0>=1)&&(P_b_0_true>=1)))||((P_start_1_1>=1)&&(P_b_1_false>=1)))||((P_start_1_1>=1)&&(P_b_1_true>=1)))||((P_start_1_2>=1)&&(P_b_2_false>=1)))||((P_start_1_2>=1)&&(P_b_2_true>=1)))")U("(((((((y_1>=1)&&(P_ify0_4_0>=1))||((y_2>=1)&&(P_ify0_4_0>=1)))||((y_1>=1)&&(P_ify0_4_1>=1)))||((y_2>=1)&&(P_ify0_4_1>=1)))||((y_1>=1)&&(P_ify0_4_2>=1)))||((y_2>=1)&&(P_ify0_4_2>=1)))"))))))
Formula 6 simplified : !GF("(((((((P_start_1_0>=1)&&(P_b_0_false>=1))||((P_start_1_0>=1)&&(P_b_0_true>=1)))||((P_start_1_1>=1)&&(P_b_1_false>=1)))||((P_start_1_1>=1)&&(P_b_1_true>=1)))||((P_start_1_2>=1)&&(P_b_2_false>=1)))||((P_start_1_2>=1)&&(P_b_2_true>=1)))" U "(((((((y_1>=1)&&(P_ify0_4_0>=1))||((y_2>=1)&&(P_ify0_4_0>=1)))||((y_1>=1)&&(P_ify0_4_1>=1)))||((y_2>=1)&&(P_ify0_4_1>=1)))||((y_1>=1)&&(P_ify0_4_2>=1)))||((y_2>=1)&&(P_ify0_4_2>=1)))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.624757,33728,1,0,441,61009,247,156,2312,80794,951
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((("(((((P_await_13_0>=1)&&(P_done_0_1>=1))&&(P_done_0_2>=1))||(((P_await_13_1>=1)&&(P_done_1_1>=1))&&(P_done_1_2>=1)))||(((P_await_13_2>=1)&&(P_done_2_1>=1))&&(P_done_2_2>=1)))")U(G(G(F("((((((((((y_0>=1)&&(P_CS_21_0>=1))||((y_1>=1)&&(P_CS_21_0>=1)))||((y_2>=1)&&(P_CS_21_0>=1)))||((y_0>=1)&&(P_CS_21_1>=1)))||((y_1>=1)&&(P_CS_21_1>=1)))||((y_2>=1)&&(P_CS_21_1>=1)))||((y_0>=1)&&(P_CS_21_2>=1)))||((y_1>=1)&&(P_CS_21_2>=1)))||((y_2>=1)&&(P_CS_21_2>=1)))"))))))
Formula 7 simplified : !("(((((P_await_13_0>=1)&&(P_done_0_1>=1))&&(P_done_0_2>=1))||(((P_await_13_1>=1)&&(P_done_1_1>=1))&&(P_done_1_2>=1)))||(((P_await_13_2>=1)&&(P_done_2_1>=1))&&(P_done_2_2>=1)))" U GF"((((((((((y_0>=1)&&(P_CS_21_0>=1))||((y_1>=1)&&(P_CS_21_0>=1)))||((y_2>=1)&&(P_CS_21_0>=1)))||((y_0>=1)&&(P_CS_21_1>=1)))||((y_1>=1)&&(P_CS_21_1>=1)))||((y_2>=1)&&(P_CS_21_1>=1)))||((y_0>=1)&&(P_CS_21_2>=1)))||((y_1>=1)&&(P_CS_21_2>=1)))||((y_2>=1)&&(P_CS_21_2>=1)))")
7 unique states visited
0 strongly connected components in search stack
8 transitions explored
5 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,0.698624,36696,1,0,498,69134,256,159,2330,88335,1109
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(("(((P_await_13_0>=1)&&(P_done_0_1>=1))&&(P_done_0_2>=1))"))
Formula 8 simplified : !"(((P_await_13_0>=1)&&(P_done_0_1>=1))&&(P_done_0_2>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.700286,36696,1,0,498,69194,259,159,2336,88459,1114
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(G(("((y_1>=1)&&(P_CS_21_2>=1))")U("(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1))")))))
Formula 9 simplified : !XG("((y_1>=1)&&(P_CS_21_2>=1))" U "(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.703068,37060,1,0,498,69194,275,159,2345,88462,1122
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !(("((y_1>=1)&&(P_ify0_4_2>=1))"))
Formula 10 simplified : !"((y_1>=1)&&(P_ify0_4_2>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.703484,37060,1,0,498,69194,278,159,2345,88463,1124
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(("((x_2>=1)&&(P_ifxi_10_2>=1))"))
Formula 11 simplified : !"((x_2>=1)&&(P_ifxi_10_2>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.703897,37060,1,0,498,69194,281,159,2347,88465,1126
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(F((G("((y_2>=1)&&(P_ify0_4_1>=1))"))U(F("(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1))"))))))
Formula 12 simplified : !GF(G"((y_2>=1)&&(P_ify0_4_1>=1))" U F"(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.704989,37060,1,0,498,69194,290,159,2347,88473,1138
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(("((y_0>=1)&&(P_ify0_4_1>=1))"))
Formula 13 simplified : !"((y_0>=1)&&(P_ify0_4_1>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.705438,37060,1,0,498,69194,293,159,2347,88474,1140
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("((P_b_1_true>=1)&&(P_setbi_5_1>=1))"))
Formula 14 simplified : !"((P_b_1_true>=1)&&(P_setbi_5_1>=1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.705895,37060,1,0,498,69194,296,159,2349,88475,1142
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((("((y_0>=1)&&(P_awaity_1>=1))")U(F(("((P_b_0_true>=1)&&(P_setbi_11_0>=1))")U("((P_b_0_false>=1)&&(P_setbi_11_0>=1))")))))
Formula 15 simplified : !("((y_0>=1)&&(P_awaity_1>=1))" U F("((P_b_0_true>=1)&&(P_setbi_11_0>=1))" U "((P_b_0_false>=1)&&(P_setbi_11_0>=1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.741791,37836,1,0,524,71760,305,174,2352,93978,1244
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1552781700349

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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
Mar 17, 2019 12:14:57 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]
Mar 17, 2019 12:14:57 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 12:14:57 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 57 ms
Mar 17, 2019 12:14:57 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 69 places.
Mar 17, 2019 12:14:57 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 96 transitions.
Mar 17, 2019 12:14:58 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 14 ms
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 57 ms
Mar 17, 2019 12:14:58 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
Mar 17, 2019 12:14:58 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 96 transitions.
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 17 place invariants in 25 ms
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 69 variables to be positive in 222 ms
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 96 transitions.
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/96 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:14:58 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)
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 96 transitions.
Mar 17, 2019 12:14:58 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:14:59 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (or (or (and (>= (select s1 6) 1) (>= (select s1 21) 1)) (and (>= (select s1 6) 1) (>= (select s1 22) 1))) (and (>= (select s1 6) 1) (>= (select s1 23) 1)))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (or (or (and (>= (select s1 6) 1) (>= (select s1 21) 1)) (and (>= (select s1 6) 1) (>= (select s1 22) 1))) (and (>= (select s1 6) 1) (>= (select s1 23) 1)))")
Mar 17, 2019 12:14:59 AM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (assert (and (and (>= (select s0 3) 1) (>= (select s0 15) 1)) (= (store (store s0 21 (+ (select s0 21) 1)) 15 (- (select s0 15) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Stream closed (and (and (>= (select s0 3) 1) (>= (select s0 15) 1)) (= (store (store s0 21 (+ (select s0 21) 1)) 15 (- (select s0 15) 1)) s1))")
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.computeAblingForPredicate(NecessaryEnablingsolver.java:755)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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)
Mar 17, 2019 12:14:59 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 799ms 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-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool itstools"
echo " Input is LamportFastMutEx-PT-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-155246587300187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;