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 168K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.8K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Referendum-COL-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r190-qhx2-152732141900102
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528361794582


BK_STOP 1528361860090

--------------------
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 Referendum-COL-0020 as instance name.
Using Referendum 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': True, 'Extended Free Choice': True, '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': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 176, 'Memory': 107.43, 'Tool': 'lola'}, {'Time': 806396, 'Memory': 1238.84, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 4581.795454545455x far from the best tool lola.
LTLFireability itstools Referendum-COL-0020...
Jun 07, 2018 8:56:53 AM 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]
Jun 07, 2018 8:56:53 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 07, 2018 8:56:54 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
08:57:35.128 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
08:57:35.135 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Jun 07, 2018 8:57:35 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 42077 ms
Jun 07, 2018 8:57:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 4 places.
Jun 07, 2018 8:57:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
Jun 07, 2018 8:57:35 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Dot->ready,
Voters->voted_no,voted_yes,voting,

Jun 07, 2018 8:57:36 AM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 3 transitions.
Jun 07, 2018 8:57:36 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
Jun 07, 2018 8:57:36 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 33 ms
Jun 07, 2018 8:57:36 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 07, 2018 8:57:36 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 07, 2018 8:57:36 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 69 ms
Jun 07, 2018 8:57:36 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays voted_no, voted_yes, voting to variables to allow decomposition.
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
Jun 07, 2018 8:57:36 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLFireability.pnml.gal : 28 ms
Jun 07, 2018 8:57:36 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLFireability.ltl : 33 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/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 : !((F(F(G(F(G("(ready.ready_0>=1)")))))))
Formula 0 simplified : !FGFG"(ready.ready_0>=1)"
built 1 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 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.271198,17328,1,0,1471,59,343,2007,55,41,2545
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(F(G(X(G("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")))))))
Formula 1 simplified : !FGXG"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
23 unique states visited
22 strongly connected components in search stack
24 transitions explored
23 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.292906,17792,1,0,1642,59,387,2333,55,44,3403
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(G(X(F(X("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")))))))
Formula 2 simplified : !GXFX"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
25 unique states visited
25 strongly connected components in search stack
26 transitions explored
25 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.297766,17792,1,0,1643,59,393,2338,55,44,3416
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")))
Formula 3 simplified : !G"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.303481,17792,1,0,1643,59,398,2338,55,44,3484
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"))
Formula 4 simplified : !"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.305203,17792,1,0,1643,59,398,2338,55,44,3484
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(G(G("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"))))U(G(("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")U("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")))))
Formula 5 simplified : !(XG"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))" U G"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.316049,18032,1,0,1850,59,398,2570,55,44,4286
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(F(G(G("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")))))))
Formula 6 simplified : !GFG"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.328705,18032,1,0,2383,59,405,3296,55,44,5685
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F("(ready.ready_0>=1)")))
Formula 7 simplified : !F"(ready.ready_0>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.330642,18032,1,0,2383,59,416,3296,55,44,5692
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X("(ready.ready_0>=1)")))
Formula 8 simplified : !X"(ready.ready_0>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.336321,18288,1,0,2383,59,416,3296,55,44,5735
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F(X("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")))))
Formula 9 simplified : !XFX"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.3397,18288,1,0,2383,59,416,3314,55,44,5797
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X("(ready.ready_0>=1)")))
Formula 10 simplified : !X"(ready.ready_0>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.340734,18288,1,0,2383,59,416,3314,55,44,5797
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((X(X("(ready.ready_0>=1)")))U(F(X("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"))))))
Formula 11 simplified : !X(XX"(ready.ready_0>=1)" U FX"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")
Computing Next relation with stutter on 1.04858e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.345452,18288,1,0,2383,59,416,3314,55,44,5797
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X(F("(ready.ready_0>=1)"))))
Formula 12 simplified : !XF"(ready.ready_0>=1)"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.347118,18288,1,0,2383,59,416,3315,55,44,5812
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"))
Formula 13 simplified : !"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
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.349453,18288,1,0,2383,59,416,3315,55,44,5812
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))")))
Formula 14 simplified : !X"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 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.35138,18288,1,0,2383,59,416,3315,55,44,5815
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !((F(G(X(X("((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"))))))
Formula 15 simplified : !FGXX"((((((((((((((((((((Voters0.voting_0>=1)||(Voters1.voting_1>=1))||(Voters2.voting_2>=1))||(Voters3.voting_3>=1))||(Voters4.voting_4>=1))||(Voters5.voting_5>=1))||(Voters6.voting_6>=1))||(Voters7.voting_7>=1))||(Voters8.voting_8>=1))||(Voters9.voting_9>=1))||(Voters10.voting_10>=1))||(Voters11.voting_11>=1))||(Voters12.voting_12>=1))||(Voters13.voting_13>=1))||(Voters14.voting_14>=1))||(Voters15.voting_15>=1))||(Voters16.voting_16>=1))||(Voters17.voting_17>=1))||(Voters18.voting_18>=1))||(Voters19.voting_19>=1))"
Computing Next relation with stutter on 1.04858e+06 deadlock states
24 unique states visited
24 strongly connected components in search stack
25 transitions explored
24 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.356116,18464,1,0,2383,59,416,3315,55,44,5815
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Referendum-COL-0020-LTLFireability-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="Referendum-COL-0020"
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/Referendum-COL-0020.tgz
mv Referendum-COL-0020 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 Referendum-COL-0020, 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 r190-qhx2-152732141900102"
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 ;