fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r303-tall-162124171100062
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for GPUForwardProgress-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
428.836 9678.00 21974.00 119.90 FFFFFTTFFFTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171100062.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is GPUForwardProgress-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171100062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.0K May 11 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 31K May 12 08:13 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 GPUForwardProgress-PT-08b-00
FORMULA_NAME GPUForwardProgress-PT-08b-01
FORMULA_NAME GPUForwardProgress-PT-08b-02
FORMULA_NAME GPUForwardProgress-PT-08b-03
FORMULA_NAME GPUForwardProgress-PT-08b-04
FORMULA_NAME GPUForwardProgress-PT-08b-05
FORMULA_NAME GPUForwardProgress-PT-08b-06
FORMULA_NAME GPUForwardProgress-PT-08b-07
FORMULA_NAME GPUForwardProgress-PT-08b-08
FORMULA_NAME GPUForwardProgress-PT-08b-09
FORMULA_NAME GPUForwardProgress-PT-08b-10
FORMULA_NAME GPUForwardProgress-PT-08b-11
FORMULA_NAME GPUForwardProgress-PT-08b-12
FORMULA_NAME GPUForwardProgress-PT-08b-13
FORMULA_NAME GPUForwardProgress-PT-08b-14
FORMULA_NAME GPUForwardProgress-PT-08b-15

=== Now, execution of the tool begins

BK_START 1621335458862

