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.r066-tajo-158922814700674.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 DiscoveryGPU-PT-11b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814700674
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.4K Mar 31 07:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 07:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 29 23:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 23:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 28 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 27 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 27 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 82K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-11b-00
FORMULA_NAME DiscoveryGPU-PT-11b-01
FORMULA_NAME DiscoveryGPU-PT-11b-02
FORMULA_NAME DiscoveryGPU-PT-11b-03
FORMULA_NAME DiscoveryGPU-PT-11b-04
FORMULA_NAME DiscoveryGPU-PT-11b-05
FORMULA_NAME DiscoveryGPU-PT-11b-06
FORMULA_NAME DiscoveryGPU-PT-11b-07
FORMULA_NAME DiscoveryGPU-PT-11b-08
FORMULA_NAME DiscoveryGPU-PT-11b-09
FORMULA_NAME DiscoveryGPU-PT-11b-10
FORMULA_NAME DiscoveryGPU-PT-11b-11
FORMULA_NAME DiscoveryGPU-PT-11b-12
FORMULA_NAME DiscoveryGPU-PT-11b-13
FORMULA_NAME DiscoveryGPU-PT-11b-14
FORMULA_NAME DiscoveryGPU-PT-11b-15

=== Now, execution of the tool begins

BK_START 1590130858307

