About the Execution of ITS-Tools for ShieldIIPt-PT-030A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.410 | 165077.00 | 226608.00 | 342.20 | FFFFFFFFFFFFFTFF | 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-159033475500330.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-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475500330
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.1K May 14 01:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K 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.2K May 13 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 08:09 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 159K 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-030A-00
FORMULA_NAME ShieldIIPt-PT-030A-01
FORMULA_NAME ShieldIIPt-PT-030A-02
FORMULA_NAME ShieldIIPt-PT-030A-03
FORMULA_NAME ShieldIIPt-PT-030A-04
FORMULA_NAME ShieldIIPt-PT-030A-05
FORMULA_NAME ShieldIIPt-PT-030A-06
FORMULA_NAME ShieldIIPt-PT-030A-07
FORMULA_NAME ShieldIIPt-PT-030A-08
FORMULA_NAME ShieldIIPt-PT-030A-09
FORMULA_NAME ShieldIIPt-PT-030A-10
FORMULA_NAME ShieldIIPt-PT-030A-11
FORMULA_NAME ShieldIIPt-PT-030A-12
FORMULA_NAME ShieldIIPt-PT-030A-13
FORMULA_NAME ShieldIIPt-PT-030A-14
FORMULA_NAME ShieldIIPt-PT-030A-15
=== Now, execution of the tool begins
BK_START 1590583076568
[2020-05-27 12:37: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 12:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:37:58] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2020-05-27 12:37:58] [INFO ] Transformed 573 places.
[2020-05-27 12:37:58] [INFO ] Transformed 423 transitions.
[2020-05-27 12:37:58] [INFO ] Found NUPN structural information;
[2020-05-27 12:37:58] [INFO ] Parsed PT model containing 573 places and 423 transitions in 112 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 634 ms. (steps per millisecond=157 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 422 rows 573 cols
[2020-05-27 12:37:58] [INFO ] Computed 271 place invariants in 14 ms
[2020-05-27 12:37:59] [INFO ] [Real]Absence check using 271 positive place invariants in 106 ms returned sat
[2020-05-27 12:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:37:59] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2020-05-27 12:37:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:37:59] [INFO ] [Nat]Absence check using 271 positive place invariants in 140 ms returned sat
[2020-05-27 12:37:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:00] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2020-05-27 12:38:00] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 38 ms.
[2020-05-27 12:38:05] [INFO ] Added : 416 causal constraints over 86 iterations in 4640 ms. Result :sat
[2020-05-27 12:38:05] [INFO ] [Real]Absence check using 271 positive place invariants in 262 ms returned sat
[2020-05-27 12:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:06] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2020-05-27 12:38:06] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 46 ms.
[2020-05-27 12:38:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:06] [INFO ] [Nat]Absence check using 271 positive place invariants in 82 ms returned sat
[2020-05-27 12:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:07] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2020-05-27 12:38:07] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 36 ms.
[2020-05-27 12:38:11] [INFO ] Added : 405 causal constraints over 83 iterations in 4490 ms. Result :sat
[2020-05-27 12:38:12] [INFO ] [Real]Absence check using 271 positive place invariants in 9 ms returned unsat
[2020-05-27 12:38:12] [INFO ] [Real]Absence check using 271 positive place invariants in 129 ms returned sat
[2020-05-27 12:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:13] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2020-05-27 12:38:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:13] [INFO ] [Nat]Absence check using 271 positive place invariants in 112 ms returned sat
[2020-05-27 12:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:13] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2020-05-27 12:38:14] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 48 ms.
[2020-05-27 12:38:18] [INFO ] Added : 406 causal constraints over 83 iterations in 4796 ms. Result :sat
[2020-05-27 12:38:19] [INFO ] [Real]Absence check using 271 positive place invariants in 123 ms returned sat
[2020-05-27 12:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:19] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2020-05-27 12:38:19] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 26 ms.
[2020-05-27 12:38:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:19] [INFO ] [Nat]Absence check using 271 positive place invariants in 93 ms returned sat
[2020-05-27 12:38:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:20] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2020-05-27 12:38:20] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 23 ms.
[2020-05-27 12:38:24] [INFO ] Added : 404 causal constraints over 81 iterations in 4359 ms. Result :sat
[2020-05-27 12:38:25] [INFO ] [Real]Absence check using 271 positive place invariants in 127 ms returned sat
[2020-05-27 12:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:25] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2020-05-27 12:38:25] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 36 ms.
[2020-05-27 12:38:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:26] [INFO ] [Nat]Absence check using 271 positive place invariants in 90 ms returned sat
[2020-05-27 12:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:26] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2020-05-27 12:38:26] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 32 ms.
[2020-05-27 12:38:30] [INFO ] Added : 419 causal constraints over 86 iterations in 4132 ms. Result :sat
[2020-05-27 12:38:31] [INFO ] [Real]Absence check using 271 positive place invariants in 147 ms returned sat
[2020-05-27 12:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:31] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2020-05-27 12:38:31] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 23 ms.
[2020-05-27 12:38:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:32] [INFO ] [Nat]Absence check using 271 positive place invariants in 118 ms returned sat
[2020-05-27 12:38:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:32] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2020-05-27 12:38:32] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 22 ms.
[2020-05-27 12:38:36] [INFO ] Added : 402 causal constraints over 81 iterations in 3983 ms. Result :sat
[2020-05-27 12:38:37] [INFO ] [Real]Absence check using 271 positive place invariants in 124 ms returned sat
[2020-05-27 12:38:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:37] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2020-05-27 12:38:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:37] [INFO ] [Nat]Absence check using 271 positive place invariants in 112 ms returned sat
[2020-05-27 12:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:38] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2020-05-27 12:38:38] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 45 ms.
[2020-05-27 12:38:42] [INFO ] Added : 405 causal constraints over 83 iterations in 4385 ms. Result :sat
[2020-05-27 12:38:43] [INFO ] [Real]Absence check using 271 positive place invariants in 124 ms returned sat
[2020-05-27 12:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:43] [INFO ] [Real]Absence check using state equation in 690 ms returned sat
[2020-05-27 12:38:43] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 38 ms.
[2020-05-27 12:38:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:44] [INFO ] [Nat]Absence check using 271 positive place invariants in 111 ms returned sat
[2020-05-27 12:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:44] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2020-05-27 12:38:44] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 25 ms.
[2020-05-27 12:38:48] [INFO ] Added : 413 causal constraints over 84 iterations in 3418 ms. Result :sat
[2020-05-27 12:38:48] [INFO ] [Real]Absence check using 271 positive place invariants in 101 ms returned sat
[2020-05-27 12:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:49] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2020-05-27 12:38:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:49] [INFO ] [Nat]Absence check using 271 positive place invariants in 88 ms returned sat
[2020-05-27 12:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:49] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2020-05-27 12:38:49] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 24 ms.
[2020-05-27 12:38:52] [INFO ] Added : 411 causal constraints over 83 iterations in 3154 ms. Result :sat
[2020-05-27 12:38:53] [INFO ] [Real]Absence check using 271 positive place invariants in 90 ms returned sat
[2020-05-27 12:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:53] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2020-05-27 12:38:53] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 24 ms.
[2020-05-27 12:38:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:54] [INFO ] [Nat]Absence check using 271 positive place invariants in 119 ms returned sat
[2020-05-27 12:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:54] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2020-05-27 12:38:54] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 19 ms.
[2020-05-27 12:38:58] [INFO ] Added : 417 causal constraints over 85 iterations in 3555 ms. Result :sat
[2020-05-27 12:38:58] [INFO ] [Real]Absence check using 271 positive place invariants in 147 ms returned sat
[2020-05-27 12:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:59] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2020-05-27 12:38:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:38:59] [INFO ] [Nat]Absence check using 271 positive place invariants in 87 ms returned sat
[2020-05-27 12:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:38:59] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2020-05-27 12:38:59] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 21 ms.
[2020-05-27 12:39:04] [INFO ] Added : 415 causal constraints over 84 iterations in 4460 ms. Result :sat
[2020-05-27 12:39:04] [INFO ] [Real]Absence check using 271 positive place invariants in 123 ms returned sat
[2020-05-27 12:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:39:05] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2020-05-27 12:39:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:39:05] [INFO ] [Nat]Absence check using 271 positive place invariants in 123 ms returned sat
[2020-05-27 12:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:39:06] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2020-05-27 12:39:06] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 42 ms.
[2020-05-27 12:39:11] [INFO ] Added : 413 causal constraints over 84 iterations in 5157 ms. Result :sat
[2020-05-27 12:39:11] [INFO ] [Real]Absence check using 271 positive place invariants in 121 ms returned sat
[2020-05-27 12:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:39:12] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2020-05-27 12:39:12] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 22 ms.
[2020-05-27 12:39:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:39:12] [INFO ] [Nat]Absence check using 271 positive place invariants in 130 ms returned sat
[2020-05-27 12:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:39:12] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2020-05-27 12:39:13] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 24 ms.
[2020-05-27 12:39:17] [INFO ] Added : 414 causal constraints over 85 iterations in 4096 ms. Result :sat
[2020-05-27 12:39:17] [INFO ] [Real]Absence check using 271 positive place invariants in 123 ms returned sat
[2020-05-27 12:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:39:18] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2020-05-27 12:39:18] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 26 ms.
[2020-05-27 12:39:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:39:18] [INFO ] [Nat]Absence check using 271 positive place invariants in 118 ms returned sat
[2020-05-27 12:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:39:18] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2020-05-27 12:39:18] [INFO ] Computed and/alt/rep : 421/1499/421 causal constraints in 19 ms.
[2020-05-27 12:39:22] [INFO ] Added : 405 causal constraints over 83 iterations in 3868 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-05-27 12:39:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-27 12:39:23] [INFO ] Flatten gal took : 264 ms
FORMULA ShieldIIPt-PT-030A-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-27 12:39:23] [INFO ] Flatten gal took : 78 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 12:39:23] [INFO ] Applying decomposition
[2020-05-27 12:39:23] [INFO ] Flatten gal took : 103 ms
[2020-05-27 12:39:23] [INFO ] Input system was already deterministic with 422 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 422 rows 573 cols
[2020-05-27 12:39:24] [INFO ] Computed 271 place invariants in 6 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p20 + p21 = 1
inv : p0 + p60 + p61 = 1
inv : p0 + p50 + p51 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p90 + p91 = 1
inv : p0 + p542 + p543 = 1
inv : p0 + p512 + p513 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p497 + p498 = 1
inv : p0 + p556 + p559 + p560 = 1
inv : p0 + p487 + p488 = 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 + p567 + p568 = 1
inv : p0 + p62 + p63 + p64 = 1
inv : p0 + p210 + p211 = 1
inv : p0 + p417 + p418 = 1
inv : p0 + p457 + p458 = 1
inv : p0 + p402 + p403 = 1
inv : p0 + p252 + p253 + p254 = 1
inv : p0 + p250 + p251 = 1
inv : p0 + p472 + p473 = 1
inv : p0 + p280 + p281 = 1
inv : p0 + p352 + p353 = 1
inv : p0 + p5 + p6 + p7 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p119 + p122 + p123 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p366 + p369 + p370 = 1
inv : p0 + p527 + p528 = 1
inv : p0 + p415 + p416 = 1
inv : p0 + p499 + p500 + p501 = 1
inv : p0 + p282 + p283 = 1
inv : p0 + p62 + p65 + p66 = 1
inv : p0 + p138 + p139 + p140 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p362 + p363 = 1
inv : p0 + p525 + p526 = 1
inv : p0 + p455 + p456 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p212 + p213 = 1
inv : p0 + p375 + p376 = 1
inv : p0 + p442 + p445 + p446 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p385 + p386 + p387 = 1
inv : p0 + p432 + p433 = 1
inv : p0 + p200 + p201 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p170 + p171 = 1
inv : p0 + p392 + p393 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p240 + p241 = 1
inv : p0 + p130 + p131 = 1
inv : p0 + p233 + p236 + p237 = 1
inv : p0 + p322 + p323 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p48 + p49 = 1
inv : p0 + p485 + p486 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p514 + p515 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p474 + p475 = 1
inv : p0 + p449 + p450 = 1
inv : p0 + p176 + p177 + p178 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p480 + p483 + p484 = 1
inv : p0 + p208 + p209 = 1
inv : p0 + p459 + p460 = 1
inv : p0 + p5 + p8 + p9 = 1
inv : p0 + p379 + p380 = 1
inv : p0 + p544 + p545 = 1
inv : p0 + p394 + p395 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p529 + p530 = 1
inv : p0 + p81 + p82 + p83 = 1
inv : p0 + p324 + p325 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p565 + p566 = 1
inv : p0 + p314 + p315 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p358 + p359 = 1
inv : p0 + p413 + p414 = 1
inv : p0 + p12 + p13 = 1
inv : p0 + p288 + p289 = 1
inv : p0 + p58 + p59 = 1
inv : p0 + p495 + p496 = 1
inv : p0 + p347 + p350 + p351 = 1
inv : p0 + p172 + p173 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p309 + p310 + p311 = 1
inv : p0 + p100 + p103 + p104 = 1
inv : p0 + p428 + p429 = 1
inv : p0 + p556 + p557 + p558 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p242 + p243 = 1
inv : p0 + p430 + p431 = 1
inv : p0 + p404 + p405 + p406 = 1
inv : p0 + p423 + p426 + p427 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p440 + p441 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p328 + p331 + p332 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p563 + p564 = 1
inv : p0 + p360 + p361 = 1
inv : p0 + p328 + p329 + p330 = 1
inv : p0 + p510 + p511 = 1
inv : p0 + p233 + p234 + p235 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p493 + p494 = 1
inv : p0 + p56 + p57 = 1
inv : p0 + p244 + p245 = 1
inv : p0 + p174 + p175 = 1
inv : p0 + p126 + p127 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p447 + p448 = 1
inv : p0 + p499 + p502 + p503 = 1
inv : p0 + p92 + p93 = 1
inv : p0 + p480 + p481 + p482 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p278 + p279 = 1
inv : p0 + p162 + p163 = 1
inv : p0 + p252 + p255 + p256 = 1
inv : p0 + p22 + p23 = 1
inv : p0 + p476 + p477 = 1
inv : p0 + p546 + p547 = 1
inv : p0 + p377 + p378 = 1
inv : p0 + p157 + p158 + p159 = 1
inv : p0 + p326 + p327 = 1
inv : p0 + p341 + p342 = 1
inv : p0 + p381 + p382 = 1
inv : p0 + p371 + p372 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p461 + p464 + p465 = 1
inv : p0 + p411 + p412 = 1
inv : p0 + p100 + p101 + p102 = 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 + p436 + p437 = 1
inv : p0 + p356 + p357 = 1
inv : p0 + p404 + p407 + p408 = 1
inv : p0 + p81 + p84 + p85 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p516 + p517 = 1
inv : p0 + p506 + p507 = 1
inv : p0 + p96 + p97 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p451 + p452 = 1
inv : p0 + p571 + p572 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p537 + p538 + p539 = 1
inv : p0 + p466 + p467 = 1
inv : p0 + p166 + p167 = 1
inv : p0 + p290 + p291 + p292 = 1
inv : p0 + p396 + p397 = 1
inv : p0 + p548 + p549 = 1
inv : p0 + p518 + p521 + p522 = 1
inv : p0 + p124 + p125 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p14 + p15 = 1
inv : p0 + p468 + p469 = 1
inv : p0 + p214 + p215 + p216 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p478 + p479 = 1
inv : p0 + p164 + p165 = 1
inv : p0 + p157 + p160 + p161 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p94 + p95 = 1
inv : p0 + p136 + p137 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p398 + p399 = 1
inv : p0 + p339 + p340 = 1
inv : p0 + p561 + p562 = 1
inv : p0 + p271 + p274 + p275 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p491 + p492 = 1
inv : p0 + p333 + p334 = 1
inv : p0 + p531 + p532 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p421 + p422 = 1
inv : p0 + p246 + p247 = 1
inv : p0 + p409 + p410 = 1
inv : p0 + p438 + p439 = 1
inv : p0 + p508 + p509 = 1
inv : p0 + p423 + p424 + p425 = 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 + p489 + p490 = 1
inv : p0 + p461 + p462 + p463 = 1
inv : p0 + p419 + p420 = 1
inv : p0 + p504 + p505 = 1
inv : p0 + p248 + p249 = 1
inv : p0 + p98 + p99 = 1
inv : p0 + p554 + p555 = 1
inv : p0 + p88 + p89 = 1
inv : p0 + p318 + p319 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p366 + p367 + p368 = 1
inv : p0 + p238 + p239 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p373 + p374 = 1
inv : p0 + p52 + p53 = 1
inv : p0 + p518 + p519 + p520 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p550 + p551 = 1
inv : p0 + p18 + p19 = 1
inv : p0 + p138 + p141 + p142 = 1
inv : p0 + p204 + p205 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p434 + p435 = 1
inv : p0 + p385 + p388 + p389 = 1
inv : p0 + p134 + p135 = 1
inv : p0 + p364 + p365 = 1
inv : p0 + p24 + p25 + p26 = 1
inv : p0 + p400 + p401 = 1
inv : p0 + p390 + p391 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p43 + p44 + p45 = 1
inv : p0 + p533 + p534 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p202 + p203 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p320 + p321 = 1
inv : p0 + p523 + p524 = 1
inv : p0 + p119 + p120 + p121 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p132 + p133 = 1
inv : p0 + p43 + p46 + p47 = 1
inv : p0 + p535 + p536 = 1
inv : p0 + p284 + p285 = 1
inv : p0 + p383 + p384 = 1
inv : p0 + p537 + p540 + p541 = 1
inv : p0 + p214 + p217 + p218 = 1
inv : p0 + p195 + p196 + p197 = 1
inv : p0 + p569 + p570 = 1
inv : p0 + p453 + p454 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p552 + p553 = 1
inv : p0 + p470 + p471 = 1
inv : p0 + p16 + p17 = 1
inv : p0 + p442 + p443 + p444 = 1
inv : p0 + p354 + p355 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p86 + p87 = 1
Total of 271 invariants.
[2020-05-27 12:39:24] [INFO ] Computed 271 place invariants in 11 ms
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/graph14231206972008675162.txt, -o, /tmp/graph14231206972008675162.bin, -w, /tmp/graph14231206972008675162.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/graph14231206972008675162.bin, -l, -1, -v, -w, /tmp/graph14231206972008675162.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 12:39:24] [INFO ] Decomposing Gal with order
[2020-05-27 12:39:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:39:24] [INFO ] Removed a total of 90 redundant transitions.
[2020-05-27 12:39:24] [INFO ] Flatten gal took : 124 ms
[2020-05-27 12:39:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2020-05-27 12:39:24] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 25 ms
[2020-05-27 12:39:24] [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 15 LTL properties
Checking formula 0 : !((X((G("((i5.i2.u50.p120==1)&&(i5.i3.u53.p129==1))"))||(G("((i7.i1.u58.p138==1)&&(i7.i1.u62.p149==1))")))))
Formula 0 simplified : !X(G"((i5.i2.u50.p120==1)&&(i5.i3.u53.p129==1))" | G"((i7.i1.u58.p138==1)&&(i7.i1.u62.p149==1))")
built 30 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 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 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 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 15 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 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 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 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 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 9 ordering constraints for composite.
built 7 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 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 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 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 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 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 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 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 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 20 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 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
67 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.738036,35100,1,0,36662,318,2492,92986,120,1191,49184
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((F(X(X(F("(i29.i2.u237.p565==1)")))))||(G("((i9.i2.u73.p175==1)&&(i9.i0.u78.p188==1))")))||(X("(i29.i2.u237.p565==1)"))))
Formula 1 simplified : !(FXXF"(i29.i2.u237.p565==1)" | G"((i9.i2.u73.p175==1)&&(i9.i0.u78.p188==1))" | X"(i29.i2.u237.p565==1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.752556,35588,1,0,36662,318,2523,92986,121,1191,51861
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(F(G((F(G(F("(i20.i1.u166.p396==1)"))))&&("(((i10.u76.p184!=1)||(i9.i1.u79.p190!=1))||(i9.i2.u80.p192!=1))"))))))
Formula 2 simplified : FG("(((i10.u76.p184!=1)||(i9.i1.u79.p190!=1))||(i9.i2.u80.p192!=1))" & FGF"(i20.i1.u166.p396==1)")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.767185,35908,1,0,36662,318,2605,92986,122,1191,53546
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(X(F(((X("((i17.i1.u137.p326==1)&&(i17.i1.u144.p343==1))"))U("((i19.i1.u154.p366==1)&&(i19.i1.u158.p377==1))"))&&("(i13.i2.u110.p263==1)"))))))
Formula 3 simplified : !GXF("(i13.i2.u110.p263==1)" & (X"((i17.i1.u137.p326==1)&&(i17.i1.u144.p343==1))" U "((i19.i1.u154.p366==1)&&(i19.i1.u158.p377==1))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
6 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.827135,38908,1,0,45242,318,2710,97375,122,1191,61999
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(F("(((i3.i3.u43.p106==1)&&(i6.i1.u45.p110==1))&&(i6.i2.u48.p116==1))")))||(G(X(F(G(X("((((i5.i1.u49.p117==1)&&(i5.i1.u56.p134==1))&&(i21.i1.u170.p407==1))&&(i21.i2.u175.p418==1))"))))))))
Formula 4 simplified : !(GF"(((i3.i3.u43.p106==1)&&(i6.i1.u45.p110==1))&&(i6.i2.u48.p116==1))" | GXFGX"((((i5.i1.u49.p117==1)&&(i5.i1.u56.p134==1))&&(i21.i1.u170.p407==1))&&(i21.i2.u175.p418==1))")
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.846839,40040,1,0,46854,318,2866,100156,123,1191,63702
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((("(((i23.i2.u180.p431==1)&&(i22.i0.u183.p437==1))&&(i22.i1.u184.p439==1))")U(G(X(X("((i8.i1.u66.p158!=1)||(i8.i3.u69.p167!=1))"))))))
Formula 5 simplified : !("(((i23.i2.u180.p431==1)&&(i22.i0.u183.p437==1))&&(i22.i1.u184.p439==1))" U GXX"((i8.i1.u66.p158!=1)||(i8.i3.u69.p167!=1))")
7 unique states visited
7 strongly connected components in search stack
9 transitions explored
7 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.865498,41248,1,0,48898,318,2915,104063,123,1191,65739
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(X(((F(X((!(F("((i4.u26.p64==1)&&(i4.u26.p66==1))")))||("((i21.i1.u170.p407==1)&&(i21.i2.u175.p418==1))"))))&&("(i21.i1.u170.p407==1)"))&&("(i21.i2.u175.p418==1)")))))
Formula 6 simplified : !FX("(i21.i1.u170.p407==1)" & "(i21.i2.u175.p418==1)" & FX("((i21.i1.u170.p407==1)&&(i21.i2.u175.p418==1))" | !F"((i4.u26.p64==1)&&(i4.u26.p66==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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,1.00548,48104,1,0,64304,318,3041,138974,131,1220,80436
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((G(X((((F((F("(i4.u30.p73!=1)"))||("(i12.i1.u102.p244==1)")))&&("(i4.u30.p73!=1)"))&&("(i10.u82.p195==1)"))&&("(i10.u86.p206==1)"))))U("((i17.i2.u138.p331==1)&&(i17.i0.u143.p342==1))")))
Formula 7 simplified : !(GX("(i4.u30.p73!=1)" & "(i10.u82.p195==1)" & "(i10.u86.p206==1)" & F("(i12.i1.u102.p244==1)" | F"(i4.u30.p73!=1)")) U "((i17.i2.u138.p331==1)&&(i17.i0.u143.p342==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,1.1049,54092,1,0,79113,318,3153,166769,131,1238,94491
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G("((((((((i21.i1.u179.p429!=1)||(i22.i2.u181.p433!=1))||(i22.i1.u184.p439!=1))&&(i18.u140.p335==1))&&(i18.u151.p360==1))||(i21.i1.u179.p429!=1))||(i22.i2.u181.p433!=1))||(i22.i1.u184.p439!=1))"))||(!(F("((i21.i1.u173.p413==1)&&(i21.i1.u179.p428==1))")))))
Formula 8 simplified : !(G"((((((((i21.i1.u179.p429!=1)||(i22.i2.u181.p433!=1))||(i22.i1.u184.p439!=1))&&(i18.u140.p335==1))&&(i18.u151.p360==1))||(i21.i1.u179.p429!=1))||(i22.i2.u181.p433!=1))||(i22.i1.u184.p439!=1))" | !F"((i21.i1.u173.p413==1)&&(i21.i1.u179.p428==1))")
[2020-05-27 12:39:26] [INFO ] Proved 573 variables to be positive in 2378 ms
[2020-05-27 12:39:26] [INFO ] Computing symmetric may disable matrix : 422 transitions.
[2020-05-27 12:39:26] [INFO ] Computation of disable matrix completed :0/422 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 12:39:26] [INFO ] Computation of Complete disable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 12:39:26] [INFO ] Computing symmetric may enable matrix : 422 transitions.
[2020-05-27 12:39:26] [INFO ] Computation of Complete enable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 12:39:39] [INFO ] Computing symmetric co enabling matrix : 422 transitions.
[2020-05-27 12:39:39] [INFO ] Computation of co-enabling matrix(0/422) took 23 ms. Total solver calls (SAT/UNSAT): 4(0/4)
[2020-05-27 12:39:42] [INFO ] Computation of co-enabling matrix(104/422) took 3026 ms. Total solver calls (SAT/UNSAT): 714(74/640)
[2020-05-27 12:39:45] [INFO ] Computation of co-enabling matrix(237/422) took 6037 ms. Total solver calls (SAT/UNSAT): 1054(131/923)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
2025 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,21.3573,662040,1,0,1.19047e+06,318,3243,4.43128e+06,131,1524,497805
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((!(F(((("((i19.i2.u157.p375==1)&&(i19.i2.u163.p390==1))")U("((i3.i2.u34.p83==1)&&(i3.i2.u34.p85==1))"))&&("(i19.i2.u157.p375==1)"))&&("(i19.i2.u163.p390==1)"))))&&(!(G("((i21.i1.u170.p405==1)&&(i21.i1.u173.p414==1))")))))
Formula 9 simplified : !(!F("(i19.i2.u157.p375==1)" & "(i19.i2.u163.p390==1)" & ("((i19.i2.u157.p375==1)&&(i19.i2.u163.p390==1))" U "((i3.i2.u34.p83==1)&&(i3.i2.u34.p85==1))")) & !G"((i21.i1.u170.p405==1)&&(i21.i1.u173.p414==1))")
6 unique states visited
5 strongly connected components in search stack
9 transitions explored
6 items max in DFS search stack
159 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,22.9494,723272,1,0,1.32837e+06,318,3459,4.69768e+06,131,1555,610085
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((G(F("((i2.i3.u12.p31==1)&&(i2.i3.u23.p56==1))")))U((F("((i2.i3.u12.p31==1)&&(i2.i3.u23.p56==1))"))U("((i2.i3.u12.p31==1)&&(i2.i3.u23.p56==1))"))))
Formula 10 simplified : !(GF"((i2.i3.u12.p31==1)&&(i2.i3.u23.p56==1))" U (F"((i2.i3.u12.p31==1)&&(i2.i3.u23.p56==1))" U "((i2.i3.u12.p31==1)&&(i2.i3.u23.p56==1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 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,23.0296,726440,1,0,1.33562e+06,318,3538,4.71175e+06,131,1555,617353
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F("((i21.i0.u169.p402==1)&&(i21.i0.u176.p419==1))"))&&(X(F(X(!(X("(((i4.u32.p77==1)&&(i21.i0.u169.p402==1))&&(i21.i0.u176.p419==1))"))))))))
Formula 11 simplified : !(F"((i21.i0.u169.p402==1)&&(i21.i0.u176.p419==1))" & XFX!X"(((i4.u32.p77==1)&&(i21.i0.u169.p402==1))&&(i21.i0.u176.p419==1))")
3 unique states visited
3 strongly connected components in search stack
3 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,23.0317,726704,1,0,1.3357e+06,318,3560,4.71189e+06,131,1555,617486
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(G(X(G(F("(i21.i0.u174.p415==1)")))))))
Formula 12 simplified : GXGF"(i21.i0.u174.p415==1)"
[2020-05-27 12:39:48] [INFO ] Computation of co-enabling matrix(370/422) took 9058 ms. Total solver calls (SAT/UNSAT): 1225(188/1037)
[2020-05-27 12:39:50] [INFO ] Computation of Finished co-enabling matrix. took 10127 ms. Total solver calls (SAT/UNSAT): 1289(209/1080)
[2020-05-27 12:39:50] [INFO ] Computing Do-Not-Accords matrix : 422 transitions.
[2020-05-27 12:39:50] [INFO ] Computation of Completed DNA matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 12:39:50] [INFO ] Built C files in 26522ms 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]
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
625 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,29.2969,855800,1,0,1.56914e+06,318,3580,5.48828e+06,131,1629,704634
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((!((X(!(X(("(((i14.i2.u123.p296==1)&&(i15.u125.p300==1))&&(i15.u128.p306==1))")U("(i14.i1.u118.p282==1)")))))U("((((i26.i1.u209.p498==1)&&(i26.i1.u214.p511==1))&&(i3.i2.u34.p81==1))&&(i3.i2.u38.p92==1))"))))
Formula 13 simplified : X!X("(((i14.i2.u123.p296==1)&&(i15.u125.p300==1))&&(i15.u128.p306==1))" U "(i14.i1.u118.p282==1)") U "((((i26.i1.u209.p498==1)&&(i26.i1.u214.p511==1))&&(i3.i2.u34.p81==1))&&(i3.i2.u38.p92==1))"
Compilation finished in 4727 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 96 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( (X(!( X(((LTLAP33==true))U((LTLAP34==true)))) ))U((LTLAP35==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(((LTLAP33==true))U((LTLAP34==true)))) ))U((LTLAP35==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(((LTLAP33==true))U((LTLAP34==true)))) ))U((LTLAP35==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)
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
3245 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,61.7438,1598944,1,0,2.77052e+06,318,3712,9.42423e+06,131,1697,1311201
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(X("(i17.i1.u144.p343==1)"))))
Formula 14 simplified : !FX"(i17.i1.u144.p343==1)"
3 unique states visited
3 strongly connected components in search stack
3 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,61.7466,1599208,1,0,2.77068e+06,318,3725,9.42447e+06,131,1697,1311376
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-030A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1590583241645
--------------------
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-030A"
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-030A, 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-159033475500330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A 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 ;