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-162124171200105.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171200105
=====================================================================

--------------------
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 1621339052908

[2021-05-18 11:57:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:57:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:57:35] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-18 11:57:35] [INFO ] Transformed 136 places.
[2021-05-18 11:57:35] [INFO ] Transformed 169 transitions.
[2021-05-18 11:57:35] [INFO ] Found NUPN structural information;
[2021-05-18 11:57:35] [INFO ] Parsed PT model containing 136 places and 169 transitions in 110 ms.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 224 resets, run finished after 551 ms. (steps per millisecond=181 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 135 rows 136 cols
[2021-05-18 11:57:35] [INFO ] Computed 34 place invariants in 7 ms
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 24 ms returned sat
[2021-05-18 11:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 11:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:36] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 36 ms returned unsat
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 13 ms returned sat
[2021-05-18 11:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-18 11:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:36] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 9 ms returned unsat
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 12 ms returned sat
[2021-05-18 11:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-18 11:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:36] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 8 ms returned unsat
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 12 ms returned sat
[2021-05-18 11:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-18 11:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:36] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 17 ms returned unsat
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 11 ms returned sat
[2021-05-18 11:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:36] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-18 11:57:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:36] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 8 ms returned unsat
[2021-05-18 11:57:37] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 12 ms returned sat
[2021-05-18 11:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:37] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-18 11:57:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:37] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 8 ms returned unsat
[2021-05-18 11:57:37] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 12 ms returned sat
[2021-05-18 11:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:37] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-18 11:57:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:37] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 8 ms returned unsat
[2021-05-18 11:57:37] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 11 ms returned sat
[2021-05-18 11:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:57:37] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-18 11:57:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:57:37] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 8 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2021-05-18 11:57:37] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-18 11:57:37] [INFO ] Flatten gal took : 47 ms
FORMULA GPUForwardProgress-PT-32a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 11:57:37] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 11:57:37] [INFO ] Applying decomposition
[2021-05-18 11:57:37] [INFO ] Flatten gal took : 15 ms
[2021-05-18 11:57:37] [INFO ] Input system was already deterministic with 135 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/graph12103946248019651763.txt, -o, /tmp/graph12103946248019651763.bin, -w, /tmp/graph12103946248019651763.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/graph12103946248019651763.bin, -l, -1, -v, -w, /tmp/graph12103946248019651763.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 11:57:37] [INFO ] Decomposing Gal with order
[2021-05-18 11:57:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 11:57:37] [INFO ] Removed a total of 51 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 135 rows 136 cols
[2021-05-18 11:57:37] [INFO ] Computed 34 place invariants in 4 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:57:37] [INFO ] Computed 34 place invariants in 5 ms
[2021-05-18 11:57:37] [INFO ] Flatten gal took : 58 ms
[2021-05-18 11:57:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-18 11:57:37] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2021-05-18 11:57:37] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 9 LTL properties
Checking formula 0 : !(((!(G(("(u32.p121!=1)")U("(u23.p95==1)"))))U(F(G("(u32.p121==1)")))))
Formula 0 simplified : !(!G("(u32.p121!=1)" U "(u23.p95==1)") U FG"(u32.p121==1)")
built 34 ordering constraints for composite.
[2021-05-18 11:57:38] [INFO ] Proved 136 variables to be positive in 233 ms
[2021-05-18 11:57:38] [INFO ] Computing symmetric may disable matrix : 135 transitions.
[2021-05-18 11:57:38] [INFO ] Computation of disable matrix completed :0/135 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 11:57:38] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 11:57:38] [INFO ] Computing symmetric may enable matrix : 135 transitions.
[2021-05-18 11:57:38] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 11:57:38] [INFO ] Computing symmetric co enabling matrix : 135 transitions.
[2021-05-18 11:57:41] [INFO ] Computation of co-enabling matrix(45/135) took 2547 ms. Total solver calls (SAT/UNSAT): 3123(3123/0)
[2021-05-18 11:57:44] [INFO ] Computation of co-enabling matrix(87/135) took 5613 ms. Total solver calls (SAT/UNSAT): 5716(5716/0)
[2021-05-18 11:57:47] [INFO ] Computation of co-enabling matrix(126/135) took 8641 ms. Total solver calls (SAT/UNSAT): 6769(6769/0)
[2021-05-18 11:57:47] [INFO ] Computation of Finished co-enabling matrix. took 8880 ms. Total solver calls (SAT/UNSAT): 6797(6797/0)
[2021-05-18 11:57:47] [INFO ] Computing Do-Not-Accords matrix : 135 transitions.
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
Computing Next relation with stutter on 4.29497e+09 deadlock states
[2021-05-18 11:57:59] [INFO ] Computation of Completed DNA matrix. took 12122 ms. Total solver calls (SAT/UNSAT): 487(0/487)
[2021-05-18 11:57:59] [INFO ] Built C files in 21933ms 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 1776 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, (!( [](((LTLAP0==true))U((LTLAP1==true)))) )U(<>([]((LTLAP2==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, -p, --pins-guards, --when, --ltl, (!( [](((LTLAP0==true))U((LTLAP1==true)))) )U(<>([]((LTLAP2==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, -p, --pins-guards, --when, --ltl, (!( [](((LTLAP0==true))U((LTLAP1==true)))) )U(<>([]((LTLAP2==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)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17628 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,176.295,2442772,1,0,6.37332e+06,398282,689,5.85903e+06,300,905828,2373184
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(G("((u5.p23!=0)&&(u28.p113!=1))"))))
Formula 1 simplified : !FG"((u5.p23!=0)&&(u28.p113!=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
30799 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,484.289,3322476,1,0,8.56121e+06,398282,691,8.25869e+06,300,905828,3471369
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((X((X("((u25.p104==0)||(u27.p110==1))"))||(F("((u25.p104==0)||(u27.p110==1))"))))&&(("((u27.p111==0)||(u9.p38==1))")U(G("((u27.p111==0)||(u9.p38==1))")))))
Formula 2 simplified : !(X(X"((u25.p104==0)||(u27.p110==1))" | F"((u25.p104==0)||(u27.p110==1))") & ("((u27.p111==0)||(u9.p38==1))" U G"((u27.p111==0)||(u9.p38==1))"))
Computing Next relation with stutter on 4.29497e+09 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
1210 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,496.386,3322868,1,0,8.56121e+06,398282,5349,8.25869e+06,391,952773,5175058
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 : !((F(X(G(F(G((X(F(X(X("((u3.p0==0)||(u30.p123==1))")))))&&("(u32.p45==1)"))))))))
Formula 3 simplified : !FXGFG("(u32.p45==1)" & XFXX"((u3.p0==0)||(u30.p123==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
69 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,497.084,3323132,1,0,8.56121e+06,398282,5396,8.25869e+06,393,953031,5263271
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(X(F("(u7.p31==1)"))))))
Formula 4 simplified : !FXF"(u7.p31==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
140 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,498.477,3323132,1,0,8.56121e+06,398282,5510,8.25869e+06,395,963326,5520950
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 : !((F("(u27.p111==1)")))
Formula 5 simplified : !F"(u27.p111==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
9 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,498.572,3323132,1,0,8.56121e+06,398282,5531,8.25869e+06,396,963326,5532604
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 : !((F(X((G("((u24.p99==0)||(u30.p122==1))"))U("((u9.p37==0)||(u5.p23==1))")))))
Formula 6 simplified : !FX(G"((u24.p99==0)||(u30.p122==1))" U "((u9.p37==0)||(u5.p23==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,498.574,3323132,1,0,8.56121e+06,398282,5553,8.25869e+06,397,963326,5532641
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-32a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(!(G(X(G(F("((u32.p57==0)||(u28.p113==1))"))))))))
Formula 7 simplified : !F!GXGF"((u32.p57==0)||(u28.p113==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
32141 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,819.982,4087856,1,0,1.06389e+07,398282,691,9.69732e+06,300,1.0359e+06,6761742
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-32a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X(G("((u20.p83==0)||(u20.p83==1))")))))
Formula 8 simplified : !GXG"((u20.p83==0)||(u20.p83==1))"
Computing Next relation with stutter on 4.29497e+09 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
449 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,824.47,4087856,1,0,1.06389e+07,398282,5174,9.69732e+06,393,1.0359e+06,7185200
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-32a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1621339899949

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-162124171200105"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;