Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.6K May 14 01:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 19:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 13 19:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.9K May 13 14:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 13 14:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 37K May 12 20:42 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 ShieldPPPt-PT-002B-00
FORMULA_NAME ShieldPPPt-PT-002B-01
FORMULA_NAME ShieldPPPt-PT-002B-02
FORMULA_NAME ShieldPPPt-PT-002B-03
FORMULA_NAME ShieldPPPt-PT-002B-04
FORMULA_NAME ShieldPPPt-PT-002B-05
FORMULA_NAME ShieldPPPt-PT-002B-06
FORMULA_NAME ShieldPPPt-PT-002B-07
FORMULA_NAME ShieldPPPt-PT-002B-08
FORMULA_NAME ShieldPPPt-PT-002B-09
FORMULA_NAME ShieldPPPt-PT-002B-10
FORMULA_NAME ShieldPPPt-PT-002B-11
FORMULA_NAME ShieldPPPt-PT-002B-12
FORMULA_NAME ShieldPPPt-PT-002B-13
FORMULA_NAME ShieldPPPt-PT-002B-14
FORMULA_NAME ShieldPPPt-PT-002B-15

=== Now, execution of the tool begins

BK_START 1590606304646

[2020-05-27 19:05:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 19:05:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 19:05:06] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-05-27 19:05:06] [INFO ] Transformed 159 places.
[2020-05-27 19:05:06] [INFO ] Transformed 145 transitions.
[2020-05-27 19:05:06] [INFO ] Found NUPN structural information;
[2020-05-27 19:05:06] [INFO ] Parsed PT model containing 159 places and 145 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1 resets, run finished after 148 ms. (steps per millisecond=675 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 145 rows 159 cols
[2020-05-27 19:05:06] [INFO ] Computed 23 place invariants in 7 ms
[2020-05-27 19:05:06] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 19:05:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-27 19:05:06] [INFO ] Flatten gal took : 38 ms
FORMULA ShieldPPPt-PT-002B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 19:05:06] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 19:05:06] [INFO ] Applying decomposition
[2020-05-27 19:05:06] [INFO ] Flatten gal took : 30 ms
[2020-05-27 19:05:07] [INFO ] Input system was already deterministic with 145 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/graph16636850415298774307.txt, -o, /tmp/graph16636850415298774307.bin, -w, /tmp/graph16636850415298774307.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/graph16636850415298774307.bin, -l, -1, -v, -w, /tmp/graph16636850415298774307.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 19:05:07] [INFO ] Decomposing Gal with order
[2020-05-27 19:05:07] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 145 rows 159 cols
[2020-05-27 19:05:07] [INFO ] Computed 23 place invariants in 3 ms
inv : p0 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p93 + p94 + p95 + p96 + p97 = 1
inv : p0 + p82 + p83 + p84 + p85 + p86 + p87 + p107 + p108 + p109 + p112 + p113 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p23 + p24 + p25 + p26 + p27 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p82 + p83 + p84 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 = 1
inv : p0 + p82 + p83 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 = 1
inv : p0 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p100 + p101 + p102 + p105 + p106 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p16 + p17 + p18 + p19 + p20 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p30 + p31 + p32 + p35 + p36 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p82 + p83 + p84 + p85 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 = 1
inv : p0 + p1 + p2 + p3 + p4 = 1
inv : p0 + p1 + p5 + p6 + p7 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p23 + p24 + p25 + p28 + p29 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p30 + p31 + p32 + p33 + p34 = 1
inv : p0 + p82 + p83 + p84 + p85 + p86 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 = 1
inv : p0 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 = 1
inv : p0 + p82 + p83 + p84 + p85 + p86 + p87 + p107 + p108 + p109 + p110 + p111 = 1
inv : p0 + p1 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p16 + p17 + p18 + p21 + p22 = 1
inv : p0 + p1 + p5 + p6 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 = 1
inv : p0 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p93 + p94 + p95 + p98 + p99 = 1
inv : p0 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p100 + p101 + p102 + p103 + p104 = 1
Total of 23 invariants.
[2020-05-27 19:05:07] [INFO ] Computed 23 place invariants in 8 ms
[2020-05-27 19:05:07] [INFO ] Removed a total of 12 redundant transitions.
[2020-05-27 19:05:07] [INFO ] Flatten gal took : 39 ms
[2020-05-27 19:05:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2020-05-27 19:05:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 19:05:07] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 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 : !(((G("(i13.u48.p147!=1)"))&&((G((F(G("(i3.i0.u3.p7==1)")))&&("(i11.u42.p119==1)")))||(F(X("(i3.i0.u3.p7!=1)"))))))
Formula 0 simplified : !(G"(i13.u48.p147!=1)" & (G("(i11.u42.p119==1)" & FG"(i3.i0.u3.p7==1)") | FX"(i3.i0.u3.p7!=1)"))
built 30 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
[2020-05-27 19:05:07] [INFO ] Proved 159 variables to be positive in 216 ms
[2020-05-27 19:05:07] [INFO ] Computing symmetric may disable matrix : 145 transitions.
[2020-05-27 19:05:07] [INFO ] Computation of disable matrix completed :0/145 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:05:07] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:05:07] [INFO ] Computing symmetric may enable matrix : 145 transitions.
[2020-05-27 19:05:07] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:05:08] [INFO ] Computing symmetric co enabling matrix : 145 transitions.
[2020-05-27 19:05:10] [INFO ] Computation of co-enabling matrix(102/145) took 2155 ms. Total solver calls (SAT/UNSAT): 1456(7/1449)
[2020-05-27 19:05:11] [INFO ] Computation of Finished co-enabling matrix. took 2897 ms. Total solver calls (SAT/UNSAT): 1600(14/1586)
[2020-05-27 19:05:11] [INFO ] Computing Do-Not-Accords matrix : 145 transitions.
[2020-05-27 19:05:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 19:05:11] [INFO ] Built C files in 4143ms 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]
Reverse transition relation is NOT exact ! Due to transitions t56, t59, t110, t113, i1.u1.t120, i1.u9.t115, i2.t116, i2.i0.u6.t119, i2.i1.u7.t118, i3.i1.u11.t112, i4.t108, i4.t101, i4.u14.t106, i4.u17.t102, i4.u17.t109, i5.t91, i5.u20.t95, i5.u20.t97, i6.t86, i6.t79, i6.u23.t84, i6.u25.t80, i6.u25.t87, i7.t74, i7.t67, i7.u29.t68, i7.u29.t75, i7.u30.t72, i8.t53, i8.u34.t62, i8.u39.t55, i9.u35.t61, i10.u37.t58, i11.t51, i11.t44, i11.u41.t49, i11.u43.t45, i11.u43.t52, i12.t34, i12.u47.t38, i12.u47.t40, i13.t29, i13.t22, i13.u51.t23, i13.u51.t30, i13.u52.t27, i14.t17, i14.t10, i14.u54.t11, i14.u54.t18, i14.u55.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/94/51/145
Computing Next relation with stutter on 162 deadlock states
Compilation finished in 1556 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 77 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( []((LTLAP0==true)) ) && ( ( [](( <>([]((LTLAP1==true))) ) && ( (LTLAP2==true) ))) || ( <>(X((LTLAP3==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, ( []((LTLAP0==true)) ) && ( ( [](( <>([]((LTLAP1==true))) ) && ( (LTLAP2==true) ))) || ( <>(X((LTLAP3==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, ( []((LTLAP0==true)) ) && ( ( [](( <>([]((LTLAP1==true))) ) && ( (LTLAP2==true) ))) || ( <>(X((LTLAP3==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)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
797 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,8.00534,156168,1,0,293078,888,2048,451032,306,3088,551721
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X((!(F(G("((i8.u39.p110==1)&&(i14.u55.p157==1))"))))||(X(G("(i0.u31.p83==1)")))))))
Formula 1 simplified : !FX(!FG"((i8.u39.p110==1)&&(i14.u55.p157==1))" | XG"(i0.u31.p83==1)")
Computing Next relation with stutter on 162 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5906 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,67.074,1357492,1,0,2.48277e+06,899,2099,4.0761e+06,307,3286,3264370
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(X(G(X(("(i7.u28.p76==1)")U(F(G("(i2.i1.u8.p18==1)")))))))))
Formula 2 simplified : XGX("(i7.u28.p76==1)" U FG"(i2.i1.u8.p18==1)")
Computing Next relation with stutter on 162 deadlock states
98 unique states visited
98 strongly connected components in search stack
99 transitions explored
98 items max in DFS search stack
10282 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,169.899,2201280,1,0,4.07112e+06,1081,1137,6.34511e+06,155,5359,1871029
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(G(F(("((i9.u35.p93==1)&&(i12.u46.p129==1))")&&((!(X("(i12.u47.p131==1)")))||(!((X("((i9.u35.p93==1)&&(i12.u46.p129==1))"))U("(i6.u24.p64==1)"))))))))))
Formula 3 simplified : !XXGF("((i9.u35.p93==1)&&(i12.u46.p129==1))" & (!X"(i12.u47.p131==1)" | !(X"((i9.u35.p93==1)&&(i12.u46.p129==1))" U "(i6.u24.p64==1)")))
Computing Next relation with stutter on 162 deadlock states
407 unique states visited
407 strongly connected components in search stack
408 transitions explored
407 items max in DFS search stack
15572 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,325.624,3256552,1,0,5.42257e+06,1569,1418,1.17702e+07,167,9347,6559173
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((!(X(F("(i11.u43.p115==1)"))))U(X(!(G(F(X(F("(i11.u43.p115==1)"))))))))))
Formula 4 simplified : !F(!XF"(i11.u43.p115==1)" U X!GFXF"(i11.u43.p115==1)")
Computing Next relation with stutter on 162 deadlock states
99 unique states visited
98 strongly connected components in search stack
101 transitions explored
99 items max in DFS search stack
3122 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,356.849,3227232,1,0,5.42259e+06,1569,1201,1.17702e+07,158,9347,515341
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G(X(G("(i13.u51.p144==1)"))))))
Formula 5 simplified : !FGXG"(i13.u51.p144==1)"
Computing Next relation with stutter on 162 deadlock states
97 unique states visited
96 strongly connected components in search stack
98 transitions explored
97 items max in DFS search stack
25 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,357.102,3227232,1,0,5.42259e+06,1569,1331,1.17702e+07,168,9347,541192
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((X((G(X("(i3.i0.u2.p5==1)")))&&("(i14.u55.p151==1)")))||(F(!(G(X("(i6.u22.p61==1)")))))))
Formula 6 simplified : !(X("(i14.u55.p151==1)" & GX"(i3.i0.u2.p5==1)") | F!GX"(i6.u22.p61==1)")
Computing Next relation with stutter on 162 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,357.104,3227232,1,0,5.42259e+06,1569,1344,1.17702e+07,168,9347,541220
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-002B-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(X(G((X(X("(i3.i0.u4.p10==1)")))||(X("(i4.u13.p47==1)"))))))||(G("(i4.u13.p47==1)"))))
Formula 7 simplified : !(XXG(XX"(i3.i0.u4.p10==1)" | X"(i4.u13.p47==1)") | G"(i4.u13.p47==1)")
Computing Next relation with stutter on 162 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 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,357.116,3227232,1,0,5.42259e+06,1569,1393,1.17702e+07,170,9347,542455
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("(i6.u21.p69!=1)")))
Formula 8 simplified : !G"(i6.u21.p69!=1)"
Computing Next relation with stutter on 162 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
145 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,358.563,3227232,1,0,5.42259e+06,1569,1427,1.17702e+07,170,9347,769137
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((F(X("(i2.i1.u8.p18==1)"))))
Formula 9 simplified : !FX"(i2.i1.u8.p18==1)"
Computing Next relation with stutter on 162 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
148 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,360.043,3227232,1,0,5.42259e+06,1569,1478,1.17702e+07,170,9347,1005600
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(F(G("(i12.u47.p131==1)"))))))
Formula 10 simplified : !XXFG"(i12.u47.p131==1)"
Computing Next relation with stutter on 162 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
76117 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,1121.21,4501264,1,0,6.48416e+06,1569,729,1.52148e+07,128,9347,5762912
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(((F(G("(i4.u17.p45==1)")))&&(G("(i14.u54.p155==1)")))U(G(F("(i4.u17.p45==1)"))))))
Formula 11 simplified : !X((FG"(i4.u17.p45==1)" & G"(i14.u54.p155==1)") U GF"(i4.u17.p45==1)")
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2020-05-27 19:25:07] [INFO ] Applying decomposition
[2020-05-27 19:25:07] [INFO ] Flatten gal took : 18 ms
[2020-05-27 19:25:07] [INFO ] Decomposing Gal with order
[2020-05-27 19:25:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 19:25:07] [INFO ] Flatten gal took : 44 ms
[2020-05-27 19:25:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-27 19:25:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 19:25:07] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 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 2 LTL properties
Checking formula 0 : !((X(((F(G("(i0.i1.i0.i0.i0.u20.p45==1)")))&&(G("(i1.u44.p155==1)")))U(G(F("(i0.i1.i0.i0.i0.u20.p45==1)"))))))
Formula 0 simplified : !X((FG"(i0.i1.i0.i0.i0.u20.p45==1)" & G"(i1.u44.p155==1)") U GF"(i0.i1.i0.i0.i0.u20.p45==1)")
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t120, i0.i1.u23.t67, i0.i1.u23.t68, i0.i1.u23.t72, i0.i1.u23.t74, i0.i1.u23.t75, i0.i1.i0.u22.t79, i0.i1.i0.u22.t80, i0.i1.i0.u22.t84, i0.i1.i0.u22.t86, i0.i1.i0.u22.t87, i0.i1.i0.i0.u21.t91, i0.i1.i0.i0.u21.t95, i0.i1.i0.i0.u21.t97, i0.i1.i0.i0.i0.u20.t101, i0.i1.i0.i0.i0.u20.t102, i0.i1.i0.i0.i0.u20.t106, i0.i1.i0.i0.i0.u20.t108, i0.i1.i0.i0.i0.u20.t109, i0.i1.i0.i0.i0.i0.t110, i0.i1.i0.i0.i0.i0.i0.t113, i0.i1.i0.i0.i0.i0.i0.i0.t116, i0.i1.i0.i0.i0.i0.i0.i0.u10.t119, i0.i1.i0.i0.i0.i0.i0.i0.i1.u46.t118, i0.i1.i0.i0.i0.i0.i0.i1.u49.t115, i0.i1.i0.i0.i0.i0.i1.u50.t112, i1.u44.t10, i1.u44.t11, i1.u44.t15, i1.u44.t17, i1.u44.t18, i1.i0.u43.t22, i1.i0.u43.t23, i1.i0.u43.t27, i1.i0.u43.t29, i1.i0.u43.t30, i1.i0.i0.u42.t34, i1.i0.i0.u42.t38, i1.i0.i0.u42.t40, i1.i0.i0.i0.u41.t44, i1.i0.i0.i0.u41.t45, i1.i0.i0.i0.u41.t49, i1.i0.i0.i0.u41.t51, i1.i0.i0.i0.u41.t52, i1.i0.i0.i0.i0.t53, i1.i0.i0.i0.i0.i0.t56, i1.i0.i0.i0.i0.i0.i0.t59, i1.i0.i0.i0.i0.i0.i0.u31.t62, i1.i0.i0.i0.i0.i0.i0.i1.u47.t61, i1.i0.i0.i0.i0.i0.i1.u48.t58, i1.i0.i0.i0.i0.i1.u52.t55, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/94/51/145
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2020-05-27 19:45:07] [INFO ] Flatten gal took : 15 ms
[2020-05-27 19:45:07] [INFO ] Input system was already deterministic with 145 transitions.
[2020-05-27 19:45:07] [INFO ] Transformed 159 places.
[2020-05-27 19:45:07] [INFO ] Transformed 145 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 19:45:07] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-27 19:45:07] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(((F(G("(p45==1)")))&&(G("(p155==1)")))U(G(F("(p45==1)"))))))
Formula 0 simplified : !X((FG"(p45==1)" & G"(p155==1)") U GF"(p45==1)")
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t15, t17, t18, t22, t23, t27, t29, t30, t34, t38, t40, t44, t45, t49, t51, t52, t53, t55, t56, t58, t59, t61, t62, t67, t68, t72, t74, t75, t79, t80, t84, t86, t87, t91, t95, t97, t101, t102, t106, t108, t109, t110, t112, t113, t115, t116, t118, t119, t120, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/94/51/145
Computing Next relation with stutter on 162 deadlock states
98 unique states visited
98 strongly connected components in search stack
99 transitions explored
98 items max in DFS search stack
21396 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,213.986,2432008,1,0,682,8.94876e+06,17,605,2204,1.81785e+07,750
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-002B-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((F(X("(p0==1)")))U(X((G((G("(p147==1)"))||("(p108==1)")))||("(p147!=1)"))))))
Formula 1 simplified : !X(FX"(p0==1)" U X("(p147!=1)" | G("(p108==1)" | G"(p147==1)")))
Computing Next relation with stutter on 162 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
267 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,216.668,2432836,1,0,682,8.94876e+06,49,605,2677,1.81785e+07,774
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-002B-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590608941813

--------------------
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="ShieldPPPt-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-002B, 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 r210-tajo-159033475900594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002B.tgz
mv ShieldPPPt-PT-002B 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 ;