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-162124171200106.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-32a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K 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 104K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 07:57 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:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 11 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 11 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:43 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 38K 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-32a-00
FORMULA_NAME GPUForwardProgress-PT-32a-01
FORMULA_NAME GPUForwardProgress-PT-32a-02
FORMULA_NAME GPUForwardProgress-PT-32a-03
FORMULA_NAME GPUForwardProgress-PT-32a-04
FORMULA_NAME GPUForwardProgress-PT-32a-05
FORMULA_NAME GPUForwardProgress-PT-32a-06
FORMULA_NAME GPUForwardProgress-PT-32a-07
FORMULA_NAME GPUForwardProgress-PT-32a-08
FORMULA_NAME GPUForwardProgress-PT-32a-09
FORMULA_NAME GPUForwardProgress-PT-32a-10
FORMULA_NAME GPUForwardProgress-PT-32a-11
FORMULA_NAME GPUForwardProgress-PT-32a-12
FORMULA_NAME GPUForwardProgress-PT-32a-13
FORMULA_NAME GPUForwardProgress-PT-32a-14
FORMULA_NAME GPUForwardProgress-PT-32a-15

=== Now, execution of the tool begins

BK_START 1621339102904

[2021-05-18 11:58:24] [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 11:58:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:58:24] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-18 11:58:24] [INFO ] Transformed 136 places.
[2021-05-18 11:58:24] [INFO ] Transformed 169 transitions.
[2021-05-18 11:58:24] [INFO ] Found NUPN structural information;
[2021-05-18 11:58:24] [INFO ] Parsed PT model containing 136 places and 169 transitions in 91 ms.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
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 88647 steps, including 172 resets, run visited all 38 properties in 404 ms. (steps per millisecond=219 )
[2021-05-18 11:58:25] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 11:58:25] [INFO ] Flatten gal took : 44 ms
FORMULA GPUForwardProgress-PT-32a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 11:58:25] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 11:58:25] [INFO ] Applying decomposition
[2021-05-18 11:58:25] [INFO ] Flatten gal took : 14 ms
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/graph9800314742049628427.txt, -o, /tmp/graph9800314742049628427.bin, -w, /tmp/graph9800314742049628427.weights], workingDir=null]
[2021-05-18 11:58:25] [INFO ] Input system was already deterministic with 135 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph9800314742049628427.bin, -l, -1, -v, -w, /tmp/graph9800314742049628427.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 11:58:25] [INFO ] Decomposing Gal with order
[2021-05-18 11:58:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:58:25] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-18 11:58:25] [INFO ] Flatten gal took : 37 ms
[2021-05-18 11:58:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-18 11:58:25] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2021-05-18 11:58:25] [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 13 LTL properties
Checking formula 0 : !((F(X(X(G("(u16.p67==1)"))))))
Formula 0 simplified : !FXXG"(u16.p67==1)"
built 34 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 135 rows 136 cols
[2021-05-18 11:58:25] [INFO ] Computed 34 place invariants in 7 ms
inv : p41 + p42 + p43 + p44 - p132 - p133 - p134 - p135 = 0
inv : p109 + p110 + p111 + p112 - p132 - p133 - p134 - p135 = 0
inv : p17 + p18 + p19 + p20 - p132 - p133 - p134 - p135 = 0
inv : p85 + p86 + p87 + p88 - p132 - p133 - p134 - p135 = 0
inv : p89 + p90 + p91 + p92 - p132 - p133 - p134 - p135 = 0
inv : p105 + p106 + p107 + p108 - p132 - p133 - p134 - p135 = 0
inv : p37 + p38 + p39 + p40 - p132 - p133 - p134 - p135 = 0
inv : p21 + p22 + p23 + p24 - p132 - p133 - p134 - p135 = 0
inv : p69 + p70 + p71 + p72 - p132 - p133 - p134 - p135 = 0
inv : p25 + p26 + p27 + p28 - p132 - p133 - p134 - p135 = 0
inv : p125 + p126 + p127 + p128 - p132 - p133 - p134 - p135 = 0
inv : p1 + p2 + p3 + p4 - p132 - p133 - p134 - p135 = 0
inv : p101 + p102 + p103 + p104 - p132 - p133 - p134 - p135 = 0
inv : p93 + p94 + p95 + p96 - p132 - p133 - p134 - p135 = 0
inv : p33 + p34 + p35 + p36 - p132 - p133 - p134 - p135 = 0
inv : p61 + p62 + p63 + p64 - p132 - p133 - p134 - p135 = 0
inv : p130 + p131 - p133 - p134 - p135 = 0
inv : p65 + p66 + p67 + p68 - p132 - p133 - p134 - p135 = 0
inv : p29 + p30 + p31 + p32 - p132 - p133 - p134 - p135 = 0
inv : p129 - p132 = 0
inv : p97 + p98 + p99 + p100 - p132 - p133 - p134 - p135 = 0
inv : p53 + p54 + p55 + p56 - p132 - p133 - p134 - p135 = 0
inv : p121 + p122 + p123 + p124 - p132 - p133 - p134 - p135 = 0
inv : p9 + p10 + p11 + p12 - p132 - p133 - p134 - p135 = 0
inv : p77 + p78 + p79 + p80 - p132 - p133 - p134 - p135 = 0
inv : p5 + p6 + p7 + p8 - p132 - p133 - p134 - p135 = 0
inv : p57 + p58 + p59 + p60 - p132 - p133 - p134 - p135 = 0
inv : p73 + p74 + p75 + p76 - p132 - p133 - p134 - p135 = 0
inv : p113 + p114 + p115 + p116 - p132 - p133 - p134 - p135 = 0
inv : p49 + p50 + p51 + p52 - p132 - p133 - p134 - p135 = 0
inv : p117 + p118 + p119 + p120 - p132 - p133 - p134 - p135 = 0
inv : p45 + p46 + p47 + p48 - p132 - p133 - p134 - p135 = 0
inv : p81 + p82 + p83 + p84 - p132 - p133 - p134 - p135 = 0
inv : p13 + p14 + p15 + p16 - p132 - p133 - p134 - p135 = 0
Total of 34 invariants.
[2021-05-18 11:58:25] [INFO ] Computed 34 place invariants in 13 ms
[2021-05-18 11:58:25] [INFO ] Proved 136 variables to be positive in 276 ms
[2021-05-18 11:58:25] [INFO ] Computing symmetric may disable matrix : 135 transitions.
[2021-05-18 11:58:25] [INFO ] Computation of disable matrix completed :0/135 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 11:58:25] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 11:58:25] [INFO ] Computing symmetric may enable matrix : 135 transitions.
[2021-05-18 11:58:25] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 11:58:28] [INFO ] Computing symmetric co enabling matrix : 135 transitions.
[2021-05-18 11:58:28] [INFO ] Computation of co-enabling matrix(4/135) took 507 ms. Total solver calls (SAT/UNSAT): 396(396/0)
[2021-05-18 11:58:32] [INFO ] Computation of co-enabling matrix(70/135) took 3609 ms. Total solver calls (SAT/UNSAT): 4781(4781/0)
Reverse transition relation is NOT exact ! Due to transitions t103, u32.t2, u32.t3, u32.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/131/4/135
[2021-05-18 11:58:35] [INFO ] Computation of co-enabling matrix(104/135) took 6619 ms. Total solver calls (SAT/UNSAT): 6362(6362/0)
Computing Next relation with stutter on 4.29497e+09 deadlock states
[2021-05-18 11:58:36] [INFO ] Computation of Finished co-enabling matrix. took 8010 ms. Total solver calls (SAT/UNSAT): 6797(6797/0)
[2021-05-18 11:58:36] [INFO ] Computing Do-Not-Accords matrix : 135 transitions.
[2021-05-18 11:58:48] [INFO ] Computation of Completed DNA matrix. took 11994 ms. Total solver calls (SAT/UNSAT): 487(0/487)
[2021-05-18 11:58:48] [INFO ] Built C files in 23090ms 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]
Compilation finished in 1806 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(X([]((LTLAP0==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(X([]((LTLAP0==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(X([]((LTLAP0==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
15567 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,155.704,2428936,1,0,6.17004e+06,397165,671,6.19269e+06,300,906889,1145376
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((X(F((((!(F("(((u27.p110==1)&&(u32.p131==1))&&(u32.p135==1))")))||("(u22.p92!=1)"))||("(u32.p131!=1)"))||("(u32.p135!=1)"))))||(G(!(G("(u15.p63==1)")))))))
Formula 1 simplified : !F(XF("(u22.p92!=1)" | "(u32.p131!=1)" | "(u32.p135!=1)" | !F"(((u27.p110==1)&&(u32.p131==1))&&(u32.p135==1))") | G!G"(u15.p63==1)")
Computing Next relation with stutter on 4.29497e+09 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
165 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,157.354,2430112,1,0,6.17004e+06,397165,5144,6.19269e+06,392,906889,1271931
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-32a-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((X(G("(((u14.p58!=1)||(u32.p131!=1))||(u32.p135!=1))")))||(F("(((u1.p6==1)&&(u32.p131==1))&&(u32.p135==1))")))||(X("(u29.p119==1)"))))
Formula 2 simplified : !(XG"(((u14.p58!=1)||(u32.p131!=1))||(u32.p135!=1))" | F"(((u1.p6==1)&&(u32.p131==1))&&(u32.p135==1))" | X"(u29.p119==1)")
Computing Next relation with stutter on 4.29497e+09 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2536 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,182.714,2432708,1,0,6.17004e+06,397165,5293,6.19269e+06,394,1.02984e+06,7336370
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(G("((((u2.p10==1)&&(u32.p131==1))&&(u32.p135==1))&&(u23.p95==1))")))U(X(F(G(("(((u8.p36==1)&&(u32.p131==1))&&(u32.p135==1))")U(X("(u10.p42==1)"))))))))
Formula 3 simplified : !(!G"((((u2.p10==1)&&(u32.p131==1))&&(u32.p135==1))&&(u23.p95==1))" U XFG("(((u8.p36==1)&&(u32.p131==1))&&(u32.p135==1))" U X"(u10.p42==1)"))
Computing Next relation with stutter on 4.29497e+09 deadlock states
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
303 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,185.742,2433296,1,0,6.17004e+06,397165,5514,6.19269e+06,404,1.10385e+06,7865260
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F(((F("(u20.p83==1)"))U("(((u3.p16==1)&&(u32.p131==1))&&(u32.p135==1))"))||(X(G("(((u9.p38==1)&&(u32.p131==1))&&(u32.p135==1))"))))))||(X(F("(((u9.p38==1)&&(u32.p131==1))&&(u32.p135==1))")))))
Formula 4 simplified : !(!F((F"(u20.p83==1)" U "(((u3.p16==1)&&(u32.p131==1))&&(u32.p135==1))") | XG"(((u9.p38==1)&&(u32.p131==1))&&(u32.p135==1))") | XF"(((u9.p38==1)&&(u32.p131==1))&&(u32.p135==1))")
Computing Next relation with stutter on 4.29497e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
5846 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,244.203,2966840,1,0,7.28531e+06,397165,822,6.70856e+06,311,1.12433e+06,136779
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G((!(X("((((u28.p114==1)&&(u32.p131==1))&&(u32.p135==1))||(u26.p107==1))")))||("(u26.p107!=1)")))))
Formula 5 simplified : G("(u26.p107!=1)" | !X"((((u28.p114==1)&&(u32.p131==1))&&(u32.p135==1))||(u26.p107==1))")
Computing Next relation with stutter on 4.29497e+09 deadlock states
4 unique states visited
3 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
530 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,249.498,2966840,1,0,7.28531e+06,397165,5298,6.70856e+06,392,1.12433e+06,1226216
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G(F((G((G(X(("(u24.p99==1)")U("(u29.p118==1)"))))U("(((u12.p50==1)&&(u32.p131==1))&&(u32.p135==1))")))U(("(u15.p63!=1)")U("(u29.p118==1)"))))))
Formula 6 simplified : !GF(G(GX("(u24.p99==1)" U "(u29.p118==1)") U "(((u12.p50==1)&&(u32.p131==1))&&(u32.p135==1))") U ("(u15.p63!=1)" U "(u29.p118==1)"))
Computing Next relation with stutter on 4.29497e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
163 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,251.13,2966840,1,0,7.28531e+06,397165,5402,6.70856e+06,393,1.12433e+06,1622123
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(G((((G("(u3.p15!=1)"))||("(u3.p15!=1)"))||("(u24.p98==1)"))||("(((u4.p20==1)&&(u32.p131==1))&&(u32.p135==1))"))))))
Formula 7 simplified : !XFG("(((u4.p20==1)&&(u32.p131==1))&&(u32.p135==1))" | "(u3.p15!=1)" | "(u24.p98==1)" | G"(u3.p15!=1)")
Computing Next relation with stutter on 4.29497e+09 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4187 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,292.999,2966840,1,0,7.28531e+06,397165,5515,6.70856e+06,396,1.12433e+06,11468834
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(X(F("(u12.p51==1)")))))
Formula 8 simplified : XF"(u12.p51==1)"
Computing Next relation with stutter on 4.29497e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
220 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,295.207,2966840,1,0,7.28531e+06,397165,5614,6.70856e+06,396,1.12433e+06,11907516
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(X(X(G("((((u20.p84!=1)||(u32.p131!=1))||(u32.p135!=1))&&(u17.p70==1))")))))))
Formula 9 simplified : XXXG"((((u20.p84!=1)||(u32.p131!=1))||(u32.p135!=1))&&(u17.p70==1))"
Computing Next relation with stutter on 4.29497e+09 deadlock states
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,295.221,2966840,1,0,7.28531e+06,397165,5693,6.70856e+06,399,1.12433e+06,11908479
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(!(F("(((u22.p92==1)&&(u32.p131==1))&&(u32.p135==1))")))))
Formula 10 simplified : !G!F"(((u22.p92==1)&&(u32.p131==1))&&(u32.p135==1))"
Computing Next relation with stutter on 4.29497e+09 deadlock states
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,295.227,2966840,1,0,7.28531e+06,397165,5741,6.70856e+06,399,1.12433e+06,11908796
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((!(G("(((u22.p92==1)&&(u32.p131==1))&&(u32.p135==1))")))&&((!(X("(((u22.p90==1)&&(u32.p131==1))&&(u32.p135==1))")))||(!(G(F(X("(((u5.p24==1)&&(u32.p131==1))&&(u32.p135==1))"))))))))
Formula 11 simplified : !(!G"(((u22.p92==1)&&(u32.p131==1))&&(u32.p135==1))" & (!X"(((u22.p90==1)&&(u32.p131==1))&&(u32.p135==1))" | !GFX"(((u5.p24==1)&&(u32.p131==1))&&(u32.p135==1))"))
Computing Next relation with stutter on 4.29497e+09 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,295.229,2966840,1,0,7.28531e+06,397165,5749,6.70856e+06,399,1.12433e+06,11908803
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-32a-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((G(((("(u0.p3==1)")U("(u28.p115==1)"))U("(u28.p115==1)"))U(!(X("(u0.p3==1)"))))))
Formula 12 simplified : !G((("(u0.p3==1)" U "(u28.p115==1)") U "(u28.p115==1)") U !X"(u0.p3==1)")
Computing Next relation with stutter on 4.29497e+09 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
112 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,296.344,2967000,1,0,7.28531e+06,397165,5761,6.70856e+06,399,1.12433e+06,12158885
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621339417078

--------------------
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-32a"
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-32a, 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-162124171200106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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