Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475500314.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.2K May 14 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 13 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 105K 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 ShieldIIPt-PT-020A-00
FORMULA_NAME ShieldIIPt-PT-020A-01
FORMULA_NAME ShieldIIPt-PT-020A-02
FORMULA_NAME ShieldIIPt-PT-020A-03
FORMULA_NAME ShieldIIPt-PT-020A-04
FORMULA_NAME ShieldIIPt-PT-020A-05
FORMULA_NAME ShieldIIPt-PT-020A-06
FORMULA_NAME ShieldIIPt-PT-020A-07
FORMULA_NAME ShieldIIPt-PT-020A-08
FORMULA_NAME ShieldIIPt-PT-020A-09
FORMULA_NAME ShieldIIPt-PT-020A-10
FORMULA_NAME ShieldIIPt-PT-020A-11
FORMULA_NAME ShieldIIPt-PT-020A-12
FORMULA_NAME ShieldIIPt-PT-020A-13
FORMULA_NAME ShieldIIPt-PT-020A-14
FORMULA_NAME ShieldIIPt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1590581850662

[2020-05-27 12:17:32] [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-27 12:17:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:17:32] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-05-27 12:17:32] [INFO ] Transformed 383 places.
[2020-05-27 12:17:32] [INFO ] Transformed 283 transitions.
[2020-05-27 12:17:32] [INFO ] Found NUPN structural information;
[2020-05-27 12:17:32] [INFO ] Parsed PT model containing 383 places and 283 transitions in 103 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 472 ms. (steps per millisecond=211 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 282 rows 383 cols
[2020-05-27 12:17:32] [INFO ] Computed 181 place invariants in 11 ms
[2020-05-27 12:17:33] [INFO ] [Real]Absence check using 181 positive place invariants in 84 ms returned sat
[2020-05-27 12:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:33] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2020-05-27 12:17:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:33] [INFO ] [Nat]Absence check using 181 positive place invariants in 78 ms returned sat
[2020-05-27 12:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:33] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2020-05-27 12:17:33] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 29 ms.
[2020-05-27 12:17:35] [INFO ] Added : 281 causal constraints over 59 iterations in 1776 ms. Result :sat
[2020-05-27 12:17:35] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2020-05-27 12:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:36] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-27 12:17:36] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 18 ms.
[2020-05-27 12:17:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:36] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2020-05-27 12:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:36] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2020-05-27 12:17:36] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 23 ms.
[2020-05-27 12:17:38] [INFO ] Added : 279 causal constraints over 57 iterations in 1598 ms. Result :sat
[2020-05-27 12:17:38] [INFO ] [Real]Absence check using 181 positive place invariants in 76 ms returned sat
[2020-05-27 12:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:38] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2020-05-27 12:17:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:38] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2020-05-27 12:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:39] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2020-05-27 12:17:39] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 17 ms.
[2020-05-27 12:17:40] [INFO ] Added : 276 causal constraints over 57 iterations in 1465 ms. Result :sat
[2020-05-27 12:17:40] [INFO ] [Real]Absence check using 181 positive place invariants in 78 ms returned sat
[2020-05-27 12:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:41] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2020-05-27 12:17:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:41] [INFO ] [Nat]Absence check using 181 positive place invariants in 73 ms returned sat
[2020-05-27 12:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:41] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2020-05-27 12:17:41] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 14 ms.
[2020-05-27 12:17:43] [INFO ] Added : 276 causal constraints over 57 iterations in 1642 ms. Result :sat
[2020-05-27 12:17:43] [INFO ] [Real]Absence check using 181 positive place invariants in 50 ms returned sat
[2020-05-27 12:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:43] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2020-05-27 12:17:43] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 19 ms.
[2020-05-27 12:17:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 73 ms returned sat
[2020-05-27 12:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:44] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2020-05-27 12:17:44] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 24 ms.
[2020-05-27 12:17:45] [INFO ] Added : 278 causal constraints over 57 iterations in 1528 ms. Result :sat
[2020-05-27 12:17:45] [INFO ] [Real]Absence check using 181 positive place invariants in 56 ms returned sat
[2020-05-27 12:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:46] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2020-05-27 12:17:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:46] [INFO ] [Nat]Absence check using 181 positive place invariants in 54 ms returned sat
[2020-05-27 12:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:46] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2020-05-27 12:17:46] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 14 ms.
[2020-05-27 12:17:47] [INFO ] Added : 276 causal constraints over 56 iterations in 1110 ms. Result :sat
[2020-05-27 12:17:47] [INFO ] [Real]Absence check using 181 positive place invariants in 49 ms returned sat
[2020-05-27 12:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:48] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-27 12:17:48] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 24 ms.
[2020-05-27 12:17:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:48] [INFO ] [Nat]Absence check using 181 positive place invariants in 54 ms returned sat
[2020-05-27 12:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:48] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2020-05-27 12:17:48] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 15 ms.
[2020-05-27 12:17:50] [INFO ] Added : 279 causal constraints over 57 iterations in 1452 ms. Result :sat
[2020-05-27 12:17:50] [INFO ] [Real]Absence check using 181 positive place invariants in 69 ms returned sat
[2020-05-27 12:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:50] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2020-05-27 12:17:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:50] [INFO ] [Nat]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-05-27 12:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:51] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2020-05-27 12:17:51] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 20 ms.
[2020-05-27 12:17:52] [INFO ] Added : 278 causal constraints over 58 iterations in 1446 ms. Result :sat
[2020-05-27 12:17:52] [INFO ] [Real]Absence check using 181 positive place invariants in 77 ms returned sat
[2020-05-27 12:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:53] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2020-05-27 12:17:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 80 ms returned sat
[2020-05-27 12:17:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:53] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2020-05-27 12:17:53] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 30 ms.
[2020-05-27 12:17:55] [INFO ] Added : 275 causal constraints over 56 iterations in 1457 ms. Result :sat
[2020-05-27 12:17:55] [INFO ] [Real]Absence check using 181 positive place invariants in 79 ms returned sat
[2020-05-27 12:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:55] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2020-05-27 12:17:55] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 21 ms.
[2020-05-27 12:17:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:17:55] [INFO ] [Nat]Absence check using 181 positive place invariants in 52 ms returned sat
[2020-05-27 12:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:17:56] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2020-05-27 12:17:56] [INFO ] Computed and/alt/rep : 281/999/281 causal constraints in 21 ms.
[2020-05-27 12:17:57] [INFO ] Added : 275 causal constraints over 57 iterations in 1226 ms. Result :sat
[2020-05-27 12:17:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-27 12:17:57] [INFO ] Flatten gal took : 90 ms
FORMULA ShieldIIPt-PT-020A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 12:17:57] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 12:17:57] [INFO ] Applying decomposition
[2020-05-27 12:17:57] [INFO ] Flatten gal took : 46 ms
[2020-05-27 12:17:57] [INFO ] Input system was already deterministic with 282 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/graph740192982715244352.txt, -o, /tmp/graph740192982715244352.bin, -w, /tmp/graph740192982715244352.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/graph740192982715244352.bin, -l, -1, -v, -w, /tmp/graph740192982715244352.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 12:17:57] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 282 rows 383 cols
[2020-05-27 12:17:57] [INFO ] Computed 181 place invariants in 4 ms
inv : p0 + p326 + p327 = 1
inv : p0 + p35 + p36 = 1
inv : p0 + p341 + p342 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p381 + p382 = 1
inv : p0 + p371 + p372 = 1
inv : p0 + p50 + p51 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p90 + p91 = 1
inv : p0 + p100 + p101 + p102 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p24 + p27 + p28 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p276 + p277 = 1
inv : p0 + p286 + p287 = 1
inv : p0 + p347 + p348 + p349 = 1
inv : p0 + p206 + p207 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p309 + p312 + p313 = 1
inv : p0 + p176 + p179 + p180 = 1
inv : p0 + p356 + p357 = 1
inv : p0 + p81 + p84 + p85 = 1
inv : p0 + p62 + p63 + p64 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p210 + p211 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p252 + p253 + p254 = 1
inv : p0 + p250 + p251 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p280 + p281 = 1
inv : p0 + p352 + p353 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p119 + p122 + p123 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p366 + p369 + p370 = 1
inv : p0 + p166 + p167 = 1
inv : p0 + p290 + p291 + p292 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p282 + p283 = 1
inv : p0 + p62 + p65 + p66 = 1
inv : p0 + p138 + p139 + p140 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p214 + p215 + p216 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p164 + p165 = 1
inv : p0 + p362 + p363 = 1
inv : p0 + p157 + p160 + p161 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p375 + p376 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p136 + p137 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p200 + p201 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p339 + p340 = 1
inv : p0 + p271 + p274 + p275 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p240 + p241 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p333 + p334 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p130 + p131 = 1
inv : p0 + p246 + p247 = 1
inv : p0 + p233 + p236 + p237 = 1
inv : p0 + p322 + p323 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p48 + p49 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p316 + p317 = 1
inv : p0 + p54 + p55 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p271 + p272 + p273 = 1
inv : p0 + p168 + p169 = 1
inv : p0 + p195 + p198 + p199 = 1
inv : p0 + p290 + p293 + p294 = 1
inv : p0 + p176 + p177 + p178 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p208 + p209 = 1
inv : p0 + p248 + p249 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p98 + p99 = 1
inv : p0 + p379 + p380 = 1
[2020-05-27 12:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
inv : p0 + p263 + p264 = 1
inv : p0 + p88 + p89 = 1
inv : p0 + p318 + p319 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p81 + p82 + p83 = 1
inv : p0 + p366 + p367 + p368 = 1
inv : p0 + p238 + p239 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p324 + p325 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p373 + p374 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p314 + p315 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p52 + p53 = 1
inv : p0 + p358 + p359 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p288 + p289 = 1
inv : p0 + p58 + p59 = 1
inv : p0 + p347 + p350 + p351 = 1
inv : p0 + p138 + p141 + p142 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p204 + p205 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p309 + p310 + p311 = 1
inv : p0 + p100 + p103 + p104 = 1
inv : p0 + p134 + p135 = 1
inv : p0 + p364 + p365 = 1
inv : p0 + p24 + p25 + p26 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p242 + p243 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p43 + p44 + p45 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p328 + p331 + p332 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p202 + p203 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p320 + p321 = 1
inv : p0 + p360 + p361 = 1
inv : p0 + p328 + p329 + p330 = 1
inv : p0 + p119 + p120 + p121 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p233 + p234 + p235 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p56 + p57 = 1
inv : p0 + p244 + p245 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p43 + p46 + p47 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p284 + p285 = 1
inv : p0 + p92 + p93 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p214 + p217 + p218 = 1
inv : p0 + p195 + p196 + p197 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p162 + p163 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p252 + p255 + p256 = 1
inv : p0 + p16 + p17 = 1
inv : p0 + p354 + p355 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p377 + p378 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p157 + p158 + p159 = 1
inv : p0 + p86 + p87 = 1
Total of 181 invariants.
[2020-05-27 12:17:58] [INFO ] Computed 181 place invariants in 17 ms
[2020-05-27 12:17:58] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-27 12:17:58] [INFO ] Flatten gal took : 56 ms
[2020-05-27 12:17:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2020-05-27 12:17:58] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-27 12:17:58] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !(((("(((((i17.i3.u132.p317==1)&&(i16.i1.u135.p323==1))&&(i16.i2.u136.p325==1))&&(i2.u18.p44==1))&&(i2.u21.p53==1))")U(X((G("((i13.i0.u106.p252!=1)||(i13.i0.u110.p263!=1))"))||(X("((i8.i3.u69.p166==1)&&(i8.i3.u75.p181==1))")))))U("(((i17.i3.u132.p317==1)&&(i16.i1.u135.p323==1))&&(i16.i2.u136.p325==1))")))
Formula 0 simplified : !(("(((((i17.i3.u132.p317==1)&&(i16.i1.u135.p323==1))&&(i16.i2.u136.p325==1))&&(i2.u18.p44==1))&&(i2.u21.p53==1))" U X(G"((i13.i0.u106.p252!=1)||(i13.i0.u110.p263!=1))" | X"((i8.i3.u69.p166==1)&&(i8.i3.u75.p181==1))")) U "(((i17.i3.u132.p317==1)&&(i16.i1.u135.p323==1))&&(i16.i2.u136.p325==1))")
built 20 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 20 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
27 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,0.332548,28704,1,0,20092,342,1906,40232,117,1342,9365
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-020A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((G(X("((i11.i2.u90.p214==1)&&(i11.i1.u94.p225==1))")))||(F("((i9.i3.u85.p204==1)&&(i9.i3.u91.p219==1))")))))
Formula 1 simplified : !X(GX"((i11.i2.u90.p214==1)&&(i11.i1.u94.p225==1))" | F"((i9.i3.u85.p204==1)&&(i9.i3.u91.p219==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10 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,0.436136,29008,1,0,23637,342,2036,40232,118,1342,38058
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-020A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(F(G(X((X("(i2.u21.p52==1)"))U(((F((F("((i11.i0.u84.p202==1)&&(i11.i0.u95.p227==1))"))U("((i11.i0.u84.p202==1)&&(i11.i0.u95.p227==1))")))||("(i13.i3.u109.p261!=1)"))||("(i13.i3.u115.p276!=1)"))))))))
Formula 2 simplified : FGX(X"(i2.u21.p52==1)" U ("(i13.i3.u109.p261!=1)" | "(i13.i3.u115.p276!=1)" | F(F"((i11.i0.u84.p202==1)&&(i11.i0.u95.p227==1))" U "((i11.i0.u84.p202==1)&&(i11.i0.u95.p227==1))")))
[2020-05-27 12:17:58] [INFO ] Proved 383 variables to be positive in 747 ms
[2020-05-27 12:17:58] [INFO ] Computing symmetric may disable matrix : 282 transitions.
[2020-05-27 12:17:58] [INFO ] Computation of disable matrix completed :0/282 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
14 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,0.570446,35228,1,0,36762,342,2179,71513,121,1428,51254
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-020A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G((F(G(F("((i4.i0.u33.p79==1)&&(i4.i0.u40.p96==1))"))))&&(X("((i15.i1.u121.p289==1)&&(i15.i1.u126.p302==1))")))))
Formula 3 simplified : !G(FGF"((i4.i0.u33.p79==1)&&(i4.i0.u40.p96==1))" & X"((i15.i1.u121.p289==1)&&(i15.i1.u126.p302==1))")
[2020-05-27 12:17:58] [INFO ] Computation of Complete disable matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 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,0.573812,35728,1,0,37247,342,2201,72225,121,1428,51667
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-020A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(F(!(G(("((i12.i1.u98.p234==1)&&(i12.i1.u101.p243==1))")U(F(X(!(("(i7.i0.u64.p153==1)")U("((i19.i1.u154.p369==1)&&(i19.i0.u159.p380==1))"))))))))))))
Formula 4 simplified : !F!F!G("((i12.i1.u98.p234==1)&&(i12.i1.u101.p243==1))" U FX!("(i7.i0.u64.p153==1)" U "((i19.i1.u154.p369==1)&&(i19.i0.u159.p380==1))"))
[2020-05-27 12:17:58] [INFO ] Computing symmetric may enable matrix : 282 transitions.
4 unique states visited
4 strongly connected components in search stack
5 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,0.579657,35968,1,0,37926,342,2266,73541,122,1432,52355
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-020A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((!(G(X("((i13.i0.u106.p252==1)&&(i13.i0.u110.p263==1))"))))&&(X(F(((G("(i14.i1.u119.p284==1)"))||("(i9.i1.u81.p194!=1)"))||("(i9.i2.u86.p207!=1)"))))))
Formula 5 simplified : !(!GX"((i13.i0.u106.p252==1)&&(i13.i0.u110.p263==1))" & XF("(i9.i1.u81.p194!=1)" | "(i9.i2.u86.p207!=1)" | G"(i14.i1.u119.p284==1)"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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,0.58158,36488,1,0,37926,342,2337,73541,123,1432,52413
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-020A-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(G((X(X("((i9.i2.u82.p198==1)&&(i9.i0.u87.p209==1))")))||(("((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1))")U("(((i14.i2.u123.p296==1)&&(i15.i2.u125.p300==1))&&(i15.i1.u128.p306==1))"))))))
Formula 6 simplified : G(XX"((i9.i2.u82.p198==1)&&(i9.i0.u87.p209==1))" | ("((i6.i2.u53.p128==1)&&(i6.i2.u59.p143==1))" U "(((i14.i2.u123.p296==1)&&(i15.i2.u125.p300==1))&&(i15.i1.u128.p306==1))"))
[2020-05-27 12:17:58] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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,0.587013,36488,1,0,37926,342,2405,73541,123,1432,52526
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldIIPt-PT-020A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((X(G("((i17.i3.u132.p316==1)&&(i17.i3.u143.p341==1))")))||((G("(((i2.u27.p68!=1)||(i3.i2.u29.p72!=1))||(i3.i1.u32.p78!=1))"))&&(F(G("(((i2.u27.p68==1)&&(i3.i2.u29.p72==1))&&(i3.i1.u32.p78==1))")))))))
Formula 7 simplified : !X(XG"((i17.i3.u132.p316==1)&&(i17.i3.u143.p341==1))" | (G"(((i2.u27.p68!=1)||(i3.i2.u29.p72!=1))||(i3.i1.u32.p78!=1))" & FG"(((i2.u27.p68==1)&&(i3.i2.u29.p72==1))&&(i3.i1.u32.p78==1))"))
[2020-05-27 12:18:04] [INFO ] Computing symmetric co enabling matrix : 282 transitions.
[2020-05-27 12:18:04] [INFO ] Computation of co-enabling matrix(0/282) took 23 ms. Total solver calls (SAT/UNSAT): 4(0/4)
[2020-05-27 12:18:07] [INFO ] Computation of co-enabling matrix(153/282) took 3040 ms. Total solver calls (SAT/UNSAT): 696(85/611)
[2020-05-27 12:18:10] [INFO ] Computation of Finished co-enabling matrix. took 5347 ms. Total solver calls (SAT/UNSAT): 859(139/720)
[2020-05-27 12:18:10] [INFO ] Computing Do-Not-Accords matrix : 282 transitions.
[2020-05-27 12:18:10] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 12:18:10] [INFO ] Built C files in 12613ms 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 3342 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X(( X([]((LTLAP22==true)))) || ( ( []((LTLAP23==true)) ) && ( <>([]((LTLAP24==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(( X([]((LTLAP22==true)))) || ( ( []((LTLAP23==true)) ) && ( <>([]((LTLAP24==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(( X([]((LTLAP22==true)))) || ( ( []((LTLAP23==true)) ) && ( <>([]((LTLAP24==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)
Detected timeout of ITS tools.
[2020-05-27 12:38:06] [INFO ] Applying decomposition
[2020-05-27 12:38:06] [INFO ] Flatten gal took : 76 ms
[2020-05-27 12:38:06] [INFO ] Decomposing Gal with order
[2020-05-27 12:38:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:38:06] [INFO ] Removed a total of 80 redundant transitions.
[2020-05-27 12:38:06] [INFO ] Flatten gal took : 60 ms
[2020-05-27 12:38:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2020-05-27 12:38:06] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 18 ms
[2020-05-27 12:38:06] [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 7 LTL properties
Checking formula 0 : !((X((X(G("((u167.p316==1)&&(u180.p341==1))")))||((G("(((u36.p68!=1)||(u38.p72!=1))||(u41.p78!=1))"))&&(F(G("(((u36.p68==1)&&(u38.p72==1))&&(u41.p78==1))")))))))
Formula 0 simplified : !X(XG"((u167.p316==1)&&(u180.p341==1))" | (G"(((u36.p68!=1)||(u38.p72!=1))||(u41.p78!=1))" & FG"(((u36.p68==1)&&(u38.p72==1))&&(u41.p78==1))"))
built 181 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2020-05-27 12:58:14] [INFO ] Flatten gal took : 45 ms
[2020-05-27 12:58:14] [INFO ] Input system was already deterministic with 282 transitions.
[2020-05-27 12:58:15] [INFO ] Transformed 383 places.
[2020-05-27 12:58:15] [INFO ] Transformed 282 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 12:58:15] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
[2020-05-27 12:58:15] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 7 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(G("((p316==1)&&(p341==1))")))||((G("(((p68!=1)||(p72!=1))||(p78!=1))"))&&(F(G("(((p68==1)&&(p72==1))&&(p78==1))")))))))
Formula 0 simplified : !X(XG"((p316==1)&&(p341==1))" | (G"(((p68!=1)||(p72!=1))||(p78!=1))" & FG"(((p68==1)&&(p72==1))&&(p78==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-020A"
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 ShieldIIPt-PT-020A, 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 r210-tajo-159033475500314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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