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-159033546100058.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-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.1K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 19K May 13 21:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.0K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 64K 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-08-00
FORMULA_NAME SmartHome-PT-08-01
FORMULA_NAME SmartHome-PT-08-02
FORMULA_NAME SmartHome-PT-08-03
FORMULA_NAME SmartHome-PT-08-04
FORMULA_NAME SmartHome-PT-08-05
FORMULA_NAME SmartHome-PT-08-06
FORMULA_NAME SmartHome-PT-08-07
FORMULA_NAME SmartHome-PT-08-08
FORMULA_NAME SmartHome-PT-08-09
FORMULA_NAME SmartHome-PT-08-10
FORMULA_NAME SmartHome-PT-08-11
FORMULA_NAME SmartHome-PT-08-12
FORMULA_NAME SmartHome-PT-08-13
FORMULA_NAME SmartHome-PT-08-14
FORMULA_NAME SmartHome-PT-08-15

=== Now, execution of the tool begins

BK_START 1590483694065

[2020-05-26 09:01:36] [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:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:01:36] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-05-26 09:01:36] [INFO ] Transformed 252 places.
[2020-05-26 09:01:36] [INFO ] Transformed 291 transitions.
[2020-05-26 09:01:36] [INFO ] Found NUPN structural information;
[2020-05-26 09:01:36] [INFO ] Parsed PT model containing 252 places and 291 transitions in 98 ms.
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 21 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 67 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 580 resets, run finished after 193 ms. (steps per millisecond=518 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 270 rows 232 cols
[2020-05-26 09:01:36] [INFO ] Computed 11 place invariants in 10 ms
[2020-05-26 09:01:37] [INFO ] [Real]Absence check using 11 positive place invariants in 41 ms returned sat
[2020-05-26 09:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:37] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2020-05-26 09:01:37] [INFO ] Deduced a trap composed of 32 places in 113 ms
[2020-05-26 09:01:37] [INFO ] Deduced a trap composed of 46 places in 228 ms
[2020-05-26 09:01:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2020-05-26 09:01:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 144 ms returned sat
[2020-05-26 09:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:38] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-05-26 09:01:38] [INFO ] Deduced a trap composed of 32 places in 97 ms
[2020-05-26 09:01:38] [INFO ] Deduced a trap composed of 46 places in 46 ms
[2020-05-26 09:01:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2020-05-26 09:01:38] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 45 ms.
[2020-05-26 09:01:40] [INFO ] Added : 266 causal constraints over 54 iterations in 1662 ms. Result :sat
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 56 places in 55 ms
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 27 places in 35 ms
[2020-05-26 09:01:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2020-05-26 09:01:40] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:40] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-05-26 09:01:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 409 ms returned sat
[2020-05-26 09:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:41] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 27 places in 174 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 27 places in 108 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 31 places in 57 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 46 places in 43 ms
[2020-05-26 09:01:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 507 ms
[2020-05-26 09:01:41] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 20 ms.
[2020-05-26 09:01:43] [INFO ] Added : 269 causal constraints over 54 iterations in 1455 ms. Result :sat
[2020-05-26 09:01:44] [INFO ] Deduced a trap composed of 52 places in 966 ms
[2020-05-26 09:01:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1027 ms
[2020-05-26 09:01:44] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:44] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 33 places in 84 ms
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 38 places in 67 ms
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 27 places in 50 ms
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 46 places in 53 ms
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 32 places in 30 ms
[2020-05-26 09:01:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 371 ms
[2020-05-26 09:01:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 130 ms returned sat
[2020-05-26 09:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:45] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 32 places in 98 ms
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 38 places in 61 ms
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 27 places in 43 ms
[2020-05-26 09:01:45] [INFO ] Deduced a trap composed of 46 places in 47 ms
[2020-05-26 09:01:46] [INFO ] Deduced a trap composed of 32 places in 226 ms
[2020-05-26 09:01:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 564 ms
[2020-05-26 09:01:46] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 15 ms.
[2020-05-26 09:01:47] [INFO ] Added : 267 causal constraints over 54 iterations in 1526 ms. Result :sat
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 36 places in 388 ms
[2020-05-26 09:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2020-05-26 09:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:48] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 33 places in 56 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 39 places in 47 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 27 places in 49 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 46 places in 32 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 32 places in 21 ms
[2020-05-26 09:01:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 333 ms
[2020-05-26 09:01:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 121 ms returned sat
[2020-05-26 09:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:48] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 32 places in 195 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 39 places in 136 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 27 places in 136 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 46 places in 46 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 32 places in 28 ms
[2020-05-26 09:01:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 626 ms
[2020-05-26 09:01:49] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 24 ms.
[2020-05-26 09:01:50] [INFO ] Added : 269 causal constraints over 54 iterations in 1050 ms. Result :sat
[2020-05-26 09:01:50] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:50] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-05-26 09:01:50] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 13 ms.
[2020-05-26 09:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 112 ms returned sat
[2020-05-26 09:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:51] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2020-05-26 09:01:51] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 11 ms.
[2020-05-26 09:01:52] [INFO ] Added : 269 causal constraints over 54 iterations in 927 ms. Result :sat
[2020-05-26 09:01:52] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-05-26 09:01:52] [INFO ] Flatten gal took : 71 ms
FORMULA SmartHome-PT-08-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:01:52] [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:52] [INFO ] Applying decomposition
[2020-05-26 09:01:52] [INFO ] Flatten gal took : 11 ms
[2020-05-26 09:01:52] [INFO ] Input system was already deterministic with 270 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/graph7530584163399609173.txt, -o, /tmp/graph7530584163399609173.bin, -w, /tmp/graph7530584163399609173.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/graph7530584163399609173.bin, -l, -1, -v, -w, /tmp/graph7530584163399609173.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-26 09:01:52] [INFO ] Decomposing Gal with order
[2020-05-26 09:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 270 rows 232 cols
[2020-05-26 09:01:52] [INFO ] Computed 11 place invariants in 3 ms
[2020-05-26 09:01:52] [INFO ] Removed a total of 54 redundant transitions.
inv : p0 + p221 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 = 1
inv : p0 + p1 + p13 + p14 + p15 + p111 + p112 + p113 + 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
inv : p0 + p221 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p243 + p244 + p245 + p246 + p250 + p251 = 1
inv : p0 + p1 + 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 + p38 + p39 + p40 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p1 + p13 + p14 + p142 + p143 + p144 + 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 + p221 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p243 + p244 + p245 + p246 + p247 + p248 + p249 = 1
inv : p0 + p1 + p13 + p14 + p15 + p16 + p17 + p49 + p50 + p51 + p52 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 = 1
inv : p0 + p1 + p13 + p190 + p191 + p192 + 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 + p1 + p13 + p14 + p15 + p16 + p80 + p81 + p82 + 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 + p222 + p223 + p224 + p225 + p226 + p227 = 1
Total of 11 invariants.
[2020-05-26 09:01:52] [INFO ] Computed 11 place invariants in 19 ms
[2020-05-26 09:01:52] [INFO ] Flatten gal took : 150 ms
[2020-05-26 09:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 9 ms.
[2020-05-26 09:01:52] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-26 09:01:52] [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 11 LTL properties
Checking formula 0 : !(((!((("(i5.i1.u38.p124==1)")U(F("(i3.i1.u16.p61==1)")))U(X(F("(i5.i1.u38.p124==1)")))))U("(i8.i0.u50.p157==1)")))
Formula 0 simplified : !(!(("(i5.i1.u38.p124==1)" U F"(i3.i1.u16.p61==1)") U XF"(i5.i1.u38.p124==1)") U "(i8.i0.u50.p157==1)")
built 29 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 3 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 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 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
[2020-05-26 09:01:53] [INFO ] Proved 232 variables to be positive in 585 ms
[2020-05-26 09:01:53] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2020-05-26 09:01:53] [INFO ] Computation of disable matrix completed :0/270 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:53] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:53] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2020-05-26 09:01:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t20, t57, t112, 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, i1.i0.u4.t248, i3.t184, i3.i1.t188, i3.i1.u22.t185, i3.i1.u22.t213, i4.t148, i4.i0.t173, i4.i0.t175, i4.i0.u33.t149, i4.i0.u33.t177, i5.i0.t137, i5.i0.t139, i5.i0.u43.t113, i5.i0.u43.t141, i6.t103, i6.t101, i6.t97, i6.t62, i6.u61.t58, i6.u61.t59, i6.u61.t105, i10.i0.t45, i10.i0.t47, i10.i0.u64.t21, i10.i0.u64.t49, i11.t5, i11.u75.t10, i11.u75.t11, i11.u75.t12, i11.u75.t13, i11.u75.t14, i11.u77.t9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/215/49/264
Computing Next relation with stutter on 29 deadlock states
[2020-05-26 09:01:55] [INFO ] Computing symmetric co enabling matrix : 270 transitions.
[2020-05-26 09:01:56] [INFO ] Computation of co-enabling matrix(0/270) took 572 ms. Total solver calls (SAT/UNSAT): 23(0/23)
29 unique states visited
29 strongly connected components in search stack
29 transitions explored
29 items max in DFS search stack
477 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,4.8111,166816,1,0,308411,2360,3258,479166,546,11093,892677
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-08-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(G(!(G((F("(i1.i1.u10.p32==1)"))||("(i11.u76.p0==1)"))))))||(G("(i11.u76.p0==1)"))))
Formula 1 simplified : !(XG!G("(i11.u76.p0==1)" | F"(i1.i1.u10.p32==1)") | G"(i11.u76.p0==1)")
Computing Next relation with stutter on 29 deadlock states
[2020-05-26 09:01:59] [INFO ] Computation of co-enabling matrix(33/270) took 3764 ms. Total solver calls (SAT/UNSAT): 1445(8/1437)
[2020-05-26 09:02:02] [INFO ] Computation of co-enabling matrix(51/270) took 6786 ms. Total solver calls (SAT/UNSAT): 1958(18/1940)
[2020-05-26 09:02:05] [INFO ] Computation of co-enabling matrix(96/270) took 9885 ms. Total solver calls (SAT/UNSAT): 3758(36/3722)
[2020-05-26 09:02:08] [INFO ] Computation of co-enabling matrix(168/270) took 12914 ms. Total solver calls (SAT/UNSAT): 5412(87/5325)
[2020-05-26 09:02:12] [INFO ] Computation of co-enabling matrix(247/270) took 16389 ms. Total solver calls (SAT/UNSAT): 6843(144/6699)
[2020-05-26 09:02:14] [INFO ] Computation of Finished co-enabling matrix. took 18098 ms. Total solver calls (SAT/UNSAT): 6944(230/6714)
[2020-05-26 09:02:14] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2020-05-26 09:02:14] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:02:14] [INFO ] Built C files in 21765ms 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 4013 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 293 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X([](!( [](( <>((LTLAP3==true))) || ( (LTLAP4==true)) )) ))) || ( []((LTLAP4==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([](!( [](( <>((LTLAP3==true))) || ( (LTLAP4==true)) )) ))) || ( []((LTLAP4==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([](!( [](( <>((LTLAP3==true))) || ( (LTLAP4==true)) )) ))) || ( []((LTLAP4==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)
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
3172 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,36.5587,909844,1,0,1.8721e+06,2407,3347,2.2364e+06,546,12480,2866132
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-08-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((X("(i1.i1.u10.p33==1)"))&&(!(G(X("((i3.i1.u22.p76==1)&&(i3.i1.u22.p241==1))")))))))
Formula 2 simplified : !G(X"(i1.i1.u10.p33==1)" & !GX"((i3.i1.u22.p76==1)&&(i3.i1.u22.p241==1))")
Computing Next relation with stutter on 29 deadlock states
32 unique states visited
32 strongly connected components in search stack
33 transitions explored
32 items max in DFS search stack
30 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,36.8837,920344,1,0,1.89545e+06,2407,3358,2.26837e+06,548,12480,2903468
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SmartHome-PT-08-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(G(F("(i0.i3.u74.p220==1)"))))))
Formula 3 simplified : !GFGF"(i0.i3.u74.p220==1)"
Computing Next relation with stutter on 29 deadlock states
31 unique states visited
31 strongly connected components in search stack
32 transitions explored
31 items max in DFS search stack
16 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,37.0727,925076,1,0,1.90571e+06,2407,3407,2.28257e+06,548,12482,2931470
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-08-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((G(F((!(F("(i5.i1.u40.p127==1)")))||(G("(i3.i0.u20.p69!=1)"))))))
Formula 4 simplified : !GF(!F"(i5.i1.u40.p127==1)" | G"(i3.i0.u20.p69!=1)")
Computing Next relation with stutter on 29 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
13192 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,168.993,2262788,1,0,4.42113e+06,2447,1008,6.38914e+06,255,14278,4768064
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-08-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((("(i5.i0.u42.p123==1)")U(X(G("(i5.i0.u37.p122==1)")))))
Formula 5 simplified : !("(i5.i0.u42.p123==1)" U XG"(i5.i0.u37.p122==1)")
Computing Next relation with stutter on 29 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
157 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,170.572,2313428,1,0,4.42113e+06,2447,1888,6.55121e+06,330,14278,4988707
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-08-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(F((("(i6.u47.p147==1)")U(X("(i3.i0.u19.p65==1)")))&&((("(i0.i1.u13.p47==1)")U(X("(i3.i0.u19.p65==1)")))U("(i0.i1.u13.p47==1)"))))))
Formula 6 simplified : F(("(i6.u47.p147==1)" U X"(i3.i0.u19.p65==1)") & (("(i0.i1.u13.p47==1)" U X"(i3.i0.u19.p65==1)") U "(i0.i1.u13.p47==1)"))
Computing Next relation with stutter on 29 deadlock states
91 unique states visited
60 strongly connected components in search stack
100 transitions explored
89 items max in DFS search stack
2640 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,196.968,2515816,1,0,4.6796e+06,2447,1632,7.06828e+06,308,14278,65607
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-08-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((X(G("(i0.i3.u73.p218==1)")))U(X(F(X((!(X("(u1.p11==1)")))&&("(i3.i2.u23.p77==1)"))))))))
Formula 7 simplified : !X(XG"(i0.i3.u73.p218==1)" U XFX("(i3.i2.u23.p77==1)" & !X"(u1.p11==1)"))
Computing Next relation with stutter on 29 deadlock states
29 unique states visited
29 strongly connected components in search stack
29 transitions explored
29 items max in DFS search stack
50 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,197.472,2516020,1,0,4.6796e+06,2447,1895,7.06828e+06,332,14278,204544
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SmartHome-PT-08-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F("((i3.i1.u22.p76==1)&&(i3.i1.u22.p241==1))"))))
Formula 8 simplified : F"((i3.i1.u22.p76==1)&&(i3.i1.u22.p241==1))"
Computing Next relation with stutter on 29 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
32 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,197.788,2516020,1,0,4.6796e+06,2447,1924,7.06828e+06,339,14278,305401
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA SmartHome-PT-08-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(G(((X("(i4.i1.u29.p97==1)"))U(X(((((((((F("(i3.i1.u78.p231==1)"))&&("(i3.i1.u78.p231==1)"))&&("(i1.i0.u4.p21==1)"))&&("(i3.i1.u22.p52==1)"))&&("(i4.i0.u33.p83==1)"))&&("(i5.i0.u43.p114==1)"))&&("(i6.u61.p145==1)"))&&("(i10.i0.u64.p193==1)"))&&("(i3.i1.u78.p230==1)"))))&&("(i3.i1.u78.p231==1)"))))))
Formula 9 simplified : XG("(i3.i1.u78.p231==1)" & (X"(i4.i1.u29.p97==1)" U X("(i1.i0.u4.p21==1)" & "(i3.i1.u22.p52==1)" & "(i3.i1.u78.p230==1)" & "(i3.i1.u78.p231==1)" & "(i4.i0.u33.p83==1)" & "(i5.i0.u43.p114==1)" & "(i6.u61.p145==1)" & "(i10.i0.u64.p193==1)" & F"(i3.i1.u78.p231==1)")))
Computing Next relation with stutter on 29 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,197.797,2516284,1,0,4.6796e+06,2447,1931,7.06828e+06,339,14278,305415
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA SmartHome-PT-08-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(G(X(X("(i3.i0.u18.p63==1)"))))))
Formula 10 simplified : GXX"(i3.i0.u18.p63==1)"
Computing Next relation with stutter on 29 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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,197.798,2516284,1,0,4.6796e+06,2447,1947,7.06828e+06,339,14278,305437
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA SmartHome-PT-08-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1590483911963

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

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