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 440K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 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 5.7K 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 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K 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 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 282K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is JoinFreeModules-PT-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r213-smll-152732264300338
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527949622299

Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph521758385812270175.txt, -o, /tmp/graph521758385812270175.bin, -w, /tmp/graph521758385812270175.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph521758385812270175.bin, -l, -1, -v, -w, /tmp/graph521758385812270175.weights, -q, 0, -e, 0.001], workingDir=null]
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(F(G(("(u19.p99>=3)")U("(u36.p185>=5)"))))))
Formula 0 simplified : !XFG("(u19.p99>=3)" U "(u36.p185>=5)")
built 1 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 401 rows 250 cols
invariant :u5:p26 + u5:p27 + u5:p28 + u5:p29 + u5:p30 = 53
invariant :u34:p171 + u34:p172 + u34:p173 + u34:p174 + u34:p175 = 53
invariant :u9:p46 + u9:p47 + u9:p48 + u9:p49 + u9:p50 = 53
invariant :u12:p61 + u12:p62 + u12:p63 + u12:p64 + u12:p65 = 53
invariant :u43:p216 + u43:p217 + u43:p218 + u43:p219 + u43:p220 = 53
invariant :u18:p91 + u18:p92 + u18:p93 + u18:p94 + u18:p95 = 53
invariant :u28:p141 + u28:p142 + u28:p143 + u28:p144 + u28:p145 = 53
invariant :u26:p131 + u26:p132 + u26:p133 + u26:p134 + u26:p135 = 53
invariant :u46:p231 + u46:p232 + u46:p233 + u46:p234 + u46:p235 = 53
invariant :u14:p71 + u14:p72 + u14:p73 + u14:p74 + u14:p75 = 53
invariant :u29:p146 + u29:p147 + u29:p148 + u29:p149 + u29:p150 = 53
invariant :u31:p156 + u31:p157 + u31:p158 + u31:p159 + u31:p160 = 53
invariant :u1:p6 + u1:p7 + u1:p8 + u1:p9 + u1:p10 = 53
invariant :u25:p126 + u25:p127 + u25:p128 + u25:p129 + u25:p130 = 53
invariant :u10:p51 + u10:p52 + u10:p53 + u10:p54 + u10:p55 = 53
invariant :u24:p121 + u24:p122 + u24:p123 + u24:p124 + u24:p125 = 53
invariant :u39:p196 + u39:p197 + u39:p198 + u39:p199 + u39:p200 = 53
invariant :u38:p191 + u38:p192 + u38:p193 + u38:p194 + u38:p195 = 53
invariant :u41:p206 + u41:p207 + u41:p208 + u41:p209 + u41:p210 = 53
invariant :u0:p1 + u0:p2 + u0:p3 + u0:p4 + u0:p5 = 53
invariant :u27:p136 + u27:p137 + u27:p138 + u27:p139 + u27:p140 = 53
invariant :u20:p101 + u20:p102 + u20:p103 + u20:p104 + u20:p105 = 53
invariant :u15:p76 + u15:p77 + u15:p78 + u15:p79 + u15:p80 = 53
invariant :u11:p56 + u11:p57 + u11:p58 + u11:p59 + u11:p60 = 53
invariant :u13:p66 + u13:p67 + u13:p68 + u13:p69 + u13:p70 = 53
invariant :u35:p176 + u35:p177 + u35:p178 + u35:p179 + u35:p180 = 53
invariant :u37:p186 + u37:p187 + u37:p188 + u37:p189 + u37:p190 = 53
invariant :u16:p81 + u16:p82 + u16:p83 + u16:p84 + u16:p85 = 53
invariant :u48:p241 + u48:p242 + u48:p243 + u48:p244 + u48:p245 = 53
invariant :u8:p41 + u8:p42 + u8:p43 + u8:p44 + u8:p45 = 53
invariant :u23:p116 + u23:p117 + u23:p118 + u23:p119 + u23:p120 = 53
invariant :u36:p181 + u36:p182 + u36:p183 + u36:p184 + u36:p185 = 53
invariant :u6:p31 + u6:p32 + u6:p33 + u6:p34 + u6:p35 = 53
invariant :u22:p111 + u22:p112 + u22:p113 + u22:p114 + u22:p115 = 53
invariant :u42:p211 + u42:p212 + u42:p213 + u42:p214 + u42:p215 = 53
invariant :u7:p36 + u7:p37 + u7:p38 + u7:p39 + u7:p40 = 53
invariant :u3:p16 + u3:p17 + u3:p18 + u3:p19 + u3:p20 = 53
invariant :u19:p96 + u19:p97 + u19:p98 + u19:p99 + u19:p100 = 53
invariant :u17:p86 + u17:p87 + u17:p88 + u17:p89 + u17:p90 = 53
invariant :u45:p226 + u45:p227 + u45:p228 + u45:p229 + u45:p230 = 53
invariant :u30:p151 + u30:p152 + u30:p153 + u30:p154 + u30:p155 = 53
invariant :u40:p201 + u40:p202 + u40:p203 + u40:p204 + u40:p205 = 53
invariant :u49:p246 + u49:p247 + u49:p248 + u49:p249 + u49:p250 = 53
invariant :u2:p11 + u2:p12 + u2:p13 + u2:p14 + u2:p15 = 53
invariant :u33:p166 + u33:p167 + u33:p168 + u33:p169 + u33:p170 = 53
invariant :u47:p236 + u47:p237 + u47:p238 + u47:p239 + u47:p240 = 53
invariant :u21:p106 + u21:p107 + u21:p108 + u21:p109 + u21:p110 = 53
invariant :u44:p221 + u44:p222 + u44:p223 + u44:p224 + u44:p225 = 53
invariant :u4:p21 + u4:p22 + u4:p23 + u4:p24 + u4:p25 = 53
invariant :u32:p161 + u32:p162 + u32:p163 + u32:p164 + u32:p165 = 53
Reverse transition relation is NOT exact ! Due to transitions u0.t1, u0.t2, u0.t3, u0.t4, u0.t8, u1.t9, u1.t10, u1.t11, u1.t12, u1.t16, u2.t17, u2.t18, u2.t19, u2.t20, u2.t24, u3.t25, u3.t26, u3.t27, u3.t28, u3.t32, u4.t33, u4.t34, u4.t35, u4.t36, u4.t40, u5.t41, u5.t42, u5.t43, u5.t44, u5.t48, u6.t49, u6.t50, u6.t51, u6.t52, u6.t56, u7.t57, u7.t58, u7.t59, u7.t60, u7.t64, u8.t65, u8.t66, u8.t67, u8.t68, u8.t72, u9.t73, u9.t74, u9.t75, u9.t76, u9.t80, u10.t81, u10.t82, u10.t83, u10.t84, u10.t88, u11.t89, u11.t90, u11.t91, u11.t92, u11.t96, u12.t97, u12.t98, u12.t99, u12.t100, u12.t104, u13.t105, u13.t106, u13.t107, u13.t108, u13.t112, u14.t113, u14.t114, u14.t115, u14.t116, u14.t120, u15.t121, u15.t122, u15.t123, u15.t124, u15.t128, u16.t129, u16.t130, u16.t131, u16.t132, u16.t136, u17.t137, u17.t138, u17.t139, u17.t140, u17.t144, u18.t145, u18.t146, u18.t147, u18.t148, u18.t152, u19.t153, u19.t154, u19.t155, u19.t156, u19.t160, u20.t161, u20.t162, u20.t163, u20.t164, u20.t168, u21.t169, u21.t170, u21.t171, u21.t172, u21.t176, u22.t177, u22.t178, u22.t179, u22.t180, u22.t184, u23.t185, u23.t186, u23.t187, u23.t188, u23.t192, u24.t193, u24.t194, u24.t195, u24.t196, u24.t200, u25.t201, u25.t202, u25.t203, u25.t204, u25.t208, u26.t209, u26.t210, u26.t211, u26.t212, u26.t216, u27.t217, u27.t218, u27.t219, u27.t220, u27.t224, u28.t225, u28.t226, u28.t227, u28.t228, u28.t232, u29.t233, u29.t234, u29.t235, u29.t236, u29.t240, u30.t241, u30.t242, u30.t243, u30.t244, u30.t248, u31.t249, u31.t250, u31.t251, u31.t252, u31.t256, u32.t257, u32.t258, u32.t259, u32.t260, u32.t264, u33.t265, u33.t266, u33.t267, u33.t268, u33.t272, u34.t273, u34.t274, u34.t275, u34.t276, u34.t280, u35.t281, u35.t282, u35.t283, u35.t284, u35.t288, u36.t289, u36.t290, u36.t291, u36.t292, u36.t296, u37.t297, u37.t298, u37.t299, u37.t300, u37.t304, u38.t305, u38.t306, u38.t307, u38.t308, u38.t312, u39.t313, u39.t314, u39.t315, u39.t316, u39.t320, u40.t321, u40.t322, u40.t323, u40.t324, u40.t328, u41.t329, u41.t330, u41.t331, u41.t332, u41.t336, u42.t337, u42.t338, u42.t339, u42.t340, u42.t344, u43.t345, u43.t346, u43.t347, u43.t348, u43.t352, u44.t353, u44.t354, u44.t355, u44.t356, u44.t360, u45.t361, u45.t362, u45.t363, u45.t364, u45.t368, u46.t369, u46.t370, u46.t371, u46.t372, u46.t376, u47.t377, u47.t378, u47.t379, u47.t380, u47.t384, u48.t385, u48.t386, u48.t387, u48.t388, u48.t392, u49.t393, u49.t394, u49.t395, u49.t396, u49.t400, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/151/250/401
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
129 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.34284,35632,1,0,26099,50691,2064,11600,824,61171,24735
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X("(u27.p139>=4)")))
Formula 1 simplified : !X"(u27.p139>=4)"
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,1.34465,36016,1,0,26099,50691,2071,11602,825,61171,24829
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X("(u4.p21>=5)")))
Formula 2 simplified : !X"(u4.p21>=5)"
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,1.34522,36272,1,0,26099,50691,2076,11603,826,61171,24923
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(("(u2.p11>=5)"))
Formula 3 simplified : !"(u2.p11>=5)"
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,1.34576,36272,1,0,26100,50691,2079,11603,826,61171,24975
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(("(u38.p194>=4)")U("(u41.p206>=5)")))U("(u37.p186>=3)")))
Formula 4 simplified : !(F("(u38.p194>=4)" U "(u41.p206>=5)") U "(u37.p186>=3)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
510 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.4331,120160,1,0,34795,425102,2146,17247,827,490334,35255
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G((G("(u26.p134>=4)"))U(X("(u29.p148>=1)"))))))
Formula 5 simplified : !G(G"(u26.p134>=4)" U X"(u29.p148>=1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
30 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.74187,126412,1,0,35025,448926,2155,17368,828,510977,35826
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F(("(u37.p188>=2)")U(X("(u35.p180>=5)"))))))
Formula 6 simplified : !GF("(u37.p188>=2)" U X"(u35.p180>=5)")
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,6.7462,126672,1,0,35103,448932,2198,17509,828,511020,36020
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((G(F("(u37.p189>=3)")))U(("(u46.p231>=3)")U("(u20.p105>=5)")))))
Formula 7 simplified : !X(GF"(u37.p189>=3)" U ("(u46.p231>=3)" U "(u20.p105>=5)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
177 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.51155,158336,1,0,60997,543327,2279,34728,828,641136,62898
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(("(u38.p191>=5)"))
Formula 8 simplified : !"(u38.p191>=5)"
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,8.51212,158336,1,0,60997,543327,2282,34728,828,641136,62911
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(G((G("(u12.p64>=4)"))U("(u13.p69>=3)")))))
Formula 9 simplified : !FG(G"(u12.p64>=4)" U "(u13.p69>=3)")
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,8.52411,158728,1,0,61318,543395,2378,34958,828,641764,63860
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("(u32.p164>=3)")U((G("(u6.p31>=3)"))U(X("(u40.p201>=5)")))))
Formula 10 simplified : !("(u32.p164>=3)" U (G"(u6.p31>=3)" U X"(u40.p201>=5)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.5274,159264,1,0,61318,543395,2394,34959,828,641764,63993
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X("(u41.p206>=3)")))
Formula 11 simplified : !X"(u41.p206>=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,8.52778,159264,1,0,61318,543395,2397,34959,828,641764,64011
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((G("(u6.p32>=2)"))U("(u37.p189>=4)")))
Formula 12 simplified : !(G"(u6.p32>=2)" U "(u37.p189>=4)")
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,8.52882,159264,1,0,61318,543395,2410,34959,829,641764,64106
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((G(X(F("(u36.p183>=2)"))))U(X(X(G("(u23.p118>=2)"))))))
Formula 13 simplified : !(GXF"(u36.p183>=2)" U XXG"(u23.p118>=2)")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
1000 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,18.5314,300296,1,0,67482,1.14985e+06,2517,39907,830,1.34785e+06,75832
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(X((X("(u22.p113>=2)"))U(G("(u28.p141>=5)"))))))
Formula 14 simplified : !GX(X"(u22.p113>=2)" U G"(u28.p141>=5)")
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
38 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,18.9183,305300,1,0,67640,1.16709e+06,2571,40055,830,1.36908e+06,76310
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(("(u20.p103>=1)"))
Formula 15 simplified : !"(u20.p103>=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,18.9191,305300,1,0,67640,1.16709e+06,2574,40055,830,1.36908e+06,76342
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA JoinFreeModules-PT-0050-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527949647365

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 134 ms
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 251 places.
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 401 transitions.
Jun 02, 2018 2:27:04 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 26 ms
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 1 fixed domain variables (out of 251 variables) in GAL type JoinFreeModules_PT_0050
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 1 constant array cells/variables (out of 251 variables) in type JoinFreeModules_PT_0050
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: p,
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 1 constant variables :p=1
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 1 expressions due to constant valuations.
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 122 ms
Jun 02, 2018 2:27:04 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 62 ms
Begin: Sat Jun 2 14:27:05 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sat Jun 2 14:27:05 2018
network size: 250 nodes, 800 links, 800 weight
quality increased from -0.00408854 to 0.98
end computation: Sat Jun 2 14:27:05 2018
level 1:
start computation: Sat Jun 2 14:27:05 2018
network size: 50 nodes, 50 links, 800 weight
quality increased from 0.98 to 0.98
end computation: Sat Jun 2 14:27:05 2018
End: Sat Jun 2 14:27:05 2018
Total duration: 0 sec
0.98
Jun 02, 2018 2:27:05 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 2:27:05 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 52 ms
Jun 02, 2018 2:27:05 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 2:27:05 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 5 ms
Jun 02, 2018 2:27:05 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 ms
Jun 02, 2018 2:27:05 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 401 transitions.
Jun 02, 2018 2:27:06 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 50 place invariants in 163 ms
Jun 02, 2018 2:27:06 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 250 variables to be positive in 903 ms
Jun 02, 2018 2:27:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 401 transitions.
Jun 02, 2018 2:27:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/401 took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 2:27:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 2:27:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 401 transitions.
Jun 02, 2018 2:27:06 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Jun 02, 2018 2:27:07 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 401 transitions.
Jun 02, 2018 2:27:11 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/401) took 4345 ms. Total solver calls (SAT/UNSAT): 400(250/150)
Jun 02, 2018 2:27:15 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(229/401) took 7362 ms. Total solver calls (SAT/UNSAT): 1209(1059/150)
Jun 02, 2018 2:27:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 9480 ms. Total solver calls (SAT/UNSAT): 1800(1650/150)
Jun 02, 2018 2:27:17 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 401 transitions.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Failed to check-sat")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:628)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 02, 2018 2:27:26 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 20781ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsl"
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/JoinFreeModules-PT-0050.tgz
mv JoinFreeModules-PT-0050 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 itstoolsl"
echo " Input is JoinFreeModules-PT-0050, 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 r213-smll-152732264300338"
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 ;