[2020-05-22 07:00:59] [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-22 07:00:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 07:00:59] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2020-05-22 07:00:59] [INFO ] Transformed 324 places.
[2020-05-22 07:00:59] [INFO ] Transformed 344 transitions.
[2020-05-22 07:00:59] [INFO ] Found NUPN structural information;
[2020-05-22 07:00:59] [INFO ] Parsed PT model containing 324 places and 344 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 92635 steps, including 258 resets, run visited all 49 properties in 173 ms. (steps per millisecond=535 )
[2020-05-22 07:01:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-22 07:01:00] [INFO ] Flatten gal took : 59 ms
FORMULA DiscoveryGPU-PT-11b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 07:01:00] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 07:01:00] [INFO ] Applying decomposition
[2020-05-22 07:01:00] [INFO ] Flatten gal took : 18 ms
[2020-05-22 07:01:00] [INFO ] Input system was already deterministic with 344 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/graph13596316025938666336.txt, -o, /tmp/graph13596316025938666336.bin, -w, /tmp/graph13596316025938666336.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/graph13596316025938666336.bin, -l, -1, -v, -w, /tmp/graph13596316025938666336.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 07:01:00] [INFO ] Decomposing Gal with order
[2020-05-22 07:01:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:01:00] [INFO ] Removed a total of 94 redundant transitions.
[2020-05-22 07:01:00] [INFO ] Flatten gal took : 79 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 344 rows 324 cols
[2020-05-22 07:01:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2020-05-22 07:01:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
[2020-05-22 07:01:00] [INFO ] Computed 13 place invariants in 23 ms
inv : p0 + p308 + p318 + p319 + p320 + p321 + p322 + p323 = 1
inv : p0 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317 = 1
inv : p0 + p1 + p2 + p3 + p4 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 = 1
inv : p0 + p1 + p2 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 + p278 + p279 + p280 = 1
[2020-05-22 07:01:00] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
inv : p0 + p1 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 = 1
inv : p0 + p1 + p2 + p3 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 = 1
Total of 13 invariants.
[2020-05-22 07:01:00] [INFO ] Computed 13 place invariants in 26 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((F("(i22.i1.u78.p202==1)"))U(X(X("(i2.u6.p18!=1)"))))))||(G("(i28.i0.u99.p266!=1)"))))
Formula 0 simplified : !(FX(F"(i22.i1.u78.p202==1)" U XX"(i2.u6.p18!=1)") | G"(i28.i0.u99.p266!=1)")
built 85 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 4 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-22 07:01:01] [INFO ] Proved 324 variables to be positive in 452 ms
[2020-05-22 07:01:01] [INFO ] Computing symmetric may disable matrix : 344 transitions.
[2020-05-22 07:01:01] [INFO ] Computation of disable matrix completed :0/344 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:01:01] [INFO ] Computation of Complete disable matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:01:01] [INFO ] Computing symmetric may enable matrix : 344 transitions.
[2020-05-22 07:01:01] [INFO ] Computation of Complete enable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:01:03] [INFO ] Computing symmetric co enabling matrix : 344 transitions.
[2020-05-22 07:01:04] [INFO ] Computation of co-enabling matrix(34/344) took 1073 ms. Total solver calls (SAT/UNSAT): 2163(4/2159)
[2020-05-22 07:01:07] [INFO ] Computation of co-enabling matrix(163/344) took 4077 ms. Total solver calls (SAT/UNSAT): 5742(32/5710)
[2020-05-22 07:01:10] [INFO ] Computation of co-enabling matrix(234/344) took 7377 ms. Total solver calls (SAT/UNSAT): 7391(344/7047)
[2020-05-22 07:01:13] [INFO ] Computation of co-enabling matrix(272/344) took 10381 ms. Total solver calls (SAT/UNSAT): 8772(1431/7341)
[2020-05-22 07:01:15] [INFO ] Computation of Finished co-enabling matrix. took 12646 ms. Total solver calls (SAT/UNSAT): 10057(2519/7538)
[2020-05-22 07:01:16] [INFO ] Computing Do-Not-Accords matrix : 344 transitions.
[2020-05-22 07:01:16] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 07:01:16] [INFO ] Built C files in 15526ms 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 3978 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 80 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( <>(X((<>((LTLAP0==true)))U(X(X((LTLAP1==true))))))) || ( []((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, --when, --ltl, ( <>(X((<>((LTLAP0==true)))U(X(X((LTLAP1==true))))))) || ( []((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, --when, --ltl, ( <>(X((<>((LTLAP0==true)))U(X(X((LTLAP1==true))))))) || ( []((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)
Reverse transition relation is NOT exact ! Due to transitions t9, u115.t11, u115.t12, u115.t14, i2.u6.t216, i2.u6.t218, i3.i0.u9.t212, i3.i0.u9.t220, i4.u4.t206, i4.u4.t222, i5.i0.u17.t198, i5.i0.u17.t200, i5.i1.u15.t194, i5.i1.u15.t202, i6.i1.u14.t188, i6.i1.u14.t204, i7.u25.t179, i7.u25.t181, i8.i0.u28.t175, i8.i0.u28.t183, i9.u32.t169, i9.u32.t185, i10.u36.t160, i10.u36.t162, i11.i0.u34.t156, i11.i0.u34.t164, i12.u42.t150, i12.u42.t166, i13.u44.t131, i13.u44.t147, i14.u46.t141, i14.u46.t143, i15.i0.u49.t137, i15.i0.u49.t145, i16.u57.t122, i16.u57.t124, i17.i0.u60.t118, i17.i0.u60.t126, i18.u55.t112, i18.u55.t128, i19.u65.t93, i19.u65.t109, i20.u67.t103, i20.u67.t105, i21.i0.u70.t99, i21.i0.u70.t107, i22.i0.u75.t84, i22.i0.u75.t86, i22.i1.u78.t80, i22.i1.u78.t88, i23.i1.u82.t74, i23.i1.u82.t90, i24.u85.t65, i24.u85.t67, i25.i0.u88.t61, i25.i0.u88.t69, i26.u92.t55, i26.u92.t71, i27.u96.t46, i27.u96.t48, i28.i0.u99.t42, i28.i0.u99.t50, i29.u103.t36, i29.u103.t52, i30.i1.u105.t17, i30.i1.u105.t33, i31.i0.u106.t23, i31.i0.u106.t31, i32.u108.t27, i32.u108.t29, i34.t3, i34.u117.t4, i34.u117.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/271/73/344
Computing Next relation with stutter on 2048 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
6863 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,68.6852,1059548,1,0,2.33248e+06,364,2850,3.1098e+06,222,1309,8171172
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11b-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G((X(F(G("(i20.u67.p176==1)"))))||(G(F("((i5.i1.u15.p52==1)||(i19.u73.p195!=1))")))))U(X("(i19.u73.p195==1)"))))
Formula 1 simplified : !(G(XFG"(i20.u67.p176==1)" | GF"((i5.i1.u15.p52==1)||(i19.u73.p195!=1))") U X"(i19.u73.p195==1)")
Computing Next relation with stutter on 2048 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
12579 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,194.483,2213932,1,0,4.7453e+06,409,1192,6.76709e+06,116,1828,4833373
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((G((F("(i32.u109.p290==1)"))&&("(i22.i0.u75.p207==1)")))||(F((F("(i22.i1.u77.p211==1)"))&&("(i3.i1.u11.p30==1)"))))))
Formula 2 simplified : !G(G("(i22.i0.u75.p207==1)" & F"(i32.u109.p290==1)") | F("(i3.i1.u11.p30==1)" & F"(i22.i1.u77.p211==1)"))
Computing Next relation with stutter on 2048 deadlock states
157 unique states visited
157 strongly connected components in search stack
158 transitions explored
157 items max in DFS search stack
32631 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,520.792,5560444,1,0,1.0139e+07,409,1952,1.85831e+07,142,1828,19687071
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(G((G((F(G("(i17.i1.u62.p165==1)")))&&(X(F("(i8.i1.u29.p81==1)")))))U("((i28.i0.u99.p266==1)&&(i26.u92.p250==1))")))))
Formula 3 simplified : G(G(FG"(i17.i1.u62.p165==1)" & XF"(i8.i1.u29.p81==1)") U "((i28.i0.u99.p266==1)&&(i26.u92.p250==1))")
Computing Next relation with stutter on 2048 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
56197 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,1082.79,6961296,1,0,1.3297e+07,430,1211,2.35432e+07,115,2684,15278272
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((F(G("(i3.i1.u10.p27==1)")))&&(F(X(F(G("(i3.i1.u10.p27==1)")))))))
Formula 4 simplified : !(FG"(i3.i1.u10.p27==1)" & FXFG"(i3.i1.u10.p27==1)")
Computing Next relation with stutter on 2048 deadlock states
Detected timeout of ITS tools.
[2020-05-22 07:21:01] [INFO ] Applying decomposition
[2020-05-22 07:21:01] [INFO ] Flatten gal took : 23 ms
[2020-05-22 07:21:01] [INFO ] Decomposing Gal with order
[2020-05-22 07:21:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 07:21:01] [INFO ] Removed a total of 94 redundant transitions.
[2020-05-22 07:21:01] [INFO ] Flatten gal took : 26 ms
[2020-05-22 07:21:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 672 labels/synchronizations in 33 ms.
[2020-05-22 07:21:01] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-22 07:21:01] [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 9 LTL properties
Checking formula 0 : !(((F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p27==1)")))&&(F(X(F(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p27==1)")))))))
Formula 0 simplified : !(FG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p27==1)" & FXFG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p27==1)")
built 2 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u21.t17, i0.u21.t23, i0.u21.t27, i0.u21.t29, i0.u21.t31, i0.u21.t33, i0.i0.u20.t36, i0.i0.u20.t42, i0.i0.u20.t46, i0.i0.u20.t48, i0.i0.u20.t50, i0.i0.u20.t52, i0.i0.i0.u19.t55, i0.i0.i0.u19.t61, i0.i0.i0.u19.t65, i0.i0.i0.u19.t67, i0.i0.i0.u19.t69, i0.i0.i0.u19.t71, i0.i0.i0.i0.u18.t74, i0.i0.i0.i0.u18.t80, i0.i0.i0.i0.u18.t84, i0.i0.i0.i0.u18.t86, i0.i0.i0.i0.u18.t88, i0.i0.i0.i0.u18.t90, i0.i0.i0.i0.i0.u17.t93, i0.i0.i0.i0.i0.u17.t99, i0.i0.i0.i0.i0.u17.t103, i0.i0.i0.i0.i0.u17.t105, i0.i0.i0.i0.i0.u17.t107, i0.i0.i0.i0.i0.u17.t109, i0.i0.i0.i0.i0.i0.u16.t112, i0.i0.i0.i0.i0.i0.u16.t118, i0.i0.i0.i0.i0.i0.u16.t122, i0.i0.i0.i0.i0.i0.u16.t124, i0.i0.i0.i0.i0.i0.u16.t126, i0.i0.i0.i0.i0.i0.u16.t128, i0.i0.i0.i0.i0.i0.i0.u15.t131, i0.i0.i0.i0.i0.i0.i0.u15.t137, i0.i0.i0.i0.i0.i0.i0.u15.t141, i0.i0.i0.i0.i0.i0.i0.u15.t143, i0.i0.i0.i0.i0.i0.i0.u15.t145, i0.i0.i0.i0.i0.i0.i0.u15.t147, i0.i0.i0.i0.i0.i0.i0.i0.u14.t150, i0.i0.i0.i0.i0.i0.i0.i0.u14.t156, i0.i0.i0.i0.i0.i0.i0.i0.u14.t160, i0.i0.i0.i0.i0.i0.i0.i0.u14.t162, i0.i0.i0.i0.i0.i0.i0.i0.u14.t164, i0.i0.i0.i0.i0.i0.i0.i0.u14.t166, i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.t169, i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.t175, i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.t179, i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.t181, i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.t183, i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.t185, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t206, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t212, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t216, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t218, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t220, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.t222, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.t188, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.t194, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.t198, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.t200, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.t202, i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.t204, i1.u23.t9, i1.u23.t11, i1.u23.t12, i1.u23.t14, i1.u24.t3, i1.u24.t4, i1.u24.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/182/73/255
Computing Next relation with stutter on 2048 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
40353 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,403.555,2436228,1,0,3.2253e+06,291579,602,1.03406e+07,409,1.98114e+06,522074
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(X(!(F(X((X("((((i0.i0.i0.i0.i0.i0.i0.u15.p134==1)&&(i1.u23.p315==1))||(i0.i0.i0.i0.u18.p209==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p26!=1)||(i1.u23.p315!=1)))"))&&("((i0.i0.i0.i0.i0.i0.i0.u15.p125!=1)||(i1.u23.p315!=1))"))))))))
Formula 1 simplified : !FX!FX("((i0.i0.i0.i0.i0.i0.i0.u15.p125!=1)||(i1.u23.p315!=1))" & X"((((i0.i0.i0.i0.i0.i0.i0.u15.p134==1)&&(i1.u23.p315==1))||(i0.i0.i0.i0.u18.p209==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p26!=1)||(i1.u23.p315!=1)))")
Computing Next relation with stutter on 2048 deadlock states
153 unique states visited
153 strongly connected components in search stack
154 transitions explored
153 items max in DFS search stack
10427 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,507.828,2686680,1,0,4.02065e+06,325854,626,1.29271e+07,413,2.67472e+06,626503
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!((G(X("((i0.i0.i0.i0.i0.i0.i0.u15.p143==1)&&(i1.u23.p315==1))")))U(("((i0.i0.i0.i0.i0.i0.i0.u15.p143==1)&&(i1.u23.p315==1))")U("((i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p71==1)&&(i1.u23.p315==1))")))))
Formula 2 simplified : GX"((i0.i0.i0.i0.i0.i0.i0.u15.p143==1)&&(i1.u23.p315==1))" U ("((i0.i0.i0.i0.i0.i0.i0.u15.p143==1)&&(i1.u23.p315==1))" U "((i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p71==1)&&(i1.u23.p315==1))")
Computing Next relation with stutter on 2048 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
13 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,507.954,2686956,1,0,4.02065e+06,325854,791,1.29271e+07,472,2.67472e+06,632749
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11b-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X((F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p39==1)"))||("(i0.i0.i0.u19.p252==1)"))))&&(!(F("((i0.u21.p296==1)&&(i1.u23.p315==1))")))))
Formula 3 simplified : !(!X("(i0.i0.i0.u19.p252==1)" | F"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p39==1)") & !F"((i0.u21.p296==1)&&(i1.u23.p315==1))")
Computing Next relation with stutter on 2048 deadlock states
80 unique states visited
80 strongly connected components in search stack
81 transitions explored
80 items max in DFS search stack
22043 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,728.382,2957888,1,0,4.12986e+06,414473,779,1.49387e+07,467,3.72744e+06,680266
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G((G(F("(i0.i0.i0.i0.i0.u17.p196==1)")))&&("((i0.i0.i0.i0.i0.i0.i0.i0.u14.p105!=1)||(i1.u23.p315!=1))")))U(F(("((i0.i0.i0.i0.i0.i0.i0.i0.u14.p105==1)&&(i1.u23.p315==1))")U("((i0.i0.i0.u19.p247==1)&&(i1.u23.p315==1))"))))))
Formula 4 simplified : !X(G("((i0.i0.i0.i0.i0.i0.i0.i0.u14.p105!=1)||(i1.u23.p315!=1))" & GF"(i0.i0.i0.i0.i0.u17.p196==1)") U F("((i0.i0.i0.i0.i0.i0.i0.i0.u14.p105==1)&&(i1.u23.p315==1))" U "((i0.i0.i0.u19.p247==1)&&(i1.u23.p315==1))"))
Computing Next relation with stutter on 2048 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
17133 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,899.718,3254760,1,0,4.49536e+06,414473,586,1.53116e+07,409,3.72744e+06,411639
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((X(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p16==1)")))||("(i0.i0.i0.i0.u18.p209==1)"))U((X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p16==1)"))||("(i0.i0.i0.i0.i0.u17.p198==1)"))))
Formula 5 simplified : !(("(i0.i0.i0.i0.u18.p209==1)" | XG"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p16==1)") U ("(i0.i0.i0.i0.i0.u17.p198==1)" | X"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u11.p16==1)"))
Computing Next relation with stutter on 2048 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
3129 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,931.009,3254760,1,0,4.49536e+06,414473,898,1.53116e+07,526,3.72744e+06,1256932
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(G(X(!(X(G(F("(i0.u21.p281==1)")))))))))
Formula 6 simplified : !FGX!XGF"(i0.u21.p281==1)"
Computing Next relation with stutter on 2048 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
13551 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,1066.52,3582088,1,0,5.3428e+06,414473,584,1.71097e+07,409,3.72744e+06,331743
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((F(!(("(i0.i0.i0.u19.p230==1)")U(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p70==1)")U(G(X(G("((i0.i0.i0.i0.i0.i0.i0.u15.p132!=1)||(i1.u23.p315!=1))")))))))))
Formula 7 simplified : !F!("(i0.i0.i0.u19.p230==1)" U ("(i0.i0.i0.i0.i0.i0.i0.i0.i0.u13.p70==1)" U GXG"((i0.i0.i0.i0.i0.i0.i0.u15.p132!=1)||(i1.u23.p315!=1))"))
Computing Next relation with stutter on 2048 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
12639 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,1192.91,3582348,1,0,5.3428e+06,414473,770,1.71097e+07,473,3.72744e+06,962449
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11b-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F((!(X((G("(i0.i0.i0.i0.u18.p212==1)"))&&("(i0.i0.u20.p255==1)"))))U(X("((i0.i0.i0.i0.i0.i0.u16.p172==1)&&(i1.u23.p315==1))"))))||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p54==1)"))))
Formula 8 simplified : !(F(!X("(i0.i0.u20.p255==1)" & G"(i0.i0.i0.i0.u18.p212==1)") U X"((i0.i0.i0.i0.i0.i0.u16.p172==1)&&(i1.u23.p315==1))") | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u12.p54==1)")
Computing Next relation with stutter on 2048 deadlock states
Detected timeout of ITS tools.
[2020-05-22 07:41:01] [INFO ] Flatten gal took : 28 ms
[2020-05-22 07:41:01] [INFO ] Input system was already deterministic with 344 transitions.
[2020-05-22 07:41:01] [INFO ] Transformed 324 places.
[2020-05-22 07:41:01] [INFO ] Transformed 344 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-22 07:41:01] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
[2020-05-22 07:41:01] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 14 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 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F((!(X((G("(p212==1)"))&&("(p255==1)"))))U(X("((p172==1)&&(p315==1))"))))||(G("(p54==1)"))))
Formula 0 simplified : !(F(!X("(p255==1)" & G"(p212==1)") U X"((p172==1)&&(p315==1))") | G"(p54==1)")

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DiscoveryGPU-PT-11b"
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 DiscoveryGPU-PT-11b, 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 r066-tajo-158922814700674"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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