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

About the Execution of ITS-Tools for RwMutex-PT-r0100w0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.710 12727.00 29094.00 154.60 FFFFFFTFFFFFFFFF 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.r156-oct2-158972913900306.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 RwMutex-PT-r0100w0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913900306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 3.9K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 10 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 9 23:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 9 23:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 195K Mar 24 05:38 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 RwMutex-PT-r0100w0010-00
FORMULA_NAME RwMutex-PT-r0100w0010-01
FORMULA_NAME RwMutex-PT-r0100w0010-02
FORMULA_NAME RwMutex-PT-r0100w0010-03
FORMULA_NAME RwMutex-PT-r0100w0010-04
FORMULA_NAME RwMutex-PT-r0100w0010-05
FORMULA_NAME RwMutex-PT-r0100w0010-06
FORMULA_NAME RwMutex-PT-r0100w0010-07
FORMULA_NAME RwMutex-PT-r0100w0010-08
FORMULA_NAME RwMutex-PT-r0100w0010-09
FORMULA_NAME RwMutex-PT-r0100w0010-10
FORMULA_NAME RwMutex-PT-r0100w0010-11
FORMULA_NAME RwMutex-PT-r0100w0010-12
FORMULA_NAME RwMutex-PT-r0100w0010-13
FORMULA_NAME RwMutex-PT-r0100w0010-14
FORMULA_NAME RwMutex-PT-r0100w0010-15

=== Now, execution of the tool begins

BK_START 1589888319732

