Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902546300514.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546300514
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 3.2K Mar 30 19:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 19:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 29 09:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 29 09:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 04:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 04:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 398K Mar 24 05:37 model.pnml

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

=== Now, execution of the tool begins

BK_START 1589610510481

[2020-05-16 06:28:33] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-16 06:28:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 06:28:34] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2020-05-16 06:28:34] [INFO ] Transformed 229 places.
[2020-05-16 06:28:34] [INFO ] Transformed 1597 transitions.
[2020-05-16 06:28:34] [INFO ] Found NUPN structural information;
[2020-05-16 06:28:34] [INFO ] Parsed PT model containing 229 places and 1597 transitions in 349 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 66 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1081 ms. (steps per millisecond=92 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-16 06:28:35] [INFO ] Flow matrix only has 170 transitions (discarded 1267 similar events)
// Phase 1: matrix 170 rows 229 cols
[2020-05-16 06:28:35] [INFO ] Computed 132 place invariants in 18 ms
[2020-05-16 06:28:35] [INFO ] [Real]Absence check using 132 positive place invariants in 120 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-16 06:28:36] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-16 06:28:36] [INFO ] Flatten gal took : 244 ms
FORMULA DLCround-PT-07a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-07a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 06:28:36] [INFO ] Flatten gal took : 124 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 06:28:36] [INFO ] Applying decomposition
[2020-05-16 06:28:37] [INFO ] Flatten gal took : 117 ms
[2020-05-16 06:28:37] [INFO ] Input system was already deterministic with 1437 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph8015101079427418016.txt, -o, /tmp/graph8015101079427418016.bin, -w, /tmp/graph8015101079427418016.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8015101079427418016.bin, -l, -1, -v, -w, /tmp/graph8015101079427418016.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 06:28:37] [INFO ] Decomposing Gal with order
[2020-05-16 06:28:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 06:28:37] [INFO ] Removed a total of 1236 redundant transitions.
[2020-05-16 06:28:37] [INFO ] Flatten gal took : 290 ms
[2020-05-16 06:28:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 32 ms.
[2020-05-16 06:28:38] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 33 ms
[2020-05-16 06:28:38] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 11 LTL properties
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 170 out of 1437 initially.
// Phase 1: matrix 170 rows 229 cols
[2020-05-16 06:28:38] [INFO ] Computed 132 place invariants in 10 ms
inv : p0 + p151 = 1
inv : p0 + p216 = 1
inv : p0 + p159 = 1
inv : p0 + p208 = 1
inv : p0 + p135 = 1
inv : p0 + p200 = 1
inv : p0 + p143 = 1
inv : p0 + p192 = 1
inv : p0 + p119 = 1
inv : p0 + p184 = 1
inv : p0 + p176 = 1
inv : p0 + p127 = 1
inv : p0 + p160 = 1
inv : p0 + p111 = 1
inv : p0 + p225 = 1
inv : p0 + p168 = 1
inv : p0 + p150 = 1
inv : p0 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p223 = 1
inv : p0 + p158 = 1
inv : p0 + p215 = 1
inv : p0 + p134 = 1
inv : p0 + p207 = 1
inv : p0 + p142 = 1
inv : p0 + p199 = 1
inv : p0 + p183 = 1
inv : p0 + p118 = 1
inv : p0 + p191 = 1
inv : p0 + p126 = 1
inv : p0 + p167 = 1
inv : p0 + p110 = 1
inv : p0 + p175 = 1
inv : p0 + p224 = 1
inv : p0 + p218 = 1
inv : p0 + p145 = 1
inv : p0 + p210 = 1
inv : p0 + p153 = 1
inv : p0 + p15 + p16 + p17 + p18 + p19 + p20 + p21 = 1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p202 = 1
inv : p0 + p129 = 1
inv : p0 + p194 = 1
inv : p0 + p137 = 1
inv : p0 + p186 = 1
inv : p0 + p178 = 1
inv : p0 + p113 = 1
inv : p0 + p121 = 1
inv : p0 + p162 = 1
inv : p0 + p227 = 1
inv : p0 + p170 = 1
inv : p0 + p217 = 1
inv : p0 + p144 = 1
inv : p0 + p209 = 1
inv : p0 + p152 = 1
inv : p0 + p201 = 1
inv : p0 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 = 1
inv : p0 + p128 = 1
inv : p0 + p193 = 1
inv : p0 + p136 = 1
inv : p0 + p185 = 1
inv : p0 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 = 1
inv : p0 + p112 = 1
inv : p0 + p177 = 1
inv : p0 + p120 = 1
inv : p0 + p161 = 1
inv : p0 + p226 = 1
inv : p0 + p169 = 1
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 = 1
inv : p0 + p147 = 1
inv : p0 + p220 = 1
inv : p0 + p155 = 1
inv : p0 + p212 = 1
inv : p0 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 = 1
inv : p0 + p131 = 1
inv : p0 + p204 = 1
inv : p0 + p139 = 1
inv : p0 + p196 = 1
inv : p0 + p180 = 1
inv : p0 + p115 = 1
inv : p0 + p188 = 1
inv : p0 + p123 = 1
inv : p0 + p164 = 1
inv : p0 + p172 = 1
inv : p0 + p219 = 1
inv : p0 + p146 = 1
inv : p0 + p211 = 1
inv : p0 + p154 = 1
inv : p0 + p203 = 1
inv : p0 + p130 = 1
inv : p0 + p195 = 1
inv : p0 + p138 = 1
inv : p0 + p187 = 1
inv : p0 + p114 = 1
inv : p0 + p179 = 1
inv : p0 + p122 = 1
inv : p0 + p163 = 1
inv : p0 + p171 = 1
inv : p0 + p228 = 1
inv : p0 + p149 = 1
inv : p0 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 = 1
inv : p0 + p222 = 1
inv : p0 + p157 = 1
inv : p0 + p214 = 1
inv : p0 + p133 = 1
inv : p0 + p206 = 1
inv : p0 + p141 = 1
inv : p0 + p198 = 1
inv : p0 + p182 = 1
inv : p0 + p117 = 1
inv : p0 + p190 = 1
inv : p0 + p125 = 1
inv : p0 + p166 = 1
inv : p0 + p174 = 1
inv : p0 + p109 = 1
inv : p0 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p148 = 1
inv : p0 + p221 = 1
inv : p0 + p156 = 1
inv : p0 + p213 = 1
inv : p0 + p132 = 1
inv : p0 + p205 = 1
inv : p0 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 = 1
inv : p0 + p140 = 1
inv : p0 + p197 = 1
inv : p0 + p181 = 1
inv : p0 + p116 = 1
inv : p0 + p189 = 1
inv : p0 + p124 = 1
inv : p0 + p165 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p173 = 1
Total of 132 invariants.
[2020-05-16 06:28:38] [INFO ] Computed 132 place invariants in 18 ms
Checking formula 0 : !((!(F(((G("((u0.p7==1)&&(i6.u10.p126==1))"))&&("(i6.u10.p57==1)"))&&("(i7.u12.p196==1)")))))
Formula 0 simplified : F("(i6.u10.p57==1)" & "(i7.u12.p196==1)" & G"((u0.p7==1)&&(i6.u10.p126==1))")
built 61 ordering constraints for composite.
built 23 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 23 ordering constraints for composite.
built 18 ordering constraints for composite.
built 23 ordering constraints for composite.
built 23 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
19 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.312257,23008,1,0,1388,2915,2217,1831,1911,4912,5368
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-07a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G(F(((F("((i7.u12.p67==1)&&(i10.u20.p218==1))"))&&("(u1.p14==1)"))&&("(i10.u20.p160==1)"))))||((X("((u1.p14!=1)||(i11.u23.p168!=1))"))U(G("((u1.p14==1)&&(i10.u20.p160==1))")))))
Formula 1 simplified : !(GF("(i10.u20.p160==1)" & "(u1.p14==1)" & F"((i7.u12.p67==1)&&(i10.u20.p218==1))") | (X"((u1.p14!=1)||(i11.u23.p168!=1))" U G"((u1.p14==1)&&(i10.u20.p160==1))"))
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.354164,24900,1,0,2317,3040,2423,3164,1919,5500,7884
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-07a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((F(G(!(X("((i10.u18.p93!=1)||(i10.u20.p219!=1))")))))||(("((i10.u18.p93==1)&&(i10.u20.p219==1))")U(G("((i10.u20.p97!=1)||(i11.u23.p228!=1))")))))
Formula 2 simplified : !(FG!X"((i10.u18.p93!=1)||(i10.u20.p219!=1))" | ("((i10.u18.p93==1)&&(i10.u20.p219==1))" U G"((i10.u20.p97!=1)||(i11.u23.p228!=1))"))
6 unique states visited
4 strongly connected components in search stack
8 transitions explored
6 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.384993,24900,1,0,3348,3354,2491,4586,1925,6746,11108
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DLCround-PT-07a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(G(X((G(X("((i6.u10.p51==1)&&(i6.u10.p190==1))")))&&(!(X("((i9.u17.p81==1)&&(i9.u17.p211==1))")))))))))
Formula 3 simplified : !GFGX(GX"((i6.u10.p51==1)&&(i6.u10.p190==1))" & !X"((i9.u17.p81==1)&&(i9.u17.p211==1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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.404893,24900,1,0,3828,3467,2576,5220,1932,7161,12991
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DLCround-PT-07a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("((i4.u6.p37==1)&&(i6.u10.p187==1))")U(((F((F("((i11.u23.p107==1)&&(i11.u21.p167==1))"))||("((u2.p16==1)&&(i7.u12.p137==1))")))U("((u0.p7==1)&&(i6.u10.p126==1))"))&&(G("((i4.u6.p37!=1)||(i6.u10.p187!=1))")))))
Formula 4 simplified : !("((i4.u6.p37==1)&&(i6.u10.p187==1))" U ((F("((u2.p16==1)&&(i7.u12.p137==1))" | F"((i11.u23.p107==1)&&(i11.u21.p167==1))") U "((u0.p7==1)&&(i6.u10.p126==1))") & G"((i4.u6.p37!=1)||(i6.u10.p187!=1))"))
5 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.447509,24900,1,0,4547,3750,2798,6130,1935,8012,16461
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DLCround-PT-07a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(X((F("((i5.u8.p47==1)&&(i6.u10.p188==1))"))U(((X("((i4.u6.p37==1)&&(i4.u4.p111==1))"))&&("((i4.u6.p37!=1)||(i4.u4.p111!=1))"))&&("((i5.u8.p47!=1)||(i6.u10.p188!=1))"))))))
Formula 5 simplified : !FX(F"((i5.u8.p47==1)&&(i6.u10.p188==1))" U ("((i4.u6.p37!=1)||(i4.u4.p111!=1))" & "((i5.u8.p47!=1)||(i6.u10.p188!=1))" & X"((i4.u6.p37==1)&&(i4.u4.p111==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4 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.488665,24900,1,0,6069,4122,2919,8168,1935,10574,22096
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DLCround-PT-07a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((F("(i9.u17.p79==1)"))||("((i5.u8.p41==1)&&(i5.u8.p120==1))"))||("((u2.p21==1)&&(i4.u6.p114==1))"))))
Formula 6 simplified : !X("((i5.u8.p41==1)&&(i5.u8.p120==1))" | "((u2.p21==1)&&(i4.u6.p114==1))" | F"(i9.u17.p79==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.490316,24900,1,0,6069,4122,2956,8168,1945,10574,22118
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA DLCround-PT-07a-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F((!(F("((i8.u15.p77==1)&&(i8.u13.p145==1))")))&&(G("(i7.u12.p67==1)"))))))
Formula 7 simplified : !GF(!F"((i8.u15.p77==1)&&(i8.u13.p145==1))" & G"(i7.u12.p67==1)")
3 unique states visited
3 strongly connected components in search stack
4 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.517215,25100,1,0,6531,4200,3079,8781,1945,11094,23419
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DLCround-PT-07a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(G(("((i11.u23.p101==1)&&(i11.u23.p222==1))")U(G(F(X(F("((i11.u23.p101==1)&&(i11.u23.p222==1))")))))))))
Formula 8 simplified : !FG("((i11.u23.p101==1)&&(i11.u23.p222==1))" U GFXF"((i11.u23.p101==1)&&(i11.u23.p222==1))")
4 unique states visited
4 strongly connected components in search stack
5 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.525604,25100,1,0,6620,4248,3107,8897,1952,11228,23540
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DLCround-PT-07a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(X("((i8.u15.p77==1)&&(i9.u17.p212==1))")))||(("((u3.p28!=1)||(i6.u10.p132!=1))")U(!(X("((u3.p28==1)&&(i6.u10.p132==1))"))))))
Formula 9 simplified : !(GX"((i8.u15.p77==1)&&(i9.u17.p212==1))" | ("((u3.p28!=1)||(i6.u10.p132!=1))" U !X"((u3.p28==1)&&(i6.u10.p132==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.541209,25364,1,0,6953,4297,3185,9310,1952,11626,24266
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DLCround-PT-07a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(X(X("((i9.u17.p87==1)&&(i7.u12.p198==1))"))))U(X(F("((i9.u17.p87==1)&&(i7.u12.p198==1))")))))
Formula 10 simplified : !(FXX"((i9.u17.p87==1)&&(i7.u12.p198==1))" U XF"((i9.u17.p87==1)&&(i7.u12.p198==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.554035,25364,1,0,7475,4360,3225,9936,1952,11881,25701
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA DLCround-PT-07a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 06:28:38] [INFO ] Built C files in 1972ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589610519358

--------------------
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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-07a"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-07a, 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 r051-ebro-158902546300514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-07a.tgz
mv DLCround-PT-07a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;