About the Execution of ITS-Tools for ShieldPPPt-PT-020A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15749.960 | 1280419.00 | 1330471.00 | 1790.20 | FFFFFFTTFFFFTFTF | normal |
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-159033476000666.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 ShieldPPPt-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-159033476000666
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.7K May 14 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:52 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 134K 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 ShieldPPPt-PT-020A-00
FORMULA_NAME ShieldPPPt-PT-020A-01
FORMULA_NAME ShieldPPPt-PT-020A-02
FORMULA_NAME ShieldPPPt-PT-020A-03
FORMULA_NAME ShieldPPPt-PT-020A-04
FORMULA_NAME ShieldPPPt-PT-020A-05
FORMULA_NAME ShieldPPPt-PT-020A-06
FORMULA_NAME ShieldPPPt-PT-020A-07
FORMULA_NAME ShieldPPPt-PT-020A-08
FORMULA_NAME ShieldPPPt-PT-020A-09
FORMULA_NAME ShieldPPPt-PT-020A-10
FORMULA_NAME ShieldPPPt-PT-020A-11
FORMULA_NAME ShieldPPPt-PT-020A-12
FORMULA_NAME ShieldPPPt-PT-020A-13
FORMULA_NAME ShieldPPPt-PT-020A-14
FORMULA_NAME ShieldPPPt-PT-020A-15
=== Now, execution of the tool begins
BK_START 1590610795820
[2020-05-27 20:19:57] [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 20:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 20:19:57] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2020-05-27 20:19:57] [INFO ] Transformed 503 places.
[2020-05-27 20:19:57] [INFO ] Transformed 363 transitions.
[2020-05-27 20:19:57] [INFO ] Found NUPN structural information;
[2020-05-27 20:19:57] [INFO ] Parsed PT model containing 503 places and 363 transitions in 110 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 490 ms. (steps per millisecond=204 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 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, 0, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 362 rows 503 cols
[2020-05-27 20:19:58] [INFO ] Computed 221 place invariants in 14 ms
[2020-05-27 20:19:58] [INFO ] [Real]Absence check using 221 positive place invariants in 97 ms returned sat
[2020-05-27 20:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:19:58] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2020-05-27 20:19:59] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 52 ms.
[2020-05-27 20:19:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:19:59] [INFO ] [Nat]Absence check using 221 positive place invariants in 117 ms returned sat
[2020-05-27 20:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:19:59] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2020-05-27 20:19:59] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 17 ms.
[2020-05-27 20:20:02] [INFO ] Added : 348 causal constraints over 70 iterations in 2519 ms. Result :sat
[2020-05-27 20:20:02] [INFO ] [Real]Absence check using 221 positive place invariants in 75 ms returned sat
[2020-05-27 20:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:03] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2020-05-27 20:20:03] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 34 ms.
[2020-05-27 20:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2020-05-27 20:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:03] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2020-05-27 20:20:03] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 38 ms.
[2020-05-27 20:20:05] [INFO ] Added : 343 causal constraints over 69 iterations in 1969 ms. Result :sat
[2020-05-27 20:20:06] [INFO ] [Real]Absence check using 221 positive place invariants in 99 ms returned sat
[2020-05-27 20:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:06] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2020-05-27 20:20:06] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 39 ms.
[2020-05-27 20:20:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:07] [INFO ] [Nat]Absence check using 221 positive place invariants in 111 ms returned sat
[2020-05-27 20:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:07] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2020-05-27 20:20:07] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 29 ms.
[2020-05-27 20:20:10] [INFO ] Added : 344 causal constraints over 69 iterations in 2926 ms. Result :sat
[2020-05-27 20:20:11] [INFO ] [Real]Absence check using 221 positive place invariants in 106 ms returned sat
[2020-05-27 20:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:11] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2020-05-27 20:20:11] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 32 ms.
[2020-05-27 20:20:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:11] [INFO ] [Nat]Absence check using 221 positive place invariants in 103 ms returned sat
[2020-05-27 20:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:12] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2020-05-27 20:20:12] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 31 ms.
[2020-05-27 20:20:16] [INFO ] Added : 355 causal constraints over 73 iterations in 3817 ms. Result :sat
[2020-05-27 20:20:16] [INFO ] [Real]Absence check using 221 positive place invariants in 98 ms returned sat
[2020-05-27 20:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:17] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2020-05-27 20:20:17] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 32 ms.
[2020-05-27 20:20:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:17] [INFO ] [Nat]Absence check using 221 positive place invariants in 108 ms returned sat
[2020-05-27 20:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:18] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2020-05-27 20:20:18] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2020-05-27 20:20:20] [INFO ] Added : 358 causal constraints over 72 iterations in 2251 ms. Result :sat
[2020-05-27 20:20:20] [INFO ] [Real]Absence check using 221 positive place invariants in 106 ms returned sat
[2020-05-27 20:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:21] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2020-05-27 20:20:21] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 30 ms.
[2020-05-27 20:20:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:21] [INFO ] [Nat]Absence check using 221 positive place invariants in 104 ms returned sat
[2020-05-27 20:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:22] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2020-05-27 20:20:22] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 22 ms.
[2020-05-27 20:20:24] [INFO ] Added : 355 causal constraints over 71 iterations in 2577 ms. Result :sat
[2020-05-27 20:20:24] [INFO ] [Real]Absence check using 221 positive place invariants in 90 ms returned sat
[2020-05-27 20:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:25] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-05-27 20:20:25] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2020-05-27 20:20:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:25] [INFO ] [Nat]Absence check using 221 positive place invariants in 98 ms returned sat
[2020-05-27 20:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:26] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-05-27 20:20:26] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 19 ms.
[2020-05-27 20:20:29] [INFO ] Added : 359 causal constraints over 74 iterations in 3107 ms. Result :sat
[2020-05-27 20:20:29] [INFO ] [Real]Absence check using 221 positive place invariants in 88 ms returned sat
[2020-05-27 20:20:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:30] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2020-05-27 20:20:30] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 39 ms.
[2020-05-27 20:20:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:30] [INFO ] [Nat]Absence check using 221 positive place invariants in 79 ms returned sat
[2020-05-27 20:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:30] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2020-05-27 20:20:31] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 32 ms.
[2020-05-27 20:20:34] [INFO ] Added : 351 causal constraints over 73 iterations in 3504 ms. Result :sat
[2020-05-27 20:20:34] [INFO ] [Real]Absence check using 221 positive place invariants in 100 ms returned sat
[2020-05-27 20:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:35] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2020-05-27 20:20:35] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 25 ms.
[2020-05-27 20:20:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:35] [INFO ] [Nat]Absence check using 221 positive place invariants in 100 ms returned sat
[2020-05-27 20:20:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:36] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2020-05-27 20:20:36] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 15 ms.
[2020-05-27 20:20:38] [INFO ] Added : 352 causal constraints over 71 iterations in 2070 ms. Result :sat
[2020-05-27 20:20:38] [INFO ] [Real]Absence check using 221 positive place invariants in 101 ms returned sat
[2020-05-27 20:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:39] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2020-05-27 20:20:39] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 26 ms.
[2020-05-27 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:39] [INFO ] [Nat]Absence check using 221 positive place invariants in 136 ms returned sat
[2020-05-27 20:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:39] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2020-05-27 20:20:39] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 24 ms.
[2020-05-27 20:20:42] [INFO ] Added : 349 causal constraints over 71 iterations in 2362 ms. Result :sat
[2020-05-27 20:20:42] [INFO ] [Real]Absence check using 221 positive place invariants in 81 ms returned sat
[2020-05-27 20:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:42] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-05-27 20:20:42] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 24 ms.
[2020-05-27 20:20:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 20:20:43] [INFO ] [Nat]Absence check using 221 positive place invariants in 98 ms returned sat
[2020-05-27 20:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 20:20:43] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2020-05-27 20:20:43] [INFO ] Computed and/alt/rep : 361/1119/361 causal constraints in 21 ms.
[2020-05-27 20:20:45] [INFO ] Added : 356 causal constraints over 73 iterations in 1970 ms. Result :sat
[2020-05-27 20:20:46] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-27 20:20:46] [INFO ] Flatten gal took : 101 ms
FORMULA ShieldPPPt-PT-020A-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 20:20:46] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 20:20:46] [INFO ] Applying decomposition
[2020-05-27 20:20:46] [INFO ] Flatten gal took : 40 ms
[2020-05-27 20:20:46] [INFO ] Input system was already deterministic with 362 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/graph353539976985807195.txt, -o, /tmp/graph353539976985807195.bin, -w, /tmp/graph353539976985807195.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/graph353539976985807195.bin, -l, -1, -v, -w, /tmp/graph353539976985807195.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 20:20:46] [INFO ] Decomposing Gal with order
[2020-05-27 20:20:46] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 362 rows 503 cols
[2020-05-27 20:20:46] [INFO ] Computed 221 place invariants in 10 ms
inv : p0 + p326 + p327 = 1
inv : p0 + p430 + p433 + p434 = 1
inv : p0 + p55 + p58 + p59 = 1
inv : p0 + p280 + p281 + p282 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p185 + p186 + p187 = 1
inv : p0 + p351 + p352 = 1
inv : p0 + p335 + p338 + p339 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p90 + p91 + p92 = 1
inv : p0 + p240 + p243 + p244 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p435 + p438 + p439 = 1
inv : p0 + p376 + p377 = 1
inv : p0 + p120 + p121 = 1
inv : p0 + p155 + p158 + p159 = 1
inv : p0 + p330 + p333 + p334 = 1
inv : p0 + p180 + p181 + p182 = 1
inv : p0 + p285 + p286 + p287 = 1
inv : p0 + p401 + p402 = 1
inv : p0 + p60 + p63 + p64 = 1
inv : p0 + p426 + p427 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p190 + p191 + p192 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + p276 + p277 = 1
inv : p0 + p465 + p466 + p467 = 1
inv : p0 + p85 + p86 + p87 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p440 + p443 + p444 = 1
inv : p0 + p10 + p11 + p12 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p160 + p163 + p164 = 1
inv : p0 + p455 + p456 + p457 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p80 + p81 + p82 = 1
inv : p0 + p422 + p423 = 1
inv : p0 + p501 + p502 = 1
inv : p0 + p472 + p473 = 1
inv : p0 + p451 + p452 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p110 + p111 + p112 = 1
inv : p0 + p485 + p486 + p487 = 1
inv : p0 + p380 + p381 + p382 = 1
inv : p0 + p355 + p358 + p359 = 1
inv : p0 + p76 + p77 = 1
inv : p0 + p415 + p418 + p419 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p365 + p366 + p367 = 1
inv : p0 + p40 + p43 + p44 = 1
inv : p0 + p340 + p343 + p344 = 1
inv : p0 + p290 + p291 + p292 = 1
inv : p0 + p130 + p133 + p134 = 1
inv : p0 + p265 + p268 + p269 = 1
inv : p0 + p201 + p202 = 1
inv : p0 + p260 + p261 + p262 = 1
inv : p0 + p70 + p71 = 1
inv : p0 + p235 + p238 + p239 = 1
inv : p0 + p115 + p116 + p117 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p445 + p446 = 1
inv : p0 + p315 + p318 + p319 = 1
inv : p0 + p26 + p27 = 1
inv : p0 + p405 + p408 + p409 = 1
inv : p0 + p490 + p491 + p492 = 1
inv : p0 + p360 + p363 + p364 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p310 + p311 + p312 = 1
inv : p0 + p355 + p356 + p357 = 1
inv : p0 + p165 + p168 + p169 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p180 + p183 + p184 = 1
inv : p0 + p24 + p25 = 1
inv : p0 + p205 + p206 + p207 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p160 + p161 + p162 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p270 + p271 = 1
inv : p0 + p30 + p33 + p34 = 1
inv : p0 + p222 + p223 = 1
inv : p0 + p420 + p421 = 1
inv : p0 + p465 + p468 + p469 = 1
inv : p0 + p385 + p386 + p387 = 1
inv : p0 + p90 + p93 + p94 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p255 + p258 + p259 = 1
inv : p0 + p72 + p73 = 1
inv : p0 + p135 + p138 + p139 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p210 + p213 + p214 = 1
inv : p0 + p265 + p266 + p267 = 1
inv : p0 + p176 + p177 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p403 + p404 = 1
inv : p0 + p397 + p398 = 1
inv : p0 + p340 + p341 + p342 = 1
inv : p0 + p328 + p329 = 1
inv : p0 + p430 + p431 + p432 = 1
inv : p0 + p460 + p461 + p462 = 1
inv : p0 + p390 + p393 + p394 = 1
inv : p0 + p322 + p323 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p374 + p375 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p178 + p179 = 1
inv : p0 + p474 + p475 = 1
inv : p0 + p140 + p141 + p142 = 1
inv : p0 + p10 + p13 + p14 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p449 + p450 = 1
inv : p0 + p290 + p293 + p294 = 1
inv : p0 + p235 + p236 + p237 = 1
inv : p0 + p424 + p425 = 1
inv : p0 + p330 + p331 + p332 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p285 + p288 + p289 = 1
inv : p0 + p499 + p500 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p135 + p136 + p137 = 1
inv : p0 + p40 + p41 + p42 = 1
inv : p0 + p415 + p416 + p417 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p240 + p241 + p242 = 1
inv : p0 + p15 + p18 + p19 = 1
inv : p0 + p380 + p383 + p384 = 1
inv : p0 + p105 + p108 + p109 = 1
inv : p0 + p55 + p56 + p57 = 1
inv : p0 + p485 + p488 + p489 = 1
inv : p0 + p130 + p131 + p132 = 1
inv : p0 + p228 + p229 = 1
inv : p0 + p324 + p325 = 1
inv : p0 + p78 + p79 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p274 + p275 = 1
inv : p0 + p115 + p118 + p119 = 1
inv : p0 + p490 + p493 + p494 = 1
inv : p0 + p35 + p36 + p37 = 1
inv : p0 + p378 + p379 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p349 + p350 = 1
inv : p0 + p224 + p225 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p122 + p123 = 1
inv : p0 + p495 + p496 = 1
inv : p0 + p190 + p193 + p194 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p215 + p216 + p217 = 1
inv : p0 + p85 + p88 + p89 = 1
inv : p0 + p399 + p400 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p65 + p66 + p67 = 1
inv : p0 + p460 + p463 + p464 = 1
inv : p0 + p310 + p313 + p314 = 1
inv : p0 + p230 + p231 + p232 = 1
inv : p0 + p280 + p283 + p284 = 1
inv : p0 + p440 + p441 + p442 = 1
inv : p0 + p155 + p156 + p157 = 1
inv : p0 + p385 + p388 + p389 = 1
inv : p0 + p410 + p411 + p412 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p335 + p336 + p337 = 1
inv : p0 + p205 + p208 + p209 = 1
inv : p0 + p305 + p306 + p307 = 1
inv : p0 + p210 + p211 + p212 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p395 + p396 = 1
inv : p0 + p370 + p371 = 1
inv : p0 + p35 + p38 + p39 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p255 + p256 + p257 = 1
inv : p0 + p80 + p83 + p84 = 1
inv : p0 + p272 + p273 = 1
inv : p0 + p320 + p321 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p165 + p166 + p167 = 1
inv : p0 + p74 + p75 = 1
inv : p0 + p260 + p263 + p264 = 1
inv : p0 + p347 + p348 = 1
inv : p0 + p365 + p368 + p369 = 1
inv : p0 + p215 + p218 + p219 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p405 + p406 + p407 = 1
inv : p0 + p390 + p391 + p392 = 1
inv : p0 + p305 + p308 + p309 = 1
inv : p0 + p435 + p436 + p437 = 1
inv : p0 + p410 + p413 + p414 = 1
inv : p0 + p455 + p458 + p459 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p372 + p373 = 1
inv : p0 + p315 + p316 + p317 = 1
inv : p0 + p447 + p448 = 1
inv : p0 + p220 + p221 = 1
inv : p0 + p185 + p188 + p189 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p230 + p233 + p234 = 1
inv : p0 + p28 + p29 = 1
inv : p0 + p360 + p361 + p362 = 1
inv : p0 + p140 + p143 + p144 = 1
inv : p0 + p60 + p61 + p62 = 1
inv : p0 + p30 + p31 + p32 = 1
inv : p0 + p15 + p16 + p17 = 1
inv : p0 + p110 + p113 + p114 = 1
inv : p0 + p105 + p106 + p107 = 1
inv : p0 + p65 + p68 + p69 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p226 + p227 = 1
inv : p0 + p470 + p471 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p476 + p477 = 1
inv : p0 + p249 + p250 = 1
Total of 221 invariants.
[2020-05-27 20:20:46] [INFO ] Computed 221 place invariants in 18 ms
[2020-05-27 20:20:46] [INFO ] Removed a total of 60 redundant transitions.
[2020-05-27 20:20:46] [INFO ] Flatten gal took : 80 ms
[2020-05-27 20:20:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 26 ms.
[2020-05-27 20:20:47] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 15 ms
[2020-05-27 20:20:47] [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 12 LTL properties
Checking formula 0 : !(((X("(((i5.u27.p87==1)&&(i5.u27.p89==1))||((i4.i0.i2.u49.p153==1)&&(i4.i0.i2.u56.p176==1)))"))||(!(X(F("((((i2.u17.p53==1)&&(i2.u24.p76==1))&&(i4.i0.i2.u49.p153==1))&&(i4.i0.i2.u56.p176==1))"))))))
Formula 0 simplified : !(X"(((i5.u27.p87==1)&&(i5.u27.p89==1))||((i4.i0.i2.u49.p153==1)&&(i4.i0.i2.u56.p176==1)))" | !XF"((((i2.u17.p53==1)&&(i2.u24.p76==1))&&(i4.i0.i2.u49.p153==1))&&(i4.i0.i2.u56.p176==1))")
built 28 ordering constraints for composite.
built 23 ordering constraints for composite.
built 19 ordering constraints for composite.
built 25 ordering constraints for composite.
built 25 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 19 ordering constraints for composite.
built 21 ordering constraints for composite.
built 21 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 24 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 16 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 14 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 19 ordering constraints for composite.
built 21 ordering constraints for composite.
built 22 ordering constraints for composite.
[2020-05-27 20:20:47] [INFO ] Proved 503 variables to be positive in 917 ms
[2020-05-27 20:20:47] [INFO ] Computing symmetric may disable matrix : 362 transitions.
[2020-05-27 20:20:47] [INFO ] Computation of disable matrix completed :0/362 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:20:47] [INFO ] Computation of Complete disable matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:20:47] [INFO ] Computing symmetric may enable matrix : 362 transitions.
[2020-05-27 20:20:47] [INFO ] Computation of Complete enable matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:20:52] [INFO ] Computing symmetric co enabling matrix : 362 transitions.
[2020-05-27 20:20:52] [INFO ] Computation of co-enabling matrix(0/362) took 34 ms. Total solver calls (SAT/UNSAT): 4(0/4)
[2020-05-27 20:20:55] [INFO ] Computation of co-enabling matrix(106/362) took 3053 ms. Total solver calls (SAT/UNSAT): 667(46/621)
[2020-05-27 20:20:58] [INFO ] Computation of co-enabling matrix(239/362) took 6058 ms. Total solver calls (SAT/UNSAT): 977(99/878)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-27 20:21:00] [INFO ] Computation of Finished co-enabling matrix. took 7749 ms. Total solver calls (SAT/UNSAT): 1099(139/960)
[2020-05-27 20:21:00] [INFO ] Computing Do-Not-Accords matrix : 362 transitions.
[2020-05-27 20:21:00] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 20:21:00] [INFO ] Built C files in 13934ms 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 3938 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 85 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ( X((LTLAP0==true))) || ( !( X(<>((LTLAP1==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((LTLAP0==true))) || ( !( X(<>((LTLAP1==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((LTLAP0==true))) || ( !( X(<>((LTLAP1==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 20:41:03] [INFO ] Applying decomposition
[2020-05-27 20:41:03] [INFO ] Flatten gal took : 58 ms
[2020-05-27 20:41:03] [INFO ] Decomposing Gal with order
[2020-05-27 20:41:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 20:41:03] [INFO ] Removed a total of 120 redundant transitions.
[2020-05-27 20:41:03] [INFO ] Flatten gal took : 74 ms
[2020-05-27 20:41:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2020-05-27 20:41:03] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
[2020-05-27 20:41:03] [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 12 LTL properties
Checking formula 0 : !(((X("(((i27.u49.p87==1)&&(i27.u50.p89==1))||((u86.p153==1)&&(u99.p176==1)))"))||(!(X(F("((((u30.p53==1)&&(u43.p76==1))&&(u86.p153==1))&&(u99.p176==1))"))))))
Formula 0 simplified : !(X"(((i27.u49.p87==1)&&(i27.u50.p89==1))||((u86.p153==1)&&(u99.p176==1)))" | !XF"((((u30.p53==1)&&(u43.p76==1))&&(u86.p153==1))&&(u99.p176==1))")
built 221 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.
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.
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 4 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.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
507 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,5.14686,152616,1,0,302832,562,5074,451674,45,436,554288
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X("((i50.u88.p157==1)&&(i50.u89.p159==1))"))||(((X(G("((i3.u7.p12==1)&&(i3.u8.p14==1))")))U("((u254.p454==1)&&(u265.p473==1))"))&&((F("((((i3.u7.p12==1)&&(i3.u8.p14==1))&&(i50.u88.p157==1))&&(i50.u89.p159==1))"))U("((i3.u7.p12==1)&&(i3.u8.p14==1))")))))
Formula 1 simplified : !(X"((i50.u88.p157==1)&&(i50.u89.p159==1))" | ((XG"((i3.u7.p12==1)&&(i3.u8.p14==1))" U "((u254.p454==1)&&(u265.p473==1))") & (F"((((i3.u7.p12==1)&&(i3.u8.p14==1))&&(i50.u88.p157==1))&&(i50.u89.p159==1))" U "((i3.u7.p12==1)&&(i3.u8.p14==1))")))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
98 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.13939,197628,1,0,403873,562,5447,591614,45,436,757482
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X((G(F(!((!(F("((i122.u214.p381==1)&&(u222.p396==1))")))U(X("((i138.u243.p433==1)&&(u252.p450==1))"))))))||(("((i138.u243.p433==1)&&(u252.p450==1))")U("((i19.u35.p61==1)&&(u40.p71==1))"))))))
Formula 2 simplified : !GX(GF!(!F"((i122.u214.p381==1)&&(u222.p396==1))" U X"((i138.u243.p433==1)&&(u252.p450==1))") | ("((i138.u243.p433==1)&&(u252.p450==1))" U "((i19.u35.p61==1)&&(u40.p71==1))"))
8 unique states visited
7 strongly connected components in search stack
11 transitions explored
8 items max in DFS search stack
120 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,7.34546,241004,1,0,500625,562,5991,724056,45,436,949723
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(F((X((F("(u99.p176==1)"))U("((u226.p404==1)&&(u237.p423==1))")))U(G("((u226.p404==1)&&(u237.p423==1))")))))&&(!(X(G("((i36.u66.p117==1)&&(i36.u67.p119==1))"))))))
Formula 3 simplified : !(!F(X(F"(u99.p176==1)" U "((u226.p404==1)&&(u237.p423==1))") U G"((u226.p404==1)&&(u237.p423==1))") & !XG"((i36.u66.p117==1)&&(i36.u67.p119==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,7.37666,241776,1,0,501173,562,6082,724722,45,436,950587
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("((i2.u4.p6==1)&&(u12.p21==1))")U(!(G(F((((F(G("((i84.u150.p267==1)&&(i84.u151.p269==1))")))&&("(i2.u4.p6==1)"))&&("(u12.p21==1)"))||("((i146.u256.p457==1)&&(i146.u257.p459==1))")))))))
Formula 4 simplified : !("((i2.u4.p6==1)&&(u12.p21==1))" U !GF("((i146.u256.p457==1)&&(i146.u257.p459==1))" | ("(i2.u4.p6==1)" & "(u12.p21==1)" & FG"((i84.u150.p267==1)&&(i84.u151.p269==1))")))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
20 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,7.58405,249112,1,0,516852,562,6506,743770,47,436,975940
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G((F("((i18.u318.p55==1)&&(u41.p72==1))"))U(!(F("((i67.u120.p213==1)&&(u127.p227==1))"))))))
Formula 5 simplified : !G(F"((i18.u318.p55==1)&&(u41.p72==1))" U !F"((i67.u120.p213==1)&&(u127.p227==1))")
3 unique states visited
3 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
55 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,8.12229,273396,1,0,578254,562,6729,818300,47,436,1085766
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((("((i114.u201.p358!=1)||(u210.p375!=1))")U("((i98.u282.p305==1)&&(u181.p322==1))"))U(X((!(F("((((i19.u36.p63!=1)||(u43.p77!=1))&&(i107.u189.p337==1))&&(i107.u190.p339==1))")))||(!(X("(u98.p174==1)")))))))
Formula 6 simplified : !(("((i114.u201.p358!=1)||(u210.p375!=1))" U "((i98.u282.p305==1)&&(u181.p322==1))") U X(!F"((((i19.u36.p63!=1)||(u43.p77!=1))&&(i107.u189.p337==1))&&(i107.u190.p339==1))" | !X"(u98.p174==1)"))
6 unique states visited
0 strongly connected components in search stack
5 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,8.13711,274168,1,0,578254,562,6855,818300,47,436,1086708
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-020A-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((!(X(F(X("((u142.p254==1)&&(u153.p273==1))")))))||(X((G("((i92.u164.p292==1)&&(i92.u165.p294==1))"))&&("((i92.u164.p292!=1)||(i92.u165.p294!=1))"))))||(F("((i108.u192.p341==1)&&(u197.p352==1))"))))
Formula 7 simplified : !(!XFX"((u142.p254==1)&&(u153.p273==1))" | X("((i92.u164.p292!=1)||(i92.u165.p294!=1))" & G"((i92.u164.p292==1)&&(i92.u165.p294==1))") | F"((i108.u192.p341==1)&&(u197.p352==1))")
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
20 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,8.33651,281560,1,0,594269,562,7064,838755,47,436,1117378
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA ShieldPPPt-PT-020A-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((F(!(G((!(X("((i100.u283.p315==1)&&(u196.p349==1))")))&&("(u14.p24!=1)")))))U("((u14.p24==1)||((i100.u283.p315==1)&&(u196.p349==1)))"))))
Formula 8 simplified : !X(F!G("(u14.p24!=1)" & !X"((i100.u283.p315==1)&&(u196.p349==1))") U "((u14.p24==1)||((i100.u283.p315==1)&&(u196.p349==1)))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
65 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,8.99134,291328,1,0,614035,562,7420,864347,47,436,1154935
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(X(!(X(X(F("(u124.p220==1)"))))))))
Formula 9 simplified : X!XXF"(u124.p220==1)"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,9.255,303736,1,0,642274,562,7628,900857,47,436,1210603
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G(F("((u184.p329==1)&&(u195.p348==1))"))))
Formula 10 simplified : !GF"((u184.p329==1)&&(u195.p348==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,9.33832,305056,1,0,643083,562,7753,901932,47,436,1211879
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((("(u197.p351==1)")U("((i20.u38.p67==1)&&(i20.u39.p69==1))"))U(X(F((F("((i147.u259.p462==1)&&(i147.u260.p464==1))"))&&("(u197.p351==1)"))))))
Formula 11 simplified : !(("(u197.p351==1)" U "((i20.u38.p67==1)&&(i20.u39.p69==1))") U XF("(u197.p351==1)" & F"((i147.u259.p462==1)&&(i147.u260.p464==1))"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
32 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.65908,314560,1,0,664725,562,7901,929711,47,436,1251876
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1590612076239
--------------------
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="ShieldPPPt-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 ShieldPPPt-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-159033476000666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020A.tgz
mv ShieldPPPt-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 '
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 ;