[2020-05-19 11:38:42] [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-19 11:38:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 11:38:42] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2020-05-19 11:38:42] [INFO ] Transformed 320 places.
[2020-05-19 11:38:42] [INFO ] Transformed 220 transitions.
[2020-05-19 11:38:42] [INFO ] Parsed PT model containing 320 places and 220 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1419 ms. (steps per millisecond=70 ) properties seen :[1, 1, 1, 1, 1, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 220 rows 320 cols
[2020-05-19 11:38:44] [INFO ] Computed 210 place invariants in 12 ms
[2020-05-19 11:38:44] [INFO ] [Real]Absence check using 210 positive place invariants in 173 ms returned sat
[2020-05-19 11:38:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 11:38:45] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2020-05-19 11:38:45] [INFO ] Computed and/alt/rep : 110/110/110 causal constraints in 25 ms.
[2020-05-19 11:38:45] [INFO ] Added : 0 causal constraints over 0 iterations in 73 ms. Result :sat
[2020-05-19 11:38:46] [INFO ] [Real]Absence check using 210 positive place invariants in 644 ms returned sat
[2020-05-19 11:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 11:38:46] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2020-05-19 11:38:46] [INFO ] Computed and/alt/rep : 110/110/110 causal constraints in 30 ms.
[2020-05-19 11:38:46] [INFO ] Added : 0 causal constraints over 0 iterations in 96 ms. Result :sat
[2020-05-19 11:38:47] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-19 11:38:47] [INFO ] Flatten gal took : 286 ms
FORMULA RwMutex-PT-r0100w0010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0100w0010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0100w0010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 11:38:47] [INFO ] Flatten gal took : 97 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 11:38:47] [INFO ] Applying decomposition
[2020-05-19 11:38:47] [INFO ] Flatten gal took : 88 ms
[2020-05-19 11:38:48] [INFO ] Input system was already deterministic with 220 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/graph14168167091450652483.txt, -o, /tmp/graph14168167091450652483.bin, -w, /tmp/graph14168167091450652483.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/graph14168167091450652483.bin, -l, -1, -v, -w, /tmp/graph14168167091450652483.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 11:38:48] [INFO ] Decomposing Gal with order
[2020-05-19 11:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 220 rows 320 cols
[2020-05-19 11:38:48] [INFO ] Computed 210 place invariants in 16 ms
inv : p135 + p25 = 1
inv : p1 + p114 + p214 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p113 + p213 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p115 + p5 = 1
inv : p1 + p115 + p215 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p123 + p13 = 1
inv : p1 + p112 + p212 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p165 + p55 = 1
inv : p179 + p69 = 1
inv : p105 + p315 = 1
inv : p156 + p46 = 1
inv : p197 + p87 = 1
inv : p206 + p96 = 1
inv : p130 + p20 = 1
inv : p128 + p18 = 1
inv : p1 + p124 + p224 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p129 + p19 = 1
inv : p1 + p118 + p218 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p116 + p216 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p126 + p226 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p147 + p37 = 1
inv : p188 + p78 = 1
inv : p1 + p128 + p228 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p184 + p74 = 1
inv : p100 + p210 = 1
inv : p1 + p207 + p307 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p112 + p2 = 1
inv : p1 + p210 + p310 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p206 + p306 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p142 + p32 = 1
inv : p1 + p211 + p311 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p148 + p38 = 1
inv : p152 + p42 = 1
inv : p1 + p130 + p230 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p131 + p231 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p124 + p14 = 1
inv : p1 + p123 + p223 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p203 + p303 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p122 + p222 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p135 + p235 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p174 + p64 = 1
inv : p192 + p82 = 1
inv : p113 + p3 = 1
inv : p1 + p119 + p219 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p202 + p302 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p160 + p50 = 1
inv : p1 + p111 = 1
inv : p205 + p95 = 1
inv : p166 + p56 = 1
inv : p1 + p127 + p227 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p198 + p88 = 1
inv : p134 + p24 = 1
inv : p150 + p40 = 1
inv : p109 + p319 = 1
inv : p1 + p197 + p297 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p182 + p72 = 1
inv : p1 + p143 + p243 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p194 + p294 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p178 + p68 = 1
inv : p104 + p314 = 1
inv : p1 + p142 + p242 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p146 + p36 = 1
inv : p127 + p17 = 1
inv : p1 + p140 + p240 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p101 + p211 = 1
inv : p116 + p6 = 1
inv : p199 + p89 = 1
inv : p1 + p148 + p248 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p102 + p312 = 1
inv : p1 + p138 + p238 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p199 + p299 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p192 + p292 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p136 + p236 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p161 + p51 = 1
inv : p173 + p63 = 1
inv : p1 + p154 + p254 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p137 + p27 = 1
inv : p189 + p79 = 1
inv : p1 + p182 + p282 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p193 + p83 = 1
inv : p1 + p208 + p308 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p180 + p280 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p157 + p257 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p152 + p252 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p133 + p23 = 1
inv : p157 + p47 = 1
inv : p1 + p129 + p229 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p162 + p52 = 1
inv : p1 + p205 + p305 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p185 + p285 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p204 + p94 = 1
inv : p167 + p57 = 1
inv : p209 + p99 = 1
inv : p1 + p178 + p278 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p194 + p84 = 1
inv : p1 + p121 + p221 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p161 + p261 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p200 + p300 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p133 + p233 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p12 + p122 = 1
inv : p151 + p41 = 1
inv : p1 + p173 + p273 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p183 + p73 = 1
inv : p1 + p117 + p217 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p145 + p245 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p169 + p269 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p167 + p267 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p166 + p266 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p170 + p270 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p172 + p62 = 1
inv : p177 + p67 = 1
inv : p181 + p71 = 1
inv : p103 + p313 = 1
inv : p1 + p168 + p268 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p138 + p28 = 1
inv : p1 + p176 + p276 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p132 + p22 = 1
inv : p1 + p174 + p274 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p162 + p262 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p203 + p93 = 1
inv : p168 + p58 = 1
inv : p1 + p160 + p260 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p108 + p318 = 1
inv : p1 + p172 + p272 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p164 + p264 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p159 + p49 = 1
inv : p190 + p80 = 1
inv : p117 + p7 = 1
inv : p1 + p155 + p255 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p183 + p283 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p156 + p256 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p153 + p43 = 1
inv : p11 + p121 = 1
inv : p1 + p184 + p284 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p151 + p251 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p179 + p279 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p158 + p48 = 1
inv : p1 + p150 + p250 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p187 + p287 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p159 + p259 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p145 + p35 = 1
inv : p1 + p188 + p288 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p163 + p53 = 1
inv : p1 + p147 + p247 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p126 + p16 = 1
inv : p1 + p175 + p275 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p171 + p61 = 1
inv : p107 + p317 = 1
inv : p1 + p171 + p271 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p163 + p263 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p208 + p98 = 1
inv : p195 + p85 = 1
inv : p169 + p59 = 1
inv : p1 + p191 + p291 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p155 + p45 = 1
inv : p207 + p97 = 1
inv : p119 + p9 = 1
inv : p202 + p92 = 1
inv : p1 + p195 + p295 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p131 + p21 = 1
inv : p1 + p141 + p241 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p198 + p298 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p164 + p54 = 1
inv : p1 + p193 + p293 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p196 + p86 = 1
inv : p191 + p81 = 1
inv : p1 + p139 + p239 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p187 + p77 = 1
inv : p139 + p29 = 1
inv : p1 + p196 + p296 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p201 + p301 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p136 + p26 = 1
inv : p1 + p189 + p289 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p134 + p234 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p114 + p4 = 1
inv : p185 + p75 = 1
inv : p1 + p144 + p244 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p146 + p246 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p140 + p30 = 1
inv : p1 + p190 + p290 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p144 + p34 = 1
inv : p200 + p90 = 1
inv : p176 + p66 = 1
inv : p1 + p181 + p281 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p110 + p320 = 1
inv : p149 + p39 = 1
inv : p170 + p60 = 1
inv : p175 + p65 = 1
inv : p143 + p33 = 1
inv : p1 + p186 + p286 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p132 + p232 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p158 + p258 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p106 + p316 = 1
inv : p1 + p177 + p277 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p141 + p31 = 1
inv : p1 + p204 + p304 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p10 + p120 = 1
inv : p201 + p91 = 1
inv : p1 + p149 + p249 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p120 + p220 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p165 + p265 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p186 + p76 = 1
inv : p1 + p125 + p225 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p137 + p237 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p1 + p153 + p253 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p154 + p44 = 1
inv : p180 + p70 = 1
inv : p125 + p15 = 1
inv : p1 + p209 + p309 + p312 + p313 + p314 + p315 + p316 + p317 + p318 + p319 + p320 = 1
inv : p118 + p8 = 1
Total of 210 invariants.
[2020-05-19 11:38:48] [INFO ] Computed 210 place invariants in 19 ms
[2020-05-19 11:38:48] [INFO ] Removed a total of 1800 redundant transitions.
[2020-05-19 11:38:49] [INFO ] Flatten gal took : 407 ms
[2020-05-19 11:38:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 133 ms.
[2020-05-19 11:38:49] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 26 ms
[2020-05-19 11:38:49] [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 13 LTL properties
Checking formula 0 : !(((!(X(F("((u18.p17>=1)&&(u18.p227>=1))"))))&&((!(G("(u101.p194<1)")))||(!(F("((u18.p17>=1)&&(u18.p227>=1))"))))))
Formula 0 simplified : !(!XF"((u18.p17>=1)&&(u18.p227>=1))" & (!G"(u101.p194<1)" | !F"((u18.p17>=1)&&(u18.p227>=1))"))
built 1 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
134 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.45516,23504,1,0,3970,219,7584,1710,81,127,26553
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((("(i2.u6.p318>=1)")U(G((F(G(F("(i2.u6.p318>=1)"))))U(G("(u78.p143>=1)")))))||(("(u40.p167>=1)")U(G("((i65.u58.p295>=1)&&(i65.u58.p85>=1))")))))
Formula 1 simplified : !(("(i2.u6.p318>=1)" U G(FGF"(i2.u6.p318>=1)" U G"(u78.p143>=1)")) | ("(u40.p167>=1)" U G"((i65.u58.p295>=1)&&(i65.u58.p85>=1))"))
6 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
7 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.57062,26888,1,0,5269,219,8152,2814,83,127,32697
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((F("((u52.p284<1)||(u52.p74<1))"))||("(u79.p148>=1)"))))
Formula 2 simplified : !G("(u79.p148>=1)" | F"((u52.p284<1)||(u52.p74<1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
2 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.58688,26888,1,0,5609,219,8281,3038,83,127,34121
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F((X(F("((u14.p119>=1)||((u89.p266>=1)&&(u89.p56>=1)))")))U((G("(u14.p119>=1)"))||("(u38.p163>=1)"))))))
Formula 3 simplified : !GF(XF"((u14.p119>=1)||((u89.p266>=1)&&(u89.p56>=1)))" U ("(u38.p163>=1)" | G"(u14.p119>=1)"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
3 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.61529,27200,1,0,6343,219,8483,3707,83,127,37230
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X((G("(u104.p200>=1)"))||("((u95.p282>=1)&&(u95.p72>=1))"))))
Formula 4 simplified : !X("((u95.p282>=1)&&(u95.p72>=1))" | G"(u104.p200>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.61688,27728,1,0,6431,219,8497,3737,83,127,37523
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X("(u83.p152>=1)"))&&(G("((u79.p248>=1)&&(u79.p38>=1))"))))
Formula 5 simplified : !(X"(u83.p152>=1)" & G"((u79.p248>=1)&&(u79.p38>=1))")
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
3 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.64256,27992,1,0,7305,219,8583,4292,83,127,40278
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((F(((!(G(X(G(X(G("(u85.p155<1)")))))))&&("(u107.p304>=1)"))&&("(u107.p94>=1)")))U(X("((u85.p255>=1)&&(u85.p45>=1))")))))
Formula 6 simplified : !F(F("(u107.p94>=1)" & "(u107.p304>=1)" & !GXGXG"(u85.p155<1)") U X"((u85.p255>=1)&&(u85.p45>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.66025,28256,1,0,7501,219,8649,4548,83,127,40993
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(F((G("(u26.p142>=1)"))&&(G(X("((u91.p273>=1)&&(u91.p63>=1))"))))))||(F("(u26.p142>=1)"))))
Formula 7 simplified : !(XF(G"(u26.p142>=1)" & GX"((u91.p273>=1)&&(u91.p63>=1))") | F"(u26.p142>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 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.68656,28520,1,0,7971,219,8818,5020,83,127,43197
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(X("((u50.p181>=1)||((u46.p275>=1)&&(u46.p65>=1)))"))))
Formula 8 simplified : !GX"((u50.p181>=1)||((u46.p275>=1)&&(u46.p65>=1)))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
4 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.72961,29840,1,0,10141,219,8950,6231,83,127,48965
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(G((F("((u102.p198<1)||(u19.p129<1))"))&&((F("(u71.p113>=1)"))||("(u30.p147<1)"))))))
Formula 9 simplified : G(F"((u102.p198<1)||(u19.p129<1))" & ("(u30.p147<1)" | F"(u71.p113>=1)"))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.85197,31688,1,0,13658,219,9468,9323,83,127,59806
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X((G(X(F("((u95.p282>=1)&&(u95.p72>=1))"))))||(F("((u35.p159<1)&&((u95.p282<1)||(u95.p72<1)))")))))
Formula 10 simplified : !X(GXF"((u95.p282>=1)&&(u95.p72>=1))" | F"((u35.p159<1)&&((u95.p282<1)||(u95.p72<1)))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
9 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.94386,32480,1,0,14160,219,9633,9655,83,127,62148
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((F((!(X("((u26.p242>=1)&&(u26.p32>=1))")))&&("((u88.p164<1)||((u19.p19>=1)&&(u19.p229>=1)))")))||(G("(u88.p164>=1)")))))
Formula 11 simplified : !X(F("((u88.p164<1)||((u19.p19>=1)&&(u19.p229>=1)))" & !X"((u26.p242>=1)&&(u26.p32>=1))") | G"(u88.p164>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.07409,36176,1,0,23788,219,9932,18903,83,127,80857
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(("(((i4.u53.p185>=1)||(u14.p219<1))||(u14.p9<1))")U(F("(u98.p118>=1)")))))
Formula 12 simplified : !F("(((i4.u53.p185>=1)||(u14.p219<1))||(u14.p9<1))" U F"(u98.p118>=1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 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.09868,36440,1,0,23897,219,9969,19027,83,127,81201
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA RwMutex-PT-r0100w0010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 177) 0)")
java.lang.RuntimeException: SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 177) 0)")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:102)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
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-19 11:38:51] [INFO ] Built C files in 3977ms 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 1589888332459

--------------------
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="RwMutex-PT-r0100w0010"
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 RwMutex-PT-r0100w0010, 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 r156-oct2-158972913900306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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