About the Execution of M4M.struct for DrinkVendingMachine-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
661.080 | 47442.00 | 14776.00 | 373.80 | TFFFTTFTFTFFTFFF | normal |
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 184K
-rw-r--r-- 1 mcc users 4.0K 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 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 22K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DrinkVendingMachine-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r239-blw3-152732478900091
=====================================================================
--------------------
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 DrinkVendingMachine-COL-02-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1528032792119
BK_STOP 1528032839561
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DrinkVendingMachine-COL-02 as instance name.
Using DrinkVendingMachine as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Extended Free Choice': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 110, 'Memory': 112.06, 'Tool': 'lola'}, {'Time': 142, 'Memory': 110.82, 'Tool': 'lola'}, {'Time': 3789, 'Memory': 261.99, 'Tool': 'itstools'}, {'Time': 4303, 'Memory': 328.81, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 34.445454545454545x far from the best tool lola.
LTLCardinality itstools DrinkVendingMachine-COL-02...
Jun 03, 2018 1:33:17 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, LTLCardinality]
Jun 03, 2018 1:33:17 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 03, 2018 1:33:17 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
13:33:57.769 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
13:33:57.771 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 40696 ms
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 6 places.
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Options->theOptions,optionSlots,
Products->theProducts,productSlots,
Quality->ready,wait,
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: o1 symmetric to o2 in transition elaborate3
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: o2 symmetric to o3 in transition elaborate3
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer detectBindingSymmetry
INFO: o1 symmetric to o2 in transition elaborate2
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 7 transitions.
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 03, 2018 1:33:58 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 6 ms
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.instantiate.Instantiator instantiateParameters
INFO: On-the-fly reduction of False transitions avoided exploring 176.0 instantiations of transitions. Total transitions/syncs built is 52
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 101 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
Jun 03, 2018 1:33:58 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 4 ms
Jun 03, 2018 1:33:58 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLCardinality.ltl : 1 ms
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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /mcc-data/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((F((X("((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)>=2)"))U(F("((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)<=(theOptions_0+theOptions_1))")))))
Formula 0 simplified : !F(X"((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)>=2)" U F"((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)<=(theOptions_0+theOptions_1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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,0.028413,17256,1,0,5,791,20,0,710,502,6
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G(G(F("((optionSlots_0+optionSlots_1)>=3)"))))))
Formula 1 simplified : !FGF"((optionSlots_0+optionSlots_1)>=3)"
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.032269,17664,1,0,5,1244,33,0,841,743,20
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G("((productSlots_0+productSlots_1)>=3)")))
Formula 2 simplified : !G"((productSlots_0+productSlots_1)>=3)"
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.034285,17664,1,0,6,1514,41,0,845,999,32
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X("((theProducts_0+theProducts_1)>=1)"))))
Formula 3 simplified : !XX"((theProducts_0+theProducts_1)>=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.038069,17664,1,0,9,2100,44,0,849,1562,42
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(G(("((optionSlots_0+optionSlots_1)>=2)")U("((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)>=2)")))))
Formula 4 simplified : !G("((optionSlots_0+optionSlots_1)>=2)" U "((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)>=2)")
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 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.065887,18844,1,0,27,6506,60,18,919,8386,137
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((F(F("((productSlots_0+productSlots_1)>=2)")))U(X("((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)>=1)"))))
Formula 5 simplified : !(F"((productSlots_0+productSlots_1)>=2)" U X"((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)>=1)")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.06782,18844,1,0,27,6507,71,18,942,8387,144
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((F(G("((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)<=(theOptions_0+theOptions_1))")))U(F("((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)>=3)"))))
Formula 6 simplified : !(FG"((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)<=(theOptions_0+theOptions_1))" U F"((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)>=3)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.080338,19020,1,0,36,7945,80,22,969,10936,184
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(("((optionSlots_0+optionSlots_1)<=(((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7))"))
Formula 7 simplified : !"((optionSlots_0+optionSlots_1)<=(((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.081265,19020,1,0,36,7945,83,22,980,10936,186
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((G("((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)<=(productSlots_0+productSlots_1))"))U("((productSlots_0+productSlots_1)>=3)"))))
Formula 8 simplified : !X(G"((((((((wait_0+wait_1)+wait_2)+wait_3)+wait_4)+wait_5)+wait_6)+wait_7)<=(productSlots_0+productSlots_1))" U "((productSlots_0+productSlots_1)>=3)")
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.084897,19592,1,0,36,8000,91,22,1047,11112,192
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(("((theProducts_0+theProducts_1)>=1)"))
Formula 9 simplified : !"((theProducts_0+theProducts_1)>=1)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.085236,19592,1,0,36,8000,91,22,1047,11112,194
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(G("((theProducts_0+theProducts_1)<=(theOptions_0+theOptions_1))")))U(G(G("((productSlots_0+productSlots_1)<=(optionSlots_0+optionSlots_1))")))))
Formula 10 simplified : !(FG"((theProducts_0+theProducts_1)<=(theOptions_0+theOptions_1))" U G"((productSlots_0+productSlots_1)<=(optionSlots_0+optionSlots_1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.111517,20664,1,0,77,12139,97,39,1076,17569,304
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((("((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)>=3)")U("((theOptions_0+theOptions_1)<=(productSlots_0+productSlots_1))")))
Formula 11 simplified : !("((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)>=3)" U "((theOptions_0+theOptions_1)<=(productSlots_0+productSlots_1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.112721,20924,1,0,77,12139,105,39,1092,17569,308
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("((productSlots_0+productSlots_1)<=(theOptions_0+theOptions_1))"))
Formula 12 simplified : !"((productSlots_0+productSlots_1)<=(theOptions_0+theOptions_1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.113062,21188,1,0,77,12139,108,39,1096,17569,310
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G(F(F(X("((optionSlots_0+optionSlots_1)>=2)"))))))
Formula 13 simplified : !GFX"((optionSlots_0+optionSlots_1)>=2)"
3 unique states visited
3 strongly connected components in search stack
4 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.11439,21188,1,0,79,12246,115,40,1096,17881,323
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G("((productSlots_0+productSlots_1)>=3)")))
Formula 14 simplified : !G"((productSlots_0+productSlots_1)>=3)"
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.114805,21188,1,0,79,12246,115,40,1096,17881,323
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((X("((optionSlots_0+optionSlots_1)>=3)"))U(F(X("((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)<=(theOptions_0+theOptions_1))")))))
Formula 15 simplified : !(X"((optionSlots_0+optionSlots_1)>=3)" U FX"((((((((ready_0+ready_1)+ready_2)+ready_3)+ready_4)+ready_5)+ready_6)+ready_7)<=(theOptions_0+theOptions_1))")
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was not deterministic with 42 transitions. Expanding to a total of 76 deterministic transitions.
Jun 03, 2018 1:33:58 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Determinization took 6 ms.
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.149617,21964,1,0,131,16542,115,58,1167,26122,421
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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="DrinkVendingMachine-COL-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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/DrinkVendingMachine-COL-02.tgz
mv DrinkVendingMachine-COL-02 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-structural"
echo " Input is DrinkVendingMachine-COL-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r239-blw3-152732478900091"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;