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 248K
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 46K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
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 r262-csrt-152732586700032
=====================================================================

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


BK_STOP 1527525111751

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using LamportFastMutEx-PT-2 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 144, 'Memory': 112.35, 'Tool': 'lola'}, {'Time': 256, 'Memory': 111.61, 'Tool': 'lola'}, {'Time': 4410, 'Memory': 344.91, 'Tool': 'itstools'}, {'Time': 4544, 'Memory': 377.27, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 30.625x far from the best tool lola.
LTLFireability itstools LamportFastMutEx-PT-2...
May 28, 2018 4:31:49 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, LTLFireability]
May 28, 2018 4:31:49 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 28, 2018 4:31:49 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 47 ms
May 28, 2018 4:31:49 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 69 places.
May 28, 2018 4:31:50 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 96 transitions.
May 28, 2018 4:31:50 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 20 ms
May 28, 2018 4:31:50 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 45 ms
Using solver Z3 to compute partial order matrices.
May 28, 2018 4:31:50 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLFireability.pnml.gal : 1 ms
Built C files in :
/mcc-data
May 28, 2018 4:31:50 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLFireability.ltl : 19 ms
May 28, 2018 4:31:50 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 96 transitions.
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /mcc-data/LTLFireability.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/mcc-data]

its-ltl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64 --gc-threshold 2000000 -i /mcc-data/LTLFireability.pnml.gal -t CGAL -LTL /mcc-data/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G(X(X(F("((((y_0>=1)&&(P_ifyi_15_0>=1))||((y_1>=1)&&(P_ifyi_15_1>=1)))||((y_2>=1)&&(P_ifyi_15_2>=1)))"))))))
Formula 0 simplified : !GXXF"((((y_0>=1)&&(P_ifyi_15_0>=1))||((y_1>=1)&&(P_ifyi_15_1>=1)))||((y_2>=1)&&(P_ifyi_15_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
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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,0.142464,21088,1,0,144,16400,174,52,2154,15942,216
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(G(G(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 : !GX"(((((((((((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)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.152864,21456,1,0,146,16685,182,52,2214,16362,232
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 : !(("(((((((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)))"))
Formula 2 simplified : !"(((((((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)))"
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.155227,21720,1,0,146,16745,185,52,2233,16490,237
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 : !((G(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)))"))))
Formula 3 simplified : !GF"(((((((((((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)))"
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 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.191377,22560,1,0,168,20334,191,53,2233,19954,303
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 : !(("(((((((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)))"))
Formula 4 simplified : !"(((((((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)))"
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.192717,22560,1,0,168,20334,194,53,2248,19957,305
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 : !((F(F(F(("(((((((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("(((((((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)))"))))))
Formula 5 simplified : !F("(((((((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 "(((((((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)))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 87
// Phase 1: matrix 87 rows 69 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.255632,25200,1,0,241,30067,200,79,2248,34646,451
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("((((((((((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 6 simplified : !G"((((((((((y_0>=1)&&(P_sety_9_0>=1))||((y_1>=1)&&(P_sety_9_0>=1)))||((y_2>=1)&&(P_sety_9_0>=1)))||((y_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)))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
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
May 28, 2018 4:31:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 17 place invariants in 38 ms
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.258769,25464,1,0,241,30067,206,79,2269,34651,456
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 : !(((G(F(G("((((((((((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)))"))))U(G("(((((((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)))"))))
Formula 7 simplified : !(GFG"((((((((((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)))" U G"(((((((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)))")
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,0.271665,26332,1,0,250,31310,217,80,2304,36007,498
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA LamportFastMutEx-PT-2-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((("((P_b_0_false>=1)&&(P_setbi_24_0>=1))")U(F(G(F("((P_b_2_true>=1)&&(P_setbi_5_2>=1))"))))))
Formula 8 simplified : !("((P_b_0_false>=1)&&(P_setbi_24_0>=1))" U FGF"((P_b_2_true>=1)&&(P_setbi_5_2>=1))")
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.27926,26760,1,0,278,31966,226,81,2304,36769,579
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 : !((F(G(X(F("((y_1>=1)&&(P_CS_21_0>=1))"))))))
Formula 9 simplified : !FGXF"((y_1>=1)&&(P_CS_21_0>=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.280266,26760,1,0,278,31966,235,81,2305,36773,585
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_2>=1)&&(P_CS_21_2>=1))"))
Formula 10 simplified : !"((y_2>=1)&&(P_CS_21_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.280785,27000,1,0,278,31966,238,81,2305,36774,587
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 : !(((G(("((P_start_1_0>=1)&&(P_b_0_true>=1))")U("((y_1>=1)&&(P_sety_9_0>=1))")))U(F(X("((x_1>=1)&&(P_setx_3_2>=1))")))))
Formula 11 simplified : !(G("((P_start_1_0>=1)&&(P_b_0_true>=1))" U "((y_1>=1)&&(P_sety_9_0>=1))") U FX"((x_1>=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
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.310544,28432,1,0,343,35858,247,104,2308,44986,715
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 : !((X(F((X("((x_2>=1)&&(P_ifxi_10_1>=1))"))U("((y_2>=1)&&(P_ifyi_15_2>=1))")))))
Formula 12 simplified : !XF(X"((x_2>=1)&&(P_ifxi_10_1>=1))" U "((y_2>=1)&&(P_ifyi_15_2>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,0.382876,29488,1,0,392,41163,256,125,2308,54635,840
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 : !(("((x_1>=1)&&(P_setx_3_1>=1))"))
Formula 13 simplified : !"((x_1>=1)&&(P_setx_3_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.383511,29752,1,0,392,41163,259,125,2310,54635,842
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 : !((G(G("(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_2>=1))"))))
Formula 14 simplified : !G"(((P_b_1_false>=1)&&(P_wait_2_1>=1))&&(P_await_13_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.384341,29752,1,0,392,41163,265,125,2310,54635,847
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 : !((G(X(F(X("((y_0>=1)&&(P_ify0_4_1>=1))"))))))
Formula 15 simplified : !GXFX"((y_0>=1)&&(P_ify0_4_1>=1))"
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.405929,30528,1,0,429,46142,274,126,2312,58473,948
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
May 28, 2018 4:31:50 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 69 variables to be positive in 219 ms
May 28, 2018 4:31:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 96 transitions.
May 28, 2018 4:31:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/96 took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 4:31:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 4:31:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 96 transitions.
May 28, 2018 4:31:50 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)

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="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 mcc4mcc-full"
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 r262-csrt-152732586700032"
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 ;