fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r096-smll-155246587300196
Last Updated
Apr 15, 2019

About the Execution of ITS-Tools for LamportFastMutEx-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
636.170 15138.00 31708.00 487.60 TFTFFFTFFFFFFFFF normal

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-155246587300196.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-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-155246587300196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 5.7K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 11 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 7 23:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 7 23:32 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.4K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jan 31 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Jan 31 23:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 75K 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-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 1552781899952

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 : !(("(((((((((P_start_1_0>=1)&&(P_b_0_false>=1))||((P_start_1_0>=1)&&(P_b_0_true>=1)))||((P_start_1_1>=1)&&(P_b_1_false>=1)))||((P_start_1_1>=1)&&(P_b_1_true>=1)))||((P_start_1_2>=1)&&(P_b_2_false>=1)))||((P_start_1_2>=1)&&(P_b_2_true>=1)))||((P_start_1_3>=1)&&(P_b_3_false>=1)))||((P_start_1_3>=1)&&(P_b_3_true>=1)))"))
Formula 0 simplified : !"(((((((((P_start_1_0>=1)&&(P_b_0_false>=1))||((P_start_1_0>=1)&&(P_b_0_true>=1)))||((P_start_1_1>=1)&&(P_b_1_false>=1)))||((P_start_1_1>=1)&&(P_b_1_true>=1)))||((P_start_1_2>=1)&&(P_b_2_false>=1)))||((P_start_1_2>=1)&&(P_b_2_true>=1)))||((P_start_1_3>=1)&&(P_b_3_false>=1)))||((P_start_1_3>=1)&&(P_b_3_true>=1)))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 132
// Phase 1: matrix 132 rows 100 cols
invariant :P_wait_2_3 + -1'P_await_13_2 + P_done_2_3 = 0
invariant :P_wait_0_3 + -1'P_await_13_0 + P_done_0_3 = 0
invariant :P_wait_1_3 + -1'P_await_13_1 + P_done_1_3 = 0
invariant :P_wait_0_2 + -1'P_await_13_0 + P_done_0_2 = 0
invariant :P_wait_2_0 + P_done_2_0 = 0
invariant :P_wait_3_3 + -1'P_await_13_3 + P_done_3_3 = 0
invariant :P_b_0_false + P_b_0_true = 0
invariant :P_start_1_0 + P_setx_3_0 + P_setbi_5_0 + P_ify0_4_0 + P_sety_9_0 + P_ifxi_10_0 + P_setbi_11_0 + P_fordo_12_0 + P_await_13_0 + P_ifyi_15_0 + P_awaity_0 + P_CS_21_0 + P_setbi_24_0 = 0
invariant :P_start_1_3 + P_setx_3_3 + P_setbi_5_3 + P_ify0_4_3 + P_sety_9_3 + P_ifxi_10_3 + P_setbi_11_3 + P_fordo_12_3 + P_await_13_3 + P_ifyi_15_3 + P_awaity_3 + P_CS_21_3 + P_setbi_24_3 = 1
invariant :y_0 + y_1 + y_2 + y_3 = 1
invariant :P_b_3_false + P_b_3_true = 1
invariant :P_wait_1_0 + P_done_1_0 = 0
invariant :P_wait_0_1 + -1'P_await_13_0 + P_done_0_1 = 0
invariant :P_wait_3_1 + -1'P_await_13_3 + P_done_3_1 = 0
invariant :P_wait_3_2 + -1'P_await_13_3 + P_done_3_2 = 0
invariant :P_b_2_false + P_b_2_true = 1
invariant :P_start_1_2 + P_setx_3_2 + P_setbi_5_2 + P_ify0_4_2 + P_sety_9_2 + P_ifxi_10_2 + P_setbi_11_2 + P_fordo_12_2 + P_await_13_2 + P_ifyi_15_2 + P_awaity_2 + P_CS_21_2 + P_setbi_24_2 = 1
invariant :P_wait_0_0 + P_done_0_0 = 0
invariant :P_start_1_1 + P_setx_3_1 + P_setbi_5_1 + P_ify0_4_1 + P_sety_9_1 + P_ifxi_10_1 + P_setbi_11_1 + P_fordo_12_1 + P_await_13_1 + P_ifyi_15_1 + P_awaity_1 + P_CS_21_1 + P_setbi_24_1 = 1
invariant :P_wait_3_0 + P_done_3_0 = 0
invariant :P_wait_2_2 + -1'P_await_13_2 + P_done_2_2 = 0
invariant :P_b_1_false + P_b_1_true = 1
invariant :P_wait_2_1 + -1'P_await_13_2 + P_done_2_1 = 0
invariant :P_wait_1_2 + -1'P_await_13_1 + P_done_1_2 = 0
invariant :x_0 + x_1 + x_2 + x_3 = 1
invariant :P_wait_1_1 + -1'P_await_13_1 + P_done_1_1 = 0
Reverse transition relation is NOT exact ! Due to transitions T_setx_3_5, T_setx_3_6, T_setx_3_7, T_setx_3_8, T_setx_3_9, T_setx_3_10, T_setx_3_11, T_setx_3_12, T_setx_3_13, T_setx_3_14, T_setx_3_15, T_setx_3_16, T_setbi_5_4, T_setbi_5_6, T_setbi_5_8, T_awaity_2, T_awaity_3, T_awaity_4, T_sety_9_5, T_sety_9_7, T_sety_9_8, T_sety_9_9, T_sety_9_10, T_sety_9_12, T_sety_9_13, T_sety_9_14, T_sety_9_15, T_setbi_11_4, T_setbi_11_6, T_setbi_11_8, T_ynei_15_5, T_ynei_15_7, T_ynei_15_8, T_ynei_15_9, T_ynei_15_10, T_ynei_15_12, T_ynei_15_13, T_ynei_15_14, T_ynei_15_15, T_yeqi_15_6, T_yeqi_15_11, T_yeqi_15_16, T_sety0_23_6, T_sety0_23_7, T_sety0_23_8, T_sety0_23_10, T_sety0_23_11, T_sety0_23_12, T_sety0_23_14, T_sety0_23_15, T_sety0_23_16, T_setbi_24_3, T_setbi_24_4, T_setbi_24_5, T_setbi_24_6, T_setbi_24_7, T_setbi_24_8, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :63/36/57/156
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
140 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.45347,50876,1,0,253,144817,269,96,3242,157505,257
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(F(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_3_false>=1)&&(P_wait_0_3>=1))&&(P_await_13_0>=1)))||(((P_b_0_false>=1)&&(P_wait_1_0>=1))&&(P_await_13_1>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_3_false>=1)&&(P_wait_1_3>=1))&&(P_await_13_1>=1)))||(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))||(((P_b_3_false>=1)&&(P_wait_2_3>=1))&&(P_await_13_2>=1)))||(((P_b_0_false>=1)&&(P_wait_3_0>=1))&&(P_await_13_3>=1)))||(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=1)))||(((P_b_2_false>=1)&&(P_wait_3_2>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_3_3>=1))&&(P_await_13_3>=1)))")))))
Formula 1 simplified : !XF"((((((((((((((((((P_b_0_false>=1)&&(P_wait_0_0>=1))&&(P_await_13_0>=1))||(((P_b_1_false>=1)&&(P_wait_0_1>=1))&&(P_await_13_0>=1)))||(((P_b_2_false>=1)&&(P_wait_0_2>=1))&&(P_await_13_0>=1)))||(((P_b_3_false>=1)&&(P_wait_0_3>=1))&&(P_await_13_0>=1)))||(((P_b_0_false>=1)&&(P_wait_1_0>=1))&&(P_await_13_1>=1)))||(((P_b_1_false>=1)&&(P_wait_1_1>=1))&&(P_await_13_1>=1)))||(((P_b_2_false>=1)&&(P_wait_1_2>=1))&&(P_await_13_1>=1)))||(((P_b_3_false>=1)&&(P_wait_1_3>=1))&&(P_await_13_1>=1)))||(((P_b_0_false>=1)&&(P_wait_2_0>=1))&&(P_await_13_2>=1)))||(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1)))||(((P_b_2_false>=1)&&(P_wait_2_2>=1))&&(P_await_13_2>=1)))||(((P_b_3_false>=1)&&(P_wait_2_3>=1))&&(P_await_13_2>=1)))||(((P_b_0_false>=1)&&(P_wait_3_0>=1))&&(P_await_13_3>=1)))||(((P_b_1_false>=1)&&(P_wait_3_1>=1))&&(P_await_13_3>=1)))||(((P_b_2_false>=1)&&(P_wait_3_2>=1))&&(P_await_13_3>=1)))||(((P_b_3_false>=1)&&(P_wait_3_3>=1))&&(P_await_13_3>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
69 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.1422,69304,1,0,317,206035,278,119,3370,245349,393
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(X(F("(((((((((P_b_0_false>=1)&&(P_setbi_24_0>=1))||((P_b_0_true>=1)&&(P_setbi_24_0>=1)))||((P_b_1_false>=1)&&(P_setbi_24_1>=1)))||((P_b_1_true>=1)&&(P_setbi_24_1>=1)))||((P_b_2_false>=1)&&(P_setbi_24_2>=1)))||((P_b_2_true>=1)&&(P_setbi_24_2>=1)))||((P_b_3_false>=1)&&(P_setbi_24_3>=1)))||((P_b_3_true>=1)&&(P_setbi_24_3>=1)))")))))
Formula 2 simplified : !XXF"(((((((((P_b_0_false>=1)&&(P_setbi_24_0>=1))||((P_b_0_true>=1)&&(P_setbi_24_0>=1)))||((P_b_1_false>=1)&&(P_setbi_24_1>=1)))||((P_b_1_true>=1)&&(P_setbi_24_1>=1)))||((P_b_2_false>=1)&&(P_setbi_24_2>=1)))||((P_b_2_true>=1)&&(P_setbi_24_2>=1)))||((P_b_3_false>=1)&&(P_setbi_24_3>=1)))||((P_b_3_true>=1)&&(P_setbi_24_3>=1)))"
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
126 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.41417,105436,1,0,439,325609,287,146,3390,393039,659
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(G("(((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))"))))
Formula 3 simplified : !FG"(((((y_0>=1)&&(P_awaity_0>=1))||((y_0>=1)&&(P_awaity_1>=1)))||((y_0>=1)&&(P_awaity_2>=1)))||((y_0>=1)&&(P_awaity_3>=1)))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
296 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.37423,181980,1,0,612,650748,300,225,3406,931125,1050
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(X(F(("(((((((((((((x_1>=1)&&(P_ifxi_10_0>=1))||((x_2>=1)&&(P_ifxi_10_0>=1)))||((x_3>=1)&&(P_ifxi_10_0>=1)))||((x_0>=1)&&(P_ifxi_10_1>=1)))||((x_2>=1)&&(P_ifxi_10_1>=1)))||((x_3>=1)&&(P_ifxi_10_1>=1)))||((x_0>=1)&&(P_ifxi_10_2>=1)))||((x_1>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_2>=1)))||((x_0>=1)&&(P_ifxi_10_3>=1)))||((x_1>=1)&&(P_ifxi_10_3>=1)))||((x_2>=1)&&(P_ifxi_10_3>=1)))")U("(((((y_0>=1)&&(P_ifyi_15_0>=1))||((y_1>=1)&&(P_ifyi_15_1>=1)))||((y_2>=1)&&(P_ifyi_15_2>=1)))||((y_3>=1)&&(P_ifyi_15_3>=1)))"))))))
Formula 4 simplified : !GXF("(((((((((((((x_1>=1)&&(P_ifxi_10_0>=1))||((x_2>=1)&&(P_ifxi_10_0>=1)))||((x_3>=1)&&(P_ifxi_10_0>=1)))||((x_0>=1)&&(P_ifxi_10_1>=1)))||((x_2>=1)&&(P_ifxi_10_1>=1)))||((x_3>=1)&&(P_ifxi_10_1>=1)))||((x_0>=1)&&(P_ifxi_10_2>=1)))||((x_1>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_2>=1)))||((x_0>=1)&&(P_ifxi_10_3>=1)))||((x_1>=1)&&(P_ifxi_10_3>=1)))||((x_2>=1)&&(P_ifxi_10_3>=1)))" U "(((((y_0>=1)&&(P_ifyi_15_0>=1))||((y_1>=1)&&(P_ifyi_15_1>=1)))||((y_2>=1)&&(P_ifyi_15_2>=1)))||((y_3>=1)&&(P_ifyi_15_3>=1)))")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,6.8888,198600,1,0,637,692568,313,226,3535,997771,1152
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X("(((((((((P_b_0_false>=1)&&(P_setbi_5_0>=1))||((P_b_0_true>=1)&&(P_setbi_5_0>=1)))||((P_b_1_false>=1)&&(P_setbi_5_1>=1)))||((P_b_1_true>=1)&&(P_setbi_5_1>=1)))||((P_b_2_false>=1)&&(P_setbi_5_2>=1)))||((P_b_2_true>=1)&&(P_setbi_5_2>=1)))||((P_b_3_false>=1)&&(P_setbi_5_3>=1)))||((P_b_3_true>=1)&&(P_setbi_5_3>=1)))")))
Formula 5 simplified : !X"(((((((((P_b_0_false>=1)&&(P_setbi_5_0>=1))||((P_b_0_true>=1)&&(P_setbi_5_0>=1)))||((P_b_1_false>=1)&&(P_setbi_5_1>=1)))||((P_b_1_true>=1)&&(P_setbi_5_1>=1)))||((P_b_2_false>=1)&&(P_setbi_5_2>=1)))||((P_b_2_true>=1)&&(P_setbi_5_2>=1)))||((P_b_3_false>=1)&&(P_setbi_5_3>=1)))||((P_b_3_true>=1)&&(P_setbi_5_3>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
15 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.04301,203088,1,0,637,700512,318,226,3555,1.01416e+06,1159
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F("(((((y_0>=1)&&(P_ify0_4_0>=1))||((y_0>=1)&&(P_ify0_4_1>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_3>=1)))")))
Formula 6 simplified : !F"(((((y_0>=1)&&(P_ify0_4_0>=1))||((y_0>=1)&&(P_ify0_4_1>=1)))||((y_0>=1)&&(P_ify0_4_2>=1)))||((y_0>=1)&&(P_ify0_4_3>=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,7.04962,203088,1,0,649,700860,327,229,3568,1.01476e+06,1194
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(((((((((P_b_0_false>=1)&&(P_setbi_11_0>=1))||((P_b_0_true>=1)&&(P_setbi_11_0>=1)))||((P_b_1_false>=1)&&(P_setbi_11_1>=1)))||((P_b_1_true>=1)&&(P_setbi_11_1>=1)))||((P_b_2_false>=1)&&(P_setbi_11_2>=1)))||((P_b_2_true>=1)&&(P_setbi_11_2>=1)))||((P_b_3_false>=1)&&(P_setbi_11_3>=1)))||((P_b_3_true>=1)&&(P_setbi_11_3>=1)))"))
Formula 7 simplified : !"(((((((((P_b_0_false>=1)&&(P_setbi_11_0>=1))||((P_b_0_true>=1)&&(P_setbi_11_0>=1)))||((P_b_1_false>=1)&&(P_setbi_11_1>=1)))||((P_b_1_true>=1)&&(P_setbi_11_1>=1)))||((P_b_2_false>=1)&&(P_setbi_11_2>=1)))||((P_b_2_true>=1)&&(P_setbi_11_2>=1)))||((P_b_3_false>=1)&&(P_setbi_11_3>=1)))||((P_b_3_true>=1)&&(P_setbi_11_3>=1)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
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,7.08021,203880,1,0,649,702386,330,229,3588,1.01746e+06,1199
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((F("((y_3>=1)&&(P_sety_9_0>=1))"))U(G("((((P_await_13_0>=1)&&(P_done_0_1>=1))&&(P_done_0_2>=1))&&(P_done_0_3>=1))"))))
Formula 8 simplified : !(F"((y_3>=1)&&(P_sety_9_0>=1))" U G"((((P_await_13_0>=1)&&(P_done_0_1>=1))&&(P_done_0_2>=1))&&(P_done_0_3>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,7.09375,204720,1,0,649,702386,341,229,3604,1.01751e+06,1230
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((X(("((y_0>=1)&&(P_ifyi_15_0>=1))")U("((y_2>=1)&&(P_ifyi_15_0>=1))")))U("((y_0>=1)&&(P_ify0_4_1>=1))")))
Formula 9 simplified : !(X("((y_0>=1)&&(P_ifyi_15_0>=1))" U "((y_2>=1)&&(P_ifyi_15_0>=1))") U "((y_0>=1)&&(P_ify0_4_1>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
106 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,8.16015,223828,1,0,772,777796,355,271,3607,1.11895e+06,1465
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(G("((y_0>=1)&&(P_CS_21_3>=1))"))))
Formula 10 simplified : !XG"((y_0>=1)&&(P_CS_21_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,8.16134,223828,1,0,772,777796,361,271,3609,1.11895e+06,1470
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((X(G(X(("((x_3>=1)&&(P_ifxi_10_2>=1))")U("((x_0>=1)&&(P_ifxi_10_1>=1))"))))))
Formula 11 simplified : !XGX("((x_3>=1)&&(P_ifxi_10_2>=1))" U "((x_0>=1)&&(P_ifxi_10_1>=1))")
18 unique states visited
18 strongly connected components in search stack
19 transitions explored
18 items max in DFS search stack
12 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,8.27843,227448,1,0,821,793050,373,282,3620,1.1325e+06,1609
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((((G("((P_start_1_2>=1)&&(P_b_2_false>=1))"))U(X("((P_b_1_true>=1)&&(P_setbi_5_1>=1))")))U(X(G(F("((y_0>=1)&&(P_CS_21_2>=1))"))))))
Formula 12 simplified : !((G"((P_start_1_2>=1)&&(P_b_2_false>=1))" U X"((P_b_1_true>=1)&&(P_setbi_5_1>=1))") U XGF"((y_0>=1)&&(P_CS_21_2>=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,8.28527,228692,1,0,821,793050,382,282,3622,1.13271e+06,1621
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X(G((G("((P_b_2_false>=1)&&(P_setbi_5_2>=1))"))U("((y_2>=1)&&(P_CS_21_3>=1))")))))
Formula 13 simplified : !XG(G"((P_b_2_false>=1)&&(P_setbi_5_2>=1))" U "((y_2>=1)&&(P_CS_21_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,8.28794,228876,1,0,821,793050,398,282,3631,1.13271e+06,1628
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((X(G(G(("((y_0>=1)&&(P_ify0_4_2>=1))")U("((y_2>=1)&&(P_CS_21_1>=1))"))))))
Formula 14 simplified : !XG("((y_0>=1)&&(P_ify0_4_2>=1))" U "((y_2>=1)&&(P_CS_21_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,8.2902,229136,1,0,821,793050,414,282,3641,1.13272e+06,1635
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-3-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G((F(X("((x_2>=1)&&(P_setx_3_0>=1))")))U(F(F("((((P_await_13_1>=1)&&(P_done_1_1>=1))&&(P_done_1_2>=1))&&(P_done_1_3>=1))"))))))
Formula 15 simplified : !G(FX"((x_2>=1)&&(P_setx_3_0>=1))" U F"((((P_await_13_1>=1)&&(P_done_1_1>=1))&&(P_done_1_2>=1))&&(P_done_1_3>=1))")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,8.5636,236496,1,0,855,824350,423,283,3647,1.16764e+06,1731
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
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 1552781915090

