fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r227-oct2-159033546100050
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for SmartHome-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.310 46128.00 81586.00 86.00 FFFFFFFFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r227-oct2-159033546100050.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.5K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 21:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 63K 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 SmartHome-PT-07-00
FORMULA_NAME SmartHome-PT-07-01
FORMULA_NAME SmartHome-PT-07-02
FORMULA_NAME SmartHome-PT-07-03
FORMULA_NAME SmartHome-PT-07-04
FORMULA_NAME SmartHome-PT-07-05
FORMULA_NAME SmartHome-PT-07-06
FORMULA_NAME SmartHome-PT-07-07
FORMULA_NAME SmartHome-PT-07-08
FORMULA_NAME SmartHome-PT-07-09
FORMULA_NAME SmartHome-PT-07-10
FORMULA_NAME SmartHome-PT-07-11
FORMULA_NAME SmartHome-PT-07-12
FORMULA_NAME SmartHome-PT-07-13
FORMULA_NAME SmartHome-PT-07-14
FORMULA_NAME SmartHome-PT-07-15

=== Now, execution of the tool begins

BK_START 1590483677637

[2020-05-26 09:01:19] [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-26 09:01:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:01:19] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-05-26 09:01:19] [INFO ] Transformed 251 places.
[2020-05-26 09:01:19] [INFO ] Transformed 290 transitions.
[2020-05-26 09:01:19] [INFO ] Found NUPN structural information;
[2020-05-26 09:01:19] [INFO ] Parsed PT model containing 251 places and 290 transitions in 88 ms.
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 30 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 571 resets, run finished after 142 ms. (steps per millisecond=704 ) properties seen :[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, 1, 1, 1]
// Phase 1: matrix 260 rows 222 cols
[2020-05-26 09:01:19] [INFO ] Computed 10 place invariants in 8 ms
[2020-05-26 09:01:19] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2020-05-26 09:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:19] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2020-05-26 09:01:19] [INFO ] Deduced a trap composed of 40 places in 75 ms
[2020-05-26 09:01:20] [INFO ] Deduced a trap composed of 36 places in 61 ms
[2020-05-26 09:01:20] [INFO ] Deduced a trap composed of 46 places in 32 ms
[2020-05-26 09:01:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2020-05-26 09:01:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 487 ms returned sat
[2020-05-26 09:01:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:21] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2020-05-26 09:01:21] [INFO ] Deduced a trap composed of 41 places in 93 ms
[2020-05-26 09:01:21] [INFO ] Deduced a trap composed of 37 places in 141 ms
[2020-05-26 09:01:21] [INFO ] Deduced a trap composed of 30 places in 148 ms
[2020-05-26 09:01:21] [INFO ] Deduced a trap composed of 46 places in 66 ms
[2020-05-26 09:01:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 543 ms
[2020-05-26 09:01:21] [INFO ] Computed and/alt/rep : 259/747/259 causal constraints in 30 ms.
[2020-05-26 09:01:23] [INFO ] Added : 253 causal constraints over 51 iterations in 1366 ms. Result :sat
[2020-05-26 09:01:23] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-26 09:01:23] [INFO ] Flatten gal took : 51 ms
FORMULA SmartHome-PT-07-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-07-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:01:23] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-26 09:01:23] [INFO ] Applying decomposition
[2020-05-26 09:01:23] [INFO ] Flatten gal took : 16 ms
[2020-05-26 09:01:23] [INFO ] Input system was already deterministic with 260 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/graph12564778648051144279.txt, -o, /tmp/graph12564778648051144279.bin, -w, /tmp/graph12564778648051144279.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/graph12564778648051144279.bin, -l, -1, -v, -w, /tmp/graph12564778648051144279.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:01:23] [INFO ] Decomposing Gal with order
[2020-05-26 09:01:23] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 260 rows 222 cols
[2020-05-26 09:01:23] [INFO ] Computed 10 place invariants in 3 ms
inv : p0 + p1 + p13 + p14 + p15 + p16 + p80 + p81 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 + p102 + p106 + p107 + p108 + p109 + p110 = 1
inv : p0 + p221 + p228 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p249 + p250 = 1
inv : p0 + p1 + p13 + p14 + p15 + p16 + p17 + p49 + p50 + p52 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 = 1
inv : p0 + p1 + p13 + p14 + p142 + p143 + p145 + 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 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 = 1
inv : p0 + p1 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p221 + p222 + p223 + p224 + p225 + p226 + p227 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 = 1
inv : p0 + p1 + p13 + p190 + p191 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p216 + p217 + p218 + p219 + p220 = 1
inv : p0 + p221 + p228 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 = 1
inv : p0 + p1 + p13 + p14 + p15 + p111 + p112 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p137 + p138 + p139 + p140 + p141 = 1
Total of 10 invariants.
[2020-05-26 09:01:23] [INFO ] Computed 10 place invariants in 5 ms
[2020-05-26 09:01:23] [INFO ] Removed a total of 54 redundant transitions.
[2020-05-26 09:01:23] [INFO ] Flatten gal took : 42 ms
[2020-05-26 09:01:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2020-05-26 09:01:23] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-26 09:01:23] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !(((!((X("(i7.i1.u55.p167==1)"))U(F("(i5.i0.u43.p138==1)"))))U("(i7.i1.u55.p167==1)")))
Formula 0 simplified : !(!(X"(i7.i1.u55.p167==1)" U F"(i5.i0.u43.p138==1)") U "(i7.i1.u55.p167==1)")
built 25 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 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 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 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.
[2020-05-26 09:01:24] [INFO ] Proved 222 variables to be positive in 245 ms
[2020-05-26 09:01:24] [INFO ] Computing symmetric may disable matrix : 260 transitions.
[2020-05-26 09:01:24] [INFO ] Computation of disable matrix completed :0/260 took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:24] [INFO ] Computation of Complete disable matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:24] [INFO ] Computing symmetric may enable matrix : 260 transitions.
[2020-05-26 09:01:24] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t20, t57, t112, t148, t219, u1.t251, u1.t252, u1.t253, u1.t254, u1.t255, u1.t256, u1.t257, u1.t258, u1.t259, u1.t260, i1.i0.t244, i1.i0.t246, i1.i0.u4.t220, i3.t184, i3.i1.t188, i3.i1.u21.t185, i4.t173, i4.i0.u25.t149, i5.i0.t137, i5.i0.t139, i5.i0.u43.t113, i9.i0.t62, i9.i0.t97, i9.i0.t101, i9.i0.t103, i9.i0.u61.t58, i9.i0.u61.t59, i10.i0.t45, i10.i0.t47, i10.i0.u64.t21, i11.i0.t6, i11.i0.u76.t10, i11.i0.u76.t11, i11.i0.u76.t12, i11.i0.u76.t13, i11.i0.u76.t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/210/41/251
Computing Next relation with stutter on 14 deadlock states
30 unique states visited
30 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
98 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.00629,51648,1,0,72650,1783,3182,117255,508,9099,188071
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-07-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(F(X(((!(G("(i5.i0.u37.p120==1)")))||(G(("(i10.i1.u70.p208==1)")U("(i9.i0.u46.p148==1)"))))&&("(i9.i0.u46.p148==1)"))))))
Formula 1 simplified : FX("(i9.i0.u46.p148==1)" & (!G"(i5.i0.u37.p120==1)" | G("(i10.i1.u70.p208==1)" U "(i9.i0.u46.p148==1)")))
Computing Next relation with stutter on 14 deadlock states
[2020-05-26 09:01:24] [INFO ] Computing symmetric co enabling matrix : 260 transitions.
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.22936,59912,1,0,85607,1828,3230,152875,510,9591,216221
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-07-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(X(F((F("(i2.i0.u14.p18==1)"))U("(i8.i1.u51.p158!=1)")))))))
Formula 2 simplified : !FGXF(F"(i2.i0.u14.p18==1)" U "(i8.i1.u51.p158!=1)")
Computing Next relation with stutter on 14 deadlock states
31 unique states visited
31 strongly connected components in search stack
32 transitions explored
31 items max in DFS search stack
45 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.68902,74676,1,0,116312,1828,3245,204994,510,9603,256973
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-07-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F(((G("(i3.i2.u23.p49==1)"))&&("(i10.i0.u64.p217==1)"))&&("(i11.i0.u76.p222==1)")))&&(F("(i3.i2.u23.p49==1)")))))
Formula 3 simplified : !G(F("(i10.i0.u64.p217==1)" & "(i11.i0.u76.p222==1)" & G"(i3.i2.u23.p49==1)") & F"(i3.i2.u23.p49==1)")
Computing Next relation with stutter on 14 deadlock states
57 unique states visited
57 strongly connected components in search stack
58 transitions explored
57 items max in DFS search stack
63 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,2.32283,92860,1,0,148607,1848,3332,290604,510,9876,307111
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-07-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(("(i9.i0.u61.p185!=1)")U(("((i1.i0.u4.p45==1)&&(i11.i0.u76.p222==1))")U(G(F("(i9.i0.u61.p185==1)"))))))))
Formula 4 simplified : !F!("(i9.i0.u61.p185!=1)" U ("((i1.i0.u4.p45==1)&&(i11.i0.u76.p222==1))" U GF"(i9.i0.u61.p185==1)"))
Computing Next relation with stutter on 14 deadlock states
[2020-05-26 09:01:27] [INFO ] Computation of co-enabling matrix(58/260) took 2174 ms. Total solver calls (SAT/UNSAT): 2361(30/2331)
[2020-05-26 09:01:30] [INFO ] Computation of co-enabling matrix(90/260) took 5191 ms. Total solver calls (SAT/UNSAT): 3465(35/3430)
[2020-05-26 09:01:33] [INFO ] Computation of co-enabling matrix(174/260) took 8215 ms. Total solver calls (SAT/UNSAT): 5282(96/5186)
[2020-05-26 09:01:36] [INFO ] Computation of co-enabling matrix(250/260) took 11247 ms. Total solver calls (SAT/UNSAT): 6317(191/6126)
[2020-05-26 09:01:36] [INFO ] Computation of Finished co-enabling matrix. took 11844 ms. Total solver calls (SAT/UNSAT): 6353(227/6126)
[2020-05-26 09:01:36] [INFO ] Computing Do-Not-Accords matrix : 260 transitions.
[2020-05-26 09:01:36] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:36] [INFO ] Built C files in 13400ms 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 2366 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 67 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(!( ((LTLAP10==true))U(((LTLAP11==true))U([](<>((LTLAP12==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, <>(!( ((LTLAP10==true))U(((LTLAP11==true))U([](<>((LTLAP12==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, <>(!( ((LTLAP10==true))U(((LTLAP11==true))U([](<>((LTLAP12==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
2975 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,32.0842,608420,1,0,1.00057e+06,1855,3364,1.86154e+06,512,10227,1128624
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-07-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(F(!(G(!(F(X("(i6.i0.u45.p141==1)")))))))))
Formula 5 simplified : F!G!FX"(i6.i0.u45.p141==1)"
Computing Next relation with stutter on 14 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
11 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,32.2051,611320,1,0,1.00689e+06,1855,3393,1.86904e+06,512,10250,1141995
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-07-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((("(i5.i1.u40.p127!=1)")U(((F("((i9.i0.u61.p185==1)&&(i11.i0.u75.p245==1))"))&&("(i9.i0.u61.p185==1)"))&&("(i11.i0.u75.p245==1)")))||(X("(i2.i0.u13.p46==1)"))))
Formula 6 simplified : !(("(i5.i1.u40.p127!=1)" U ("(i9.i0.u61.p185==1)" & "(i11.i0.u75.p245==1)" & F"((i9.i0.u61.p185==1)&&(i11.i0.u75.p245==1))")) | X"(i2.i0.u13.p46==1)")
Computing Next relation with stutter on 14 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
48 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,32.6792,627876,1,0,1.04314e+06,1858,3478,1.91744e+06,512,10300,1192430
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-07-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((X(F(X("((i3.i1.u21.p76==1)&&(i3.i1.u77.p233==1))"))))&&("(i5.i1.u42.p131==1)"))))
Formula 7 simplified : !X("(i5.i1.u42.p131==1)" & XFX"((i3.i1.u21.p76==1)&&(i3.i1.u77.p233==1))")
Computing Next relation with stutter on 14 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,32.681,628140,1,0,1.04317e+06,1858,3486,1.91749e+06,512,10300,1192575
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-07-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(("(i10.i0.u66.p196==1)")U(G("((i3.i2.u22.p77==1)||(i8.i0.u50.p170!=1))"))))||((X("(i8.i1.u58.p174!=1)"))U(X("(i9.i0.u61.p185==1)")))))
Formula 8 simplified : !(G("(i10.i0.u66.p196==1)" U G"((i3.i2.u22.p77==1)||(i8.i0.u50.p170!=1))") | (X"(i8.i1.u58.p174!=1)" U X"(i9.i0.u61.p185==1)"))
Computing Next relation with stutter on 14 deadlock states
30 unique states visited
0 strongly connected components in search stack
30 transitions explored
30 items max in DFS search stack
6 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,32.7552,629900,1,0,1.04745e+06,1858,3554,1.92317e+06,512,10302,1202707
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA SmartHome-PT-07-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((X(X(!(X(F("(i4.i0.u29.p92==1)"))))))||(F(("(i11.i0.u76.p226==1)")U("(i9.i0.u61.p143==1)")))))
Formula 9 simplified : !(XX!XF"(i4.i0.u29.p92==1)" | F("(i11.i0.u76.p226==1)" U "(i9.i0.u61.p143==1)"))
Computing Next relation with stutter on 14 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
124 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,34.0261,673724,1,0,1.13598e+06,1905,3609,2.08909e+06,512,11496,1320749
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA SmartHome-PT-07-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1590483723765

--------------------
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="SmartHome-PT-07"
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 SmartHome-PT-07, 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 r227-oct2-159033546100050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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