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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.230 27733.00 54454.00 59.50 TTTTFFTTFTTFTFFT 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-159033546100057.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-oct2-159033546100057
=====================================================================

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

[2020-05-26 09:01:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-26 09:01:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-26 09:01:35] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2020-05-26 09:01:35] [INFO ] Transformed 252 places.
[2020-05-26 09:01:35] [INFO ] Transformed 291 transitions.
[2020-05-26 09:01:35] [INFO ] Found NUPN structural information;
[2020-05-26 09:01:35] [INFO ] Parsed PT model containing 252 places and 291 transitions in 111 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/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 570 resets, run finished after 256 ms. (steps per millisecond=390 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 270 rows 232 cols
[2020-05-26 09:01:35] [INFO ] Computed 11 place invariants in 8 ms
[2020-05-26 09:01:35] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2020-05-26 09:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:35] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-05-26 09:01:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 32 ms returned unsat
[2020-05-26 09:01:36] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-05-26 09:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:36] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2020-05-26 09:01:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 352 ms returned sat
[2020-05-26 09:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:37] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2020-05-26 09:01:38] [INFO ] Deduced a trap composed of 27 places in 1147 ms
[2020-05-26 09:01:38] [INFO ] Deduced a trap composed of 47 places in 119 ms
[2020-05-26 09:01:38] [INFO ] Deduced a trap composed of 32 places in 118 ms
[2020-05-26 09:01:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1443 ms
[2020-05-26 09:01:38] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 25 ms.
[2020-05-26 09:01:40] [INFO ] Added : 269 causal constraints over 54 iterations in 1349 ms. Result :sat
[2020-05-26 09:01:40] [INFO ] Deduced a trap composed of 29 places in 98 ms
[2020-05-26 09:01:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 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 228 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 103 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 365 ms returned sat
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 35 places in 162 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 36 places in 59 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 53 places in 57 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 53 places in 51 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 56 places in 86 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 77 places in 44 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 56 places in 41 ms
[2020-05-26 09:01:41] [INFO ] Deduced a trap composed of 74 places in 31 ms
[2020-05-26 09:01:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 776 ms
[2020-05-26 09:01:41] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 17 ms.
[2020-05-26 09:01:43] [INFO ] Added : 267 causal constraints over 54 iterations in 1681 ms. Result :sat
[2020-05-26 09:01:43] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-26 09:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:43] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-05-26 09:01:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned unsat
[2020-05-26 09:01:43] [INFO ] [Real]Absence check using 11 positive place invariants in 78 ms returned sat
[2020-05-26 09:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:44] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2020-05-26 09:01:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned unsat
[2020-05-26 09:01:44] [INFO ] [Real]Absence check using 11 positive place invariants in 23 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 135 ms returned sat
[2020-05-26 09:01:44] [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 407 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 653 ms returned sat
[2020-05-26 09:01:46] [INFO ] Deduced a trap composed of 27 places in 547 ms
[2020-05-26 09:01:47] [INFO ] Deduced a trap composed of 35 places in 1281 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 54 places in 1176 ms
[2020-05-26 09:01:48] [INFO ] Deduced a trap composed of 58 places in 57 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 29 places in 93 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 47 places in 69 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 31 places in 73 ms
[2020-05-26 09:01:49] [INFO ] Deduced a trap composed of 76 places in 43 ms
[2020-05-26 09:01:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3486 ms
[2020-05-26 09:01:49] [INFO ] Computed and/alt/rep : 269/819/269 causal constraints in 25 ms.
[2020-05-26 09:01:50] [INFO ] Added : 268 causal constraints over 54 iterations in 1434 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 128 ms returned sat
[2020-05-26 09:01:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-26 09:01:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned unsat
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-05-26 09:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-26 09:01:51] [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 34 ms returned unsat
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-05-26 09:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-05-26 09:01:51] [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 18 ms returned unsat
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-05-26 09:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-26 09:01:51] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-05-26 09:01:51] [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 18 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-05-26 09:01:51] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-26 09:01:51] [INFO ] Flatten gal took : 58 ms
FORMULA SmartHome-PT-08-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-26 09:01:51] [INFO ] Flatten gal took : 16 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 : 82 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/graph16098378272743530337.txt, -o, /tmp/graph16098378272743530337.bin, -w, /tmp/graph16098378272743530337.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/graph16098378272743530337.bin, -l, -1, -v, -w, /tmp/graph16098378272743530337.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.
[2020-05-26 09:01:52] [INFO ] Removed a total of 53 redundant transitions.
[2020-05-26 09:01:52] [INFO ] Flatten gal took : 47 ms
[2020-05-26 09:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2020-05-26 09:01:52] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 5 ms
[2020-05-26 09:01:52] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
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
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 4 ms

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 7 LTL properties
Checking formula 0 : !((!(X("(i7.i0.u44.p138==1)"))))
Formula 0 simplified : X"(i7.i0.u44.p138==1)"
built 29 ordering constraints for composite.
built 3 ordering constraints for composite.
built 12 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 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 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 9 ordering constraints for composite.
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 13 ordering constraints for composite.
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 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:53] [INFO ] Proved 232 variables to be positive in 911 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 30 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 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-26 09:01:53] [INFO ] Computing symmetric co enabling matrix : 270 transitions.
Reverse transition relation is NOT exact ! Due to transitions t20, t57, t148, t219, u2.t251, u2.t252, u2.t253, u2.t254, u2.t255, u2.t256, u2.t257, u2.t258, u2.t259, u2.t260, i0.t5, i0.u75.t10, i0.u75.t11, i0.u75.t12, i0.u75.t13, i0.u75.t14, i0.u76.t9, i4.i0.t244, i4.i0.t246, i4.i0.u13.t220, i4.i0.u13.t248, i5.t184, i5.i2.t188, i5.i2.u23.t185, i5.i2.u23.t213, i6.i0.t173, i6.i0.t175, i6.i0.u33.t149, i6.i0.u33.t177, i7.t112, i7.i0.t137, i7.i0.t139, i7.i0.u44.t113, i7.i0.u44.t141, i8.t103, i8.t101, i8.t97, i8.t62, i8.u62.t58, i8.u62.t59, i8.u62.t105, i12.i0.t45, i12.i0.t47, i12.i0.u73.t21, i12.i0.u73.t49, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/214/49/263
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
217 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.20227,85092,1,0,134686,1979,2651,223869,509,11452,478121
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SmartHome-PT-08-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X(X(F("((i7.i0.u44.p113==0)||(i7.i0.u36.p115==1))"))))))
Formula 1 simplified : !GXXF"((i7.i0.u44.p113==0)||(i7.i0.u36.p115==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
69 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.88924,109888,1,0,179771,2566,3201,319442,553,14361,584518
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SmartHome-PT-08-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X("((i7.i0.u38.p122==0)||(i12.i0.u73.p217==1))"))))
Formula 2 simplified : !FX"((i7.i0.u38.p122==0)||(i12.i0.u73.p217==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,2.89019,110152,1,0,179771,2566,3225,319442,554,14361,584546
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SmartHome-PT-08-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(G(X(X(X("((i0.u76.p228!=1)&&((i3.i2.u25.p80==0)||(i3.i2.u25.p80==1)))"))))))))
Formula 3 simplified : !XXGXXX"((i0.u76.p228!=1)&&((i3.i2.u25.p80==0)||(i3.i2.u25.p80==1)))"
Computing Next relation with stutter on 29 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
26 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,3.15453,119392,1,0,200230,2567,3285,346335,557,14381,635101
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SmartHome-PT-08-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((!(F(X("((i3.i1.u15.p48==0)||(i12.i1.u70.p206==1))"))))||(!((F("((i3.i1.u15.p48==0)||(i12.i1.u70.p206==1))"))U(F("((i4.i0.u13.p20==0)||(i4.i0.u13.p44==1))"))))))
Formula 4 simplified : !(!FX"((i3.i1.u15.p48==0)||(i12.i1.u70.p206==1))" | !(F"((i3.i1.u15.p48==0)||(i12.i1.u70.p206==1))" U F"((i4.i0.u13.p20==0)||(i4.i0.u13.p44==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
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,3.1651,120896,1,0,200353,2567,3322,346512,562,14381,635576
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA SmartHome-PT-08-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G(F(!(F(!(X(F("((i0.u76.p228==0)||(i5.i2.u77.p231==1))"))))))))&&("((i0.u76.p228==0)||(i5.i2.u77.p231==1))"))))
Formula 5 simplified : !F("((i0.u76.p228==0)||(i5.i2.u77.p231==1))" & GF!F!XF"((i0.u76.p228==0)||(i5.i2.u77.p231==1))")
Computing Next relation with stutter on 29 deadlock states
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
91 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.06448,143028,1,0,242698,2567,3367,432664,563,14454,713819
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SmartHome-PT-08-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("((i6.i1.u31.p100!=0)&&(i8.u48.p147!=1))")))
Formula 6 simplified : !F"((i6.i1.u31.p100!=0)&&(i8.u48.p147!=1))"
Computing Next relation with stutter on 29 deadlock states
[2020-05-26 09:01:56] [INFO ] Computation of co-enabling matrix(42/270) took 2681 ms. Total solver calls (SAT/UNSAT): 1580(9/1571)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
199 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,6.06631,214044,1,0,386239,2598,3404,648528,565,14998,926330
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SmartHome-PT-08-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-26 09:01:59] [INFO ] Computation of co-enabling matrix(58/270) took 5808 ms. Total solver calls (SAT/UNSAT): 2371(18/2353)
[2020-05-26 09:02:00] [WARNING] Script execution failed on command (assert (>= (select s0 130) 1)) with error
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-26 09:02:00] [INFO ] Built C files in 8048ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590483720438

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-08"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-oct2-159033546100057"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;