--------------------
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:18:23 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:18:23 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 17, 2019 12:18:23 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 77 ms
Mar 17, 2019 12:18:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 100 places.
Mar 17, 2019 12:18:23 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 156 transitions.
Mar 17, 2019 12:18:23 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 21 ms
Mar 17, 2019 12:18:23 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 80 ms
Mar 17, 2019 12:18:23 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
Mar 17, 2019 12:18:23 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 156 transitions.
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 26 place invariants in 31 ms
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 100 variables to be positive in 315 ms
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 156 transitions.
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/156 took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 156 transitions.
Mar 17, 2019 12:18:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:18:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 156 transitions.
Mar 17, 2019 12:18:27 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(8/156) took 346 ms. Total solver calls (SAT/UNSAT): 384(9/375)
Mar 17, 2019 12:18:30 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(69/156) took 3357 ms. Total solver calls (SAT/UNSAT): 3791(309/3482)
Mar 17, 2019 12:18:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 5300 ms. Total solver calls (SAT/UNSAT): 5202(420/4782)
Mar 17, 2019 12:18:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 156 transitions.
Mar 17, 2019 12:18:32 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 17, 2019 12:18:32 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 8767ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# 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-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 r096-smll-155246587300196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-3.tgz
mv LamportFastMutEx-PT-3 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 ;