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 496K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K 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.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 325K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DLCround-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260500175
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527391000382


BK_STOP 1527391016595

--------------------
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 DLCround-PT-06a as instance name.
Using DLCround as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, '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': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 4532, 'Memory': 348.75, 'Tool': 'itstools'}, {'Time': 1870757, 'Memory': 15941.57, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 412.7883936451898x far from the best tool itstools.
LTLCardinality itstools DLCround-PT-06a...
May 27, 2018 3:16:50 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, LTLCardinality]
May 27, 2018 3:16:50 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
May 27, 2018 3:16:50 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 216 ms
May 27, 2018 3:16:50 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 197 places.
May 27, 2018 3:16:51 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 1313 transitions.
May 27, 2018 3:16:51 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 27, 2018 3:16:51 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 57 ms
May 27, 2018 3:16:51 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 27, 2018 3:16:51 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 27, 2018 3:16:51 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 422 ms
May 27, 2018 3:16:51 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 27, 2018 3:16:52 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 2062 redundant transitions.
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
May 27, 2018 3:16:52 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 14 ms
May 27, 2018 3:16:52 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLCardinality.ltl : 2 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(F("(u4.p22>=1)"))))
Formula 0 simplified : !F"(u4.p22>=1)"
built 197 ordering constraints for composite.
May 27, 2018 3:16:52 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 135 identical transitions.
May 27, 2018 3:16:53 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 1178 transitions.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
101 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.13239,28244,1,0,5551,609,4874,6896,391,867,21662
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(X(X("((u98.p185==0)||(u57.p144==1))"))))))
Formula 1 simplified : !XGXX"((u98.p185==0)||(u57.p144==1))"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 154
// Phase 1: matrix 154 rows 197 cols
invariant :u7:p49 + u7:p50 + u7:p51 + u7:p52 + u7:p53 + u7:p54 + u7:p55 + u7:p56 + u7:p57 + u7:p58 + u110:p0 = 1
invariant :u18:p105 + u110:p0 = 1
invariant :u86:p173 + u110:p0 = 1
invariant :u87:p174 + u110:p0 = 1
invariant :u17:p104 + u110:p0 = 1
invariant :u64:p151 + u110:p0 = 1
invariant :u105:p192 + u110:p0 = 1
invariant :u31:p118 + u110:p0 = 1
invariant :u108:p195 + u110:p0 = 1
invariant :u13:p100 + u110:p0 = 1
invariant :u45:p132 + u110:p0 = 1
invariant :u43:p130 + u110:p0 = 1
invariant :u102:p189 + u110:p0 = 1
invariant :u81:p168 + u110:p0 = 1
invariant :u24:p111 + u110:p0 = 1
invariant :u38:p125 + u110:p0 = 1
invariant :u25:p112 + u110:p0 = 1
invariant :u103:p190 + u110:p0 = 1
invariant :u77:p164 + u110:p0 = 1
invariant :u10:p79 + u10:p80 + u10:p81 + u10:p82 + u10:p83 + u10:p84 + u10:p85 + u10:p86 + u10:p87 + u10:p88 + u110:p0 = 1
invariant :u56:p143 + u110:p0 = 1
invariant :u76:p163 + u110:p0 = 1
invariant :u90:p177 + u110:p0 = 1
invariant :u2:p8 + u2:p9 + u2:p10 + u2:p11 + u2:p12 + u2:p13 + u2:p14 + u110:p0 = 1
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u110:p0 = 1
invariant :u66:p153 + u110:p0 = 1
invariant :u63:p150 + u110:p0 = 1
invariant :u100:p187 + u110:p0 = 1
invariant :u74:p161 + u110:p0 = 1
invariant :u92:p179 + u110:p0 = 1
invariant :u32:p119 + u110:p0 = 1
invariant :u26:p113 + u110:p0 = 1
invariant :u40:p127 + u110:p0 = 1
invariant :u36:p123 + u110:p0 = 1
invariant :u33:p120 + u110:p0 = 1
invariant :u88:p175 + u110:p0 = 1
invariant :u75:p162 + u110:p0 = 1
invariant :u52:p139 + u110:p0 = 1
invariant :u12:p99 + u110:p0 = 1
invariant :u30:p117 + u110:p0 = 1
invariant :u37:p124 + u110:p0 = 1
invariant :u44:p131 + u110:p0 = 1
invariant :u5:p29 + u5:p30 + u5:p31 + u5:p32 + u5:p33 + u5:p34 + u5:p35 + u5:p36 + u5:p37 + u5:p38 + u110:p0 = 1
invariant :u16:p103 + u110:p0 = 1
invariant :u19:p106 + u110:p0 = 1
invariant :u60:p147 + u110:p0 = 1
invariant :u69:p156 + u110:p0 = 1
invariant :u34:p121 + u110:p0 = 1
invariant :u41:p128 + u110:p0 = 1
invariant :u97:p184 + u110:p0 = 1
invariant :u35:p122 + u110:p0 = 1
invariant :u95:p182 + u110:p0 = 1
invariant :u101:p188 + u110:p0 = 1
invariant :u94:p181 + u110:p0 = 1
invariant :u80:p167 + u110:p0 = 1
invariant :u51:p138 + u110:p0 = 1
invariant :u15:p102 + u110:p0 = 1
invariant :u107:p194 + u110:p0 = 1
invariant :u27:p114 + u110:p0 = 1
invariant :u49:p136 + u110:p0 = 1
invariant :u14:p101 + u110:p0 = 1
invariant :u28:p115 + u110:p0 = 1
invariant :u58:p145 + u110:p0 = 1
invariant :u29:p116 + u110:p0 = 1
invariant :u46:p133 + u110:p0 = 1
invariant :u11:p89 + u11:p90 + u11:p91 + u11:p92 + u11:p93 + u11:p94 + u11:p95 + u11:p96 + u11:p97 + u11:p98 + u110:p0 = 1
invariant :u72:p159 + u110:p0 = 1
invariant :u67:p154 + u110:p0 = 1
invariant :u61:p148 + u110:p0 = 1
invariant :u62:p149 + u110:p0 = 1
invariant :u106:p193 + u110:p0 = 1
invariant :u47:p134 + u110:p0 = 1
invariant :u84:p171 + u110:p0 = 1
invariant :u54:p141 + u110:p0 = 1
invariant :u6:p39 + u6:p40 + u6:p41 + u6:p42 + u6:p43 + u6:p44 + u6:p45 + u6:p46 + u6:p47 + u6:p48 + u110:p0 = 1
invariant :u23:p110 + u110:p0 = 1
invariant :u57:p144 + u110:p0 = 1
invariant :u59:p146 + u110:p0 = 1
invariant :u96:p183 + u110:p0 = 1
invariant :u70:p157 + u110:p0 = 1
invariant :u93:p180 + u110:p0 = 1
invariant :u83:p170 + u110:p0 = 1
invariant :u3:p15 + u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 + u3:p21 + u110:p0 = 1
invariant :u104:p191 + u110:p0 = 1
invariant :u39:p126 + u110:p0 = 1
invariant :u20:p107 + u110:p0 = 1
invariant :u9:p69 + u9:p70 + u9:p71 + u9:p72 + u9:p73 + u9:p74 + u9:p75 + u9:p76 + u9:p77 + u9:p78 + u110:p0 = 1
invariant :u89:p176 + u110:p0 = 1
invariant :u109:p196 + u110:p0 = 1
invariant :u50:p137 + u110:p0 = 1
invariant :u4:p22 + u4:p23 + u4:p24 + u4:p25 + u4:p26 + u4:p27 + u4:p28 + u110:p0 = 1
invariant :u65:p152 + u110:p0 = 1
invariant :u55:p142 + u110:p0 = 1
invariant :u99:p186 + u110:p0 = 1
invariant :u21:p108 + u110:p0 = 1
invariant :u79:p166 + u110:p0 = 1
invariant :u68:p155 + u110:p0 = 1
invariant :u53:p140 + u110:p0 = 1
invariant :u98:p185 + u110:p0 = 1
invariant :u8:p59 + u8:p60 + u8:p61 + u8:p62 + u8:p63 + u8:p64 + u8:p65 + u8:p66 + u8:p67 + u8:p68 + u110:p0 = 1
invariant :u22:p109 + u110:p0 = 1
invariant :u82:p169 + u110:p0 = 1
invariant :u91:p178 + u110:p0 = 1
invariant :u48:p135 + u110:p0 = 1
invariant :u42:p129 + u110:p0 = 1
invariant :u71:p158 + u110:p0 = 1
invariant :u78:p165 + u110:p0 = 1
invariant :u85:p172 + u110:p0 = 1
invariant :u73:p160 + u110:p0 = 1
May 27, 2018 3:16:53 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 109 place invariants in 96 ms
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
17 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.29721,33228,1,0,11862,610,5099,14724,393,2222,31906
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F("((u35.p122==0)||(u63.p150==1))"))U(G(X("((u71.p158==0)||(u5.p35==1))")))))
Formula 2 simplified : !(F"((u35.p122==0)||(u63.p150==1))" U GX"((u71.p158==0)||(u5.p35==1))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
31 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.60876,39244,1,0,13742,612,5450,18102,394,2239,35601
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((("((u46.p133==0)||(u110.p0==1))")U(X("(u72.p159>=1)"))))
Formula 3 simplified : !("((u46.p133==0)||(u110.p0==1))" U X"(u72.p159>=1)")
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,1.61056,39244,1,0,13742,612,5464,18102,394,2239,35802
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((u7.p56==0)||(u107.p194==1))"))
Formula 4 simplified : !"((u7.p56==0)||(u107.p194==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,1.61156,39244,1,0,13742,612,5470,18102,395,2239,35875
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X(F(X("(u8.p63>=1)"))))))
Formula 5 simplified : !FXFX"(u8.p63>=1)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10 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.71066,42120,1,0,16489,705,5654,22140,396,3016,40432
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("((u7.p53==0)||(u83.p170==1))"))
Formula 6 simplified : !"((u7.p53==0)||(u83.p170==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,1.71204,42384,1,0,16489,705,5660,22140,397,3016,40505
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(("((u2.p14==0)||(u4.p27==1))")U("(u105.p192>=3)")))))
Formula 7 simplified : !XF("((u2.p14==0)||(u4.p27==1))" U "(u105.p192>=3)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.72619,42648,1,0,16601,705,5686,22296,399,3016,40749
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F("((u8.p62==0)||(u98.p185==1))")))
Formula 8 simplified : !F"((u8.p62==0)||(u98.p185==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,1.73495,42912,1,0,16601,705,5707,22296,399,3016,40818
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(F(("(u105.p192>=2)")U("((u19.p106==0)||(u11.p93==1))")))))
Formula 9 simplified : !F("(u105.p192>=2)" U "((u19.p106==0)||(u11.p93==1))")
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,1.74451,42912,1,0,16601,705,5733,22296,400,3016,40926
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X(X(G("(u8.p63>=3)"))))))
Formula 10 simplified : !FXXG"(u8.p63>=3)"
May 27, 2018 3:16:54 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 197 variables to be positive in 623 ms
May 27, 2018 3:16:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 1178 transitions.
May 27, 2018 3:16:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/1178 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 3:16:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 107 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 27, 2018 3:16:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 1178 transitions.
May 27, 2018 3:16:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
44 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.19184,63236,1,0,72953,781,5753,90370,402,4198,106544
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X("((u54.p141==0)||(u31.p118==1))"))))
Formula 11 simplified : !XX"((u54.p141==0)||(u31.p118==1))"
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,2.19344,63500,1,0,72953,781,5758,90370,402,4198,106695
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(u9.p71>=1)"))
Formula 12 simplified : !"(u9.p71>=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,2.19401,63500,1,0,72953,781,5763,90370,403,4198,106751
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X((G("(u5.p34>=1)"))U(X("((u6.p45==0)||(u24.p111==1))")))))
Formula 13 simplified : !X(G"(u5.p34>=1)" U X"((u6.p45==0)||(u24.p111==1))")
3 unique states visited
0 strongly connected components in search stack
2 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,2.19692,64100,1,0,72954,781,5773,90371,405,4201,107094
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((("((u11.p93==0)||(u95.p182==1))")U("((u94.p181==0)||(u1.p5==1))"))U(("(u2.p8>=3)")U("(u39.p126>=1)"))))
Formula 14 simplified : !(("((u11.p93==0)||(u95.p182==1))" U "((u94.p181==0)||(u1.p5==1))") U ("(u2.p8>=3)" U "(u39.p126>=1)"))
2 unique states visited
0 strongly connected components in search stack
1 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,2.21022,64744,1,0,72954,781,5835,90371,406,4201,107664
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(u11.p96>=1)"))
Formula 15 simplified : !"(u11.p96>=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,2.21071,64744,1,0,72954,781,5840,90371,407,4201,107696
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DLCround-PT-06a-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="DLCround-PT-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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/DLCround-PT-06a.tgz
mv DLCround-PT-06a 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 irma4mcc-full"
echo " Input is DLCround-PT-06a, 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 r210-smll-152732260500175"
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 '' LTLCardinality.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 ;