fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r180-csrt-149580964200204
Last Updated
June 27, 2017

About the Execution of ITS-Tools for DLCround-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
325.720 3683.00 7784.00 126.60 FFFFFFTFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is DLCround-PT-03a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-csrt-149580964200204
=====================================================================


--------------------
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-03a-LTLFireability-0
FORMULA_NAME DLCround-PT-03a-LTLFireability-1
FORMULA_NAME DLCround-PT-03a-LTLFireability-10
FORMULA_NAME DLCround-PT-03a-LTLFireability-11
FORMULA_NAME DLCround-PT-03a-LTLFireability-12
FORMULA_NAME DLCround-PT-03a-LTLFireability-13
FORMULA_NAME DLCround-PT-03a-LTLFireability-14
FORMULA_NAME DLCround-PT-03a-LTLFireability-15
FORMULA_NAME DLCround-PT-03a-LTLFireability-2
FORMULA_NAME DLCround-PT-03a-LTLFireability-3
FORMULA_NAME DLCround-PT-03a-LTLFireability-4
FORMULA_NAME DLCround-PT-03a-LTLFireability-5
FORMULA_NAME DLCround-PT-03a-LTLFireability-6
FORMULA_NAME DLCround-PT-03a-LTLFireability-7
FORMULA_NAME DLCround-PT-03a-LTLFireability-8
FORMULA_NAME DLCround-PT-03a-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496565030499


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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 : !(((("u4.p25>=1")&&("u39.p99>=1"))U(F((("u38.p98>=1")&&("u3.p21>=1"))U(("u4.p25>=1")&&("u39.p99>=1"))))))
Formula 0 simplified : !(("u4.p25>=1" & "u39.p99>=1") U F(("u3.p21>=1" & "u38.p98>=1") U ("u4.p25>=1" & "u39.p99>=1")))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
14 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.178372,26080,1,0,1725,429,2326,1869,373,816,6443
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((F(G(("u18.p78>=1")&&("u6.p45>=1"))))U(G(F(("u4.p23>=1")&&("u15.p75>=1")))))))
Formula 1 simplified : !F(FG("u6.p45>=1" & "u18.p78>=1") U GF("u4.p23>=1" & "u15.p75>=1"))
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 617 rows 113 cols
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.23722,28680,1,0,2510,446,2511,3031,374,880,8135
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((("u6.p41>=1")&&("u20.p80>=1"))U(G(("u5.p37>=1")&&("u41.p101>=1")))))
Formula 2 simplified : !(("u6.p41>=1" & "u20.p80>=1") U G("u5.p37>=1" & "u41.p101>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.243717,29584,1,0,2510,446,2584,3031,376,880,8332
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(X(G(X(F(("u5.p37>=1")&&("u9.p69>=1"))))))))
Formula 3 simplified : !FXGXF("u5.p37>=1" & "u9.p69>=1")
4 unique states visited
4 strongly connected components in search stack
5 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.263896,29964,1,0,2936,456,2723,3845,376,975,9342
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("u7.p57>=1")&&("u30.p90>=1")))
Formula 4 simplified : !("u7.p57>=1" & "u30.p90>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.264791,30212,1,0,2936,456,2731,3845,376,975,9367
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(G(G(F(G(("u7.p57>=1")&&("u52.p112>=1"))))))))
Formula 5 simplified : !GFG("u7.p57>=1" & "u52.p112>=1")
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u32:p92= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u52:p112= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u18:p78= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u21:p81= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u6:p39 + 1'u6:p40 + 1'u6:p41 + 1'u6:p42 + 1'u6:p43 + 1'u6:p44 + 1'u6:p45 + 1'u6:p46 + 1'u6:p47 + 1'u6:p48= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u42:p102= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u22:p82= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u25:p85= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u4:p22 + 1'u4:p23 + 1'u4:p24 + 1'u4:p25 + 1'u4:p26 + 1'u4:p27 + 1'u4:p28= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u45:p105= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u46:p106= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u15:p75= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u51:p111= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u20:p80= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u7:p49 + 1'u7:p50 + 1'u7:p51 + 1'u7:p52 + 1'u7:p53 + 1'u7:p54 + 1'u7:p55 + 1'u7:p56 + 1'u7:p57 + 1'u7:p58= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u26:p86= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u29:p89= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u36:p96= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u37:p97= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u23:p83= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u17:p77= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u47:p107= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u43:p103= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u30:p90= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u50:p110= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u9:p69= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u13:p73= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u8:p59 + 1'u8:p60 + 1'u8:p61 + 1'u8:p62 + 1'u8:p63 + 1'u8:p64 + 1'u8:p65 + 1'u8:p66 + 1'u8:p67 + 1'u8:p68= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u39:p99= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u33:p93= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u19:p79= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u48:p108= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u27:p87= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u10:p70= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u24:p84= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u49:p109= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u12:p72= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u41:p101= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u11:p71= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u34:p94= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u40:p100= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u14:p74= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u28:p88= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u2:p8 + 1'u2:p9 + 1'u2:p10 + 1'u2:p11 + 1'u2:p12 + 1'u2:p13 + 1'u2:p14= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u3:p15 + 1'u3:p16 + 1'u3:p17 + 1'u3:p18 + 1'u3:p19 + 1'u3:p20 + 1'u3:p21= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u5:p29 + 1'u5:p30 + 1'u5:p31 + 1'u5:p32 + 1'u5:p33 + 1'u5:p34 + 1'u5:p35 + 1'u5:p36 + 1'u5:p37 + 1'u5:p38= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u31:p91= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u16:p76= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u38:p98= 0
invariant : 1'u1:p1 + 1'u1:p2 + 1'u1:p3 + 1'u1:p4 + 1'u1:p5 + 1'u1:p6 + 1'u1:p7 + 1'u53:p0= 1
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u44:p104= 0
invariant : -1'u1:p1 + -1'u1:p2 + -1'u1:p3 + -1'u1:p4 + -1'u1:p5 + -1'u1:p6 + -1'u1:p7 + 1'u35:p95= 0
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
11 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.378105,36372,1,0,19207,801,2758,25308,376,4794,30098
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X(("u2.p14>=1")&&("u28.p88>=1")))U(F(G(F(("u2.p14>=1")&&("u12.p72>=1")))))))
Formula 6 simplified : !(X("u2.p14>=1" & "u28.p88>=1") U FGF("u2.p14>=1" & "u12.p72>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.410763,37576,1,0,19773,801,2866,26330,376,4846,31255
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(F(G(("u6.p47>=1")&&("u20.p80>=1")))))))
Formula 7 simplified : !GXFG("u6.p47>=1" & "u20.p80>=1")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.434138,38440,1,0,20436,801,2986,27339,376,4873,32587
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(X(G(X(("u8.p66>=1")&&("u34.p94>=1"))))))))
Formula 8 simplified : !GXXGX("u8.p66>=1" & "u34.p94>=1")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.455974,39228,1,0,21419,871,3064,28811,377,5380,34294
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F((X(X(("u3.p18>=1")&&("u37.p97>=1"))))U(X(G(("u3.p21>=1")&&("u14.p74>=1")))))))
Formula 9 simplified : !F(XX("u3.p18>=1" & "u37.p97>=1") U XG("u3.p21>=1" & "u14.p74>=1"))
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,0.486906,40252,1,0,22880,871,3176,30952,377,5384,37183
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((("u4.p25>=1")&&("u15.p75>=1")))
Formula 10 simplified : !("u4.p25>=1" & "u15.p75>=1")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.487922,40252,1,0,22880,871,3182,30952,377,5384,37223
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((F(("u8.p61>=1")&&("u50.p110>=1"))))
Formula 11 simplified : !F("u8.p61>=1" & "u50.p110>=1")
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.502089,40776,1,0,23236,905,3226,31413,377,5712,38154
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((X("u4.p26>=1")))
Formula 12 simplified : !X"u4.p26>=1"
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.502799,40844,1,0,23238,905,3229,31413,377,5712,38237
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(((X(G(F(("u5.p33>=1")&&("u12.p72>=1")))))U(("u7.p54>=1")&&("u28.p88>=1"))))
Formula 13 simplified : !(XGF("u5.p33>=1" & "u12.p72>=1") U ("u7.p54>=1" & "u28.p88>=1"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.526116,41244,1,0,23747,909,3303,32172,378,5798,39558
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(("u3.p21>=1")&&("u22.p82>=1"))))
Formula 14 simplified : !X("u3.p21>=1" & "u22.p82>=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,0.527212,41700,1,0,23747,909,3308,32172,378,5798,39607
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((G((("u5.p37>=1")&&("u42.p102>=1"))U(("u6.p44>=1")&&("u20.p80>=1"))))U(("u5.p29>=1")&&("u41.p101>=1"))))
Formula 15 simplified : !(G(("u5.p37>=1" & "u42.p102>=1") U ("u6.p44>=1" & "u20.p80>=1")) U ("u5.p29>=1" & "u41.p101>=1"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.534983,42908,1,0,23747,909,3363,32172,378,5798,39795
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA DLCround-PT-03a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exit code :0

BK_STOP 1496565034182

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 111 ms
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 113 places.
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 617 transitions.
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 101 ms
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 04, 2017 8:30:32 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 868 redundant transitions.
Jun 04, 2017 8:30:32 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 25 ms
Jun 04, 2017 8:30:32 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 04, 2017 8:30:33 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 52 place invariants in 52 ms
Jun 04, 2017 8:30:33 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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]
built 89 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-03a.tgz
mv DLCround-PT-03a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is DLCround-PT-03a, 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 r180-csrt-149580964200204"
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 ;