[2021-05-18 10:57:40] [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]
[2021-05-18 10:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 10:57:40] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-18 10:57:40] [INFO ] Transformed 188 places.
[2021-05-18 10:57:40] [INFO ] Transformed 197 transitions.
[2021-05-18 10:57:40] [INFO ] Found NUPN structural information;
[2021-05-18 10:57:40] [INFO ] Parsed PT model containing 188 places and 197 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 50967 steps, including 642 resets, run visited all 41 properties in 174 ms. (steps per millisecond=292 )
[2021-05-18 10:57:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 10:57:40] [INFO ] Flatten gal took : 45 ms
FORMULA GPUForwardProgress-PT-08b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 10:57:40] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 10:57:41] [INFO ] Applying decomposition
[2021-05-18 10:57:41] [INFO ] Flatten gal took : 27 ms
[2021-05-18 10:57:41] [INFO ] Input system was already deterministic with 197 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/graph6291521594118894134.txt, -o, /tmp/graph6291521594118894134.bin, -w, /tmp/graph6291521594118894134.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/graph6291521594118894134.bin, -l, -1, -v, -w, /tmp/graph6291521594118894134.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 10:57:41] [INFO ] Decomposing Gal with order
[2021-05-18 10:57:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:57:41] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-18 10:57:41] [INFO ] Flatten gal took : 42 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 197 rows 188 cols
[2021-05-18 10:57:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-18 10:57:41] [INFO ] Computed 10 place invariants in 10 ms
inv : p1 + p2 + p3 + p4 + p5 + p6 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p153 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 - p172 - p173 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p154 - p174 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
inv : p1 + p2 + p3 + p4 + p5 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 - p172 - p173 - p174 - p175 - p176 - p177 - p178 - p179 - p180 - p181 - p182 - p183 - p184 - p185 - p186 - p187 = 0
Total of 10 invariants.
[2021-05-18 10:57:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 6 ms
[2021-05-18 10:57:41] [INFO ] Computed 10 place invariants in 11 ms
[2021-05-18 10:57:41] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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 15 LTL properties
Checking formula 0 : !(((!(X(F("(i2.i2.u12.p30==1)"))))U(("(i6.i0.u42.p101==1)")U("(i0.i1.u1.p3==1)"))))
Formula 0 simplified : !(!XF"(i2.i2.u12.p30==1)" U ("(i6.i0.u42.p101==1)" U "(i0.i1.u1.p3==1)"))
built 18 ordering constraints for composite.
built 13 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t4, t19, t31, t179, i1.i0.t164, i1.i0.u10.t175, i2.i2.t147, i2.i2.u12.t158, i3.i0.t129, i3.i0.u21.t140, i4.i2.t111, i4.i2.u31.t122, i5.i2.t93, i5.i2.u34.t104, i6.i1.t75, i6.i1.u43.t86, i7.t68, i7.i0.u55.t57, i8.i1.t39, i8.i1.u58.t50, i10.t15, i10.t8, i10.u64.t34, i10.u73.t10, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/173/24/197
Computing Next relation with stutter on 12866 deadlock states
[2021-05-18 10:57:41] [INFO ] Proved 188 variables to be positive in 279 ms
[2021-05-18 10:57:41] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2021-05-18 10:57:41] [INFO ] Computation of disable matrix completed :0/197 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:57:41] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 10:57:41] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2021-05-18 10:57:41] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
141 unique states visited
76 strongly connected components in search stack
143 transitions explored
76 items max in DFS search stack
67 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.702107,39916,1,0,53374,349,2452,66880,205,1126,113000
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(((i7.i1.u51.p122!=1)||(i10.u64.p169!=1))||(i10.u73.p184!=1))")U(!(F(!((F("(i7.i2.u53.p129==1)"))U("(i2.i0.u13.p33!=1)")))))))
Formula 1 simplified : !("(((i7.i1.u51.p122!=1)||(i10.u64.p169!=1))||(i10.u73.p184!=1))" U !F!(F"(i7.i2.u53.p129==1)" U "(i2.i0.u13.p33!=1)"))
Computing Next relation with stutter on 12866 deadlock states
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 items max in DFS search stack
47 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.17288,57364,1,0,103309,378,2538,107469,210,1260,163536
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X(G(X("(i8.i0.u57.p145==1)"))))&&((X(G("(i4.i0.u26.p73==1)")))||(F("(i7.i2.u53.p129==1)")))))
Formula 2 simplified : !(XGX"(i8.i0.u57.p145==1)" & (XG"(i4.i0.u26.p73==1)" | F"(i7.i2.u53.p129==1)"))
Computing Next relation with stutter on 12866 deadlock states
77 unique states visited
77 strongly connected components in search stack
78 transitions explored
77 items max in DFS search stack
12 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.29486,60204,1,0,110364,378,2568,113352,210,1263,173271
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G(F(X("(i7.i0.u48.p117==1)"))))))
Formula 3 simplified : !XGFX"(i7.i0.u48.p117==1)"
Computing Next relation with stutter on 12866 deadlock states
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 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,1.3015,60464,1,0,110709,378,2584,113945,210,1263,174158
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G("(i1.i0.u10.p24==1)"))&&(("(i2.i0.u13.p34==1)")U("(i10.u72.p181==1)")))))
Formula 4 simplified : !X(G"(i1.i0.u10.p24==1)" & ("(i2.i0.u13.p34==1)" U "(i10.u72.p181==1)"))
Computing Next relation with stutter on 12866 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.3074,60908,1,0,110863,378,2618,114186,211,1263,174737
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(!(G(F((X(X("(((i4.i0.u27.p68==1)&&(i10.u64.p169==1))&&(i10.u73.p184==1))")))&&(G(("((i10.u64.p155==1)&&(i10.u71.p175==1))")U("(i10.u70.p173==1)")))))))))
Formula 5 simplified : !X!GF(XX"(((i4.i0.u27.p68==1)&&(i10.u64.p169==1))&&(i10.u73.p184==1))" & G("((i10.u64.p155==1)&&(i10.u71.p175==1))" U "(i10.u70.p173==1)"))
Computing Next relation with stutter on 12866 deadlock states
79 unique states visited
0 strongly connected components in search stack
151 transitions explored
76 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,1.3145,61216,1,0,111156,378,2708,114577,213,1264,175857
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-08b-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(("(i3.i1.u20.p55==1)")U(F("(i2.i2.u17.p44==1)"))))||(!((X("((i2.i0.u11.p29==1)&&(i6.i1.u47.p112==1))"))U("(i2.i2.u17.p44==1)")))))
Formula 6 simplified : !(!("(i3.i1.u20.p55==1)" U F"(i2.i2.u17.p44==1)") | !(X"((i2.i0.u11.p29==1)&&(i6.i1.u47.p112==1))" U "(i2.i2.u17.p44==1)"))
Computing Next relation with stutter on 12866 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.31569,61216,1,0,111156,378,2749,114577,213,1264,175901
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-08b-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F((F("(i10.u64.p157==1)"))U(F((X(G("(i8.i1.u63.p149==1)")))||(G("(i10.u64.p157==1)"))))))))
Formula 7 simplified : !GF(F"(i10.u64.p157==1)" U F(XG"(i8.i1.u63.p149==1)" | G"(i10.u64.p157==1)"))
Computing Next relation with stutter on 12866 deadlock states
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 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,1.32701,61464,1,0,111618,385,2794,116050,213,1321,177235
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(!((G(F((F("(i8.i1.u58.p150!=1)"))U(G("(i6.i1.u46.p111==1)")))))U(X("(i8.i1.u58.p150==1)"))))))
Formula 8 simplified : !G!(GF(F"(i8.i1.u58.p150!=1)" U G"(i6.i1.u46.p111==1)") U X"(i8.i1.u58.p150==1)")
Computing Next relation with stutter on 12866 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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,1.35304,62504,1,0,114472,385,2824,118158,213,1321,181870
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((("(i3.i1.u19.p46==1)")U(X("((i10.u64.p169==1)||(i3.i1.u22.p51==1))"))))
Formula 9 simplified : !("(i3.i1.u19.p46==1)" U X"((i10.u64.p169==1)||(i3.i1.u22.p51==1))")
Computing Next relation with stutter on 12866 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.35398,62768,1,0,114472,385,2833,118158,213,1321,181920
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((!(G(X(((!(X("(i9.u65.p160==1)")))||("(i5.i2.u34.p96!=1)"))&&((X("(i9.u65.p160==1)"))U("(i0.i2.u75.p187==1)"))))))U("(i0.i0.u69.p171==1)")))
Formula 10 simplified : !(!GX(("(i5.i2.u34.p96!=1)" | !X"(i9.u65.p160==1)") & (X"(i9.u65.p160==1)" U "(i0.i2.u75.p187==1)")) U "(i0.i0.u69.p171==1)")
Computing Next relation with stutter on 12866 deadlock states
[2021-05-18 10:57:42] [INFO ] Computing symmetric co enabling matrix : 197 transitions.
[2021-05-18 10:57:44] [INFO ] Computation of co-enabling matrix(5/197) took 1856 ms. Total solver calls (SAT/UNSAT): 965(965/0)
3642 unique states visited
0 strongly connected components in search stack
4720 transitions explored
73 items max in DFS search stack
358 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,4.93558,171792,1,0,447203,385,2950,285204,213,1321,598165
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-08b-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((F((F("(i8.i1.u58.p138==1)"))U((F("(i0.i1.u3.p8==1)"))&&("(i6.i0.u42.p109==1)"))))||("(i0.i0.u0.p1!=1)"))))
Formula 11 simplified : !X("(i0.i0.u0.p1!=1)" | F(F"(i8.i1.u58.p138==1)" U ("(i6.i0.u42.p109==1)" & F"(i0.i1.u3.p8==1)")))
Computing Next relation with stutter on 12866 deadlock states
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,4.95753,172052,1,0,449133,385,3023,287314,213,1321,602077
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(X(F("(i10.u72.p181==1)")))))
Formula 12 simplified : XF"(i10.u72.p181==1)"
Computing Next relation with stutter on 12866 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 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,4.99514,173636,1,0,453223,385,3034,291507,213,1329,607893
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((X(F((("((i0.i2.u75.p187==1)||(((i8.i0.u59.p140==1)&&(i10.u64.p169==1))&&(i10.u73.p184==1)))")U(F("(i0.i2.u75.p187!=1)")))&&(G("(i8.i0.u60.p142==1)"))))))
Formula 13 simplified : !XF(("((i0.i2.u75.p187==1)||(((i8.i0.u59.p140==1)&&(i10.u64.p169==1))&&(i10.u73.p184==1)))" U F"(i0.i2.u75.p187!=1)") & G"(i8.i0.u60.p142==1)")
Computing Next relation with stutter on 12866 deadlock states
74 unique states visited
74 strongly connected components in search stack
74 transitions explored
74 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,5.1008,176804,1,0,460125,385,3057,299962,213,1341,619995
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((G(!(G(!(X(G((G("(i8.i1.u62.p147==1)"))U(F("((i5.i1.u37.p93==1)||(i8.i1.u62.p147==1))"))))))))))
Formula 14 simplified : !G!G!XG(G"(i8.i1.u62.p147==1)" U F"((i5.i1.u37.p93==1)||(i8.i1.u62.p147==1))")
Computing Next relation with stutter on 12866 deadlock states
76 unique states visited
76 strongly connected components in search stack
77 transitions explored
76 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,5.23537,182608,1,0,476110,385,3104,310725,213,1341,635441
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-08b-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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)
[2021-05-18 10:57:47] [INFO ] Built C files in 6503ms 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 1621335468540

--------------------
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="GPUForwardProgress-PT-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is GPUForwardProgress-PT-08b, 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 r303-tall-162124171100062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-08b.tgz
mv GPUForwardProgress-PT-08b 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 ;