About the Execution of ITS-Tools for ShieldRVt-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.970 | 220830.00 | 310943.00 | 386.40 | FFFTFFFFFFFFFFTF | 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-159033476601066.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 ShieldRVt-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476601066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.1K May 14 03:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 20:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 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:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:55 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 136K 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 ShieldRVt-PT-050A-00
FORMULA_NAME ShieldRVt-PT-050A-01
FORMULA_NAME ShieldRVt-PT-050A-02
FORMULA_NAME ShieldRVt-PT-050A-03
FORMULA_NAME ShieldRVt-PT-050A-04
FORMULA_NAME ShieldRVt-PT-050A-05
FORMULA_NAME ShieldRVt-PT-050A-06
FORMULA_NAME ShieldRVt-PT-050A-07
FORMULA_NAME ShieldRVt-PT-050A-08
FORMULA_NAME ShieldRVt-PT-050A-09
FORMULA_NAME ShieldRVt-PT-050A-10
FORMULA_NAME ShieldRVt-PT-050A-11
FORMULA_NAME ShieldRVt-PT-050A-12
FORMULA_NAME ShieldRVt-PT-050A-13
FORMULA_NAME ShieldRVt-PT-050A-14
FORMULA_NAME ShieldRVt-PT-050A-15
=== Now, execution of the tool begins
BK_START 1590635289252
[2020-05-28 03:08:11] [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-28 03:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-28 03:08:11] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2020-05-28 03:08:11] [INFO ] Transformed 403 places.
[2020-05-28 03:08:11] [INFO ] Transformed 403 transitions.
[2020-05-28 03:08:11] [INFO ] Found NUPN structural information;
[2020-05-28 03:08:11] [INFO ] Parsed PT model containing 403 places and 403 transitions in 177 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 87 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 849 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0]
// Phase 1: matrix 402 rows 403 cols
[2020-05-28 03:08:12] [INFO ] Computed 201 place invariants in 25 ms
[2020-05-28 03:08:13] [INFO ] [Real]Absence check using 201 positive place invariants in 129 ms returned sat
[2020-05-28 03:08:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:13] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2020-05-28 03:08:14] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 36 ms.
[2020-05-28 03:08:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:08:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 193 ms returned sat
[2020-05-28 03:08:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:15] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2020-05-28 03:08:15] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 76 ms.
[2020-05-28 03:08:19] [INFO ] Added : 397 causal constraints over 80 iterations in 4324 ms. Result :sat
[2020-05-28 03:08:19] [INFO ] [Real]Absence check using 201 positive place invariants in 124 ms returned sat
[2020-05-28 03:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:20] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2020-05-28 03:08:20] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 64 ms.
[2020-05-28 03:08:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:08:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 132 ms returned sat
[2020-05-28 03:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:21] [INFO ] [Nat]Absence check using state equation in 1255 ms returned sat
[2020-05-28 03:08:22] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 76 ms.
[2020-05-28 03:08:26] [INFO ] Added : 395 causal constraints over 80 iterations in 4939 ms. Result :sat
[2020-05-28 03:08:27] [INFO ] [Real]Absence check using 201 positive place invariants in 224 ms returned sat
[2020-05-28 03:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:27] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2020-05-28 03:08:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 49 ms.
[2020-05-28 03:08:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:08:28] [INFO ] [Nat]Absence check using 201 positive place invariants in 130 ms returned sat
[2020-05-28 03:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:29] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2020-05-28 03:08:29] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 50 ms.
[2020-05-28 03:08:33] [INFO ] Added : 397 causal constraints over 80 iterations in 3945 ms. Result :sat
[2020-05-28 03:08:33] [INFO ] [Real]Absence check using 201 positive place invariants in 91 ms returned sat
[2020-05-28 03:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:33] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2020-05-28 03:08:33] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 38 ms.
[2020-05-28 03:08:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:08:34] [INFO ] [Nat]Absence check using 201 positive place invariants in 95 ms returned sat
[2020-05-28 03:08:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:34] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2020-05-28 03:08:34] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 33 ms.
[2020-05-28 03:08:38] [INFO ] Added : 399 causal constraints over 81 iterations in 3611 ms. Result :sat
[2020-05-28 03:08:38] [INFO ] [Real]Absence check using 201 positive place invariants in 357 ms returned sat
[2020-05-28 03:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:39] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2020-05-28 03:08:39] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-05-28 03:08:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:08:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 1131 ms returned sat
[2020-05-28 03:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:43] [INFO ] [Nat]Absence check using state equation in 2410 ms returned sat
[2020-05-28 03:08:43] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 37 ms.
[2020-05-28 03:08:47] [INFO ] Added : 399 causal constraints over 80 iterations in 4688 ms. Result :sat
[2020-05-28 03:08:47] [INFO ] [Real]Absence check using 201 positive place invariants in 107 ms returned sat
[2020-05-28 03:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:48] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2020-05-28 03:08:48] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 34 ms.
[2020-05-28 03:08:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:08:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 89 ms returned sat
[2020-05-28 03:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:50] [INFO ] [Nat]Absence check using state equation in 1857 ms returned sat
[2020-05-28 03:08:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-05-28 03:08:54] [INFO ] Added : 397 causal constraints over 80 iterations in 3615 ms. Result :sat
[2020-05-28 03:08:54] [INFO ] [Real]Absence check using 201 positive place invariants in 87 ms returned sat
[2020-05-28 03:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:55] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2020-05-28 03:08:55] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 36 ms.
[2020-05-28 03:08:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:08:55] [INFO ] [Nat]Absence check using 201 positive place invariants in 118 ms returned sat
[2020-05-28 03:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:08:56] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2020-05-28 03:08:56] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 58 ms.
[2020-05-28 03:09:00] [INFO ] Added : 397 causal constraints over 80 iterations in 4237 ms. Result :sat
[2020-05-28 03:09:00] [INFO ] [Real]Absence check using 201 positive place invariants in 65 ms returned sat
[2020-05-28 03:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:01] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2020-05-28 03:09:01] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-05-28 03:09:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 149 ms returned sat
[2020-05-28 03:09:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:01] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2020-05-28 03:09:02] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:09:05] [INFO ] Added : 397 causal constraints over 80 iterations in 3620 ms. Result :sat
[2020-05-28 03:09:06] [INFO ] [Real]Absence check using 201 positive place invariants in 601 ms returned sat
[2020-05-28 03:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:06] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2020-05-28 03:09:06] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 24 ms.
[2020-05-28 03:09:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 148 ms returned sat
[2020-05-28 03:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:08] [INFO ] [Nat]Absence check using state equation in 902 ms returned sat
[2020-05-28 03:09:08] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 38 ms.
[2020-05-28 03:09:11] [INFO ] Added : 397 causal constraints over 80 iterations in 3761 ms. Result :sat
[2020-05-28 03:09:12] [INFO ] [Real]Absence check using 201 positive place invariants in 148 ms returned sat
[2020-05-28 03:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:12] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2020-05-28 03:09:12] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 42 ms.
[2020-05-28 03:09:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:13] [INFO ] [Nat]Absence check using 201 positive place invariants in 284 ms returned sat
[2020-05-28 03:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:15] [INFO ] [Nat]Absence check using state equation in 1863 ms returned sat
[2020-05-28 03:09:15] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 38 ms.
[2020-05-28 03:09:18] [INFO ] Added : 400 causal constraints over 81 iterations in 3529 ms. Result :sat
[2020-05-28 03:09:19] [INFO ] [Real]Absence check using 201 positive place invariants in 342 ms returned sat
[2020-05-28 03:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:20] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2020-05-28 03:09:20] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 42 ms.
[2020-05-28 03:09:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 161 ms returned sat
[2020-05-28 03:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:21] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2020-05-28 03:09:21] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 31 ms.
[2020-05-28 03:09:26] [INFO ] Added : 400 causal constraints over 81 iterations in 5553 ms. Result :sat
[2020-05-28 03:09:27] [INFO ] [Real]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-05-28 03:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:27] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2020-05-28 03:09:27] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 41 ms.
[2020-05-28 03:09:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:28] [INFO ] [Nat]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-05-28 03:09:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:28] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2020-05-28 03:09:28] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 33 ms.
[2020-05-28 03:09:31] [INFO ] Added : 396 causal constraints over 80 iterations in 2901 ms. Result :sat
[2020-05-28 03:09:31] [INFO ] [Real]Absence check using 201 positive place invariants in 295 ms returned sat
[2020-05-28 03:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:32] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2020-05-28 03:09:32] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-05-28 03:09:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-05-28 03:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:33] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-05-28 03:09:33] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:09:36] [INFO ] Added : 395 causal constraints over 79 iterations in 3555 ms. Result :sat
[2020-05-28 03:09:37] [INFO ] [Real]Absence check using 201 positive place invariants in 301 ms returned sat
[2020-05-28 03:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:38] [INFO ] [Real]Absence check using state equation in 858 ms returned sat
[2020-05-28 03:09:38] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:09:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:38] [INFO ] [Nat]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-05-28 03:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:38] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2020-05-28 03:09:39] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 41 ms.
[2020-05-28 03:09:43] [INFO ] Added : 396 causal constraints over 80 iterations in 4111 ms. Result :sat
[2020-05-28 03:09:43] [INFO ] [Real]Absence check using 201 positive place invariants in 148 ms returned sat
[2020-05-28 03:09:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:44] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2020-05-28 03:09:44] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2020-05-28 03:09:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 86 ms returned sat
[2020-05-28 03:09:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:45] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2020-05-28 03:09:45] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 24 ms.
[2020-05-28 03:09:47] [INFO ] Added : 395 causal constraints over 80 iterations in 2826 ms. Result :sat
[2020-05-28 03:09:48] [INFO ] [Real]Absence check using 201 positive place invariants in 87 ms returned sat
[2020-05-28 03:09:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:48] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2020-05-28 03:09:48] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 28 ms.
[2020-05-28 03:09:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-05-28 03:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:49] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2020-05-28 03:09:49] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-05-28 03:09:52] [INFO ] Added : 399 causal constraints over 81 iterations in 2994 ms. Result :sat
[2020-05-28 03:09:52] [INFO ] [Real]Absence check using 201 positive place invariants in 151 ms returned sat
[2020-05-28 03:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:53] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2020-05-28 03:09:53] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 23 ms.
[2020-05-28 03:09:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:09:53] [INFO ] [Nat]Absence check using 201 positive place invariants in 106 ms returned sat
[2020-05-28 03:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:54] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2020-05-28 03:09:54] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 32 ms.
[2020-05-28 03:09:58] [INFO ] Added : 395 causal constraints over 80 iterations in 4327 ms. Result :sat
[2020-05-28 03:09:59] [INFO ] [Real]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-05-28 03:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:09:59] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2020-05-28 03:09:59] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:09:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 855 ms returned sat
[2020-05-28 03:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:01] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2020-05-28 03:10:01] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2020-05-28 03:10:05] [INFO ] Added : 393 causal constraints over 79 iterations in 4025 ms. Result :sat
[2020-05-28 03:10:05] [INFO ] [Real]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-05-28 03:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:06] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2020-05-28 03:10:06] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 30 ms.
[2020-05-28 03:10:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 159 ms returned sat
[2020-05-28 03:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:07] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2020-05-28 03:10:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:10:10] [INFO ] Added : 397 causal constraints over 80 iterations in 3376 ms. Result :sat
[2020-05-28 03:10:11] [INFO ] [Real]Absence check using 201 positive place invariants in 90 ms returned sat
[2020-05-28 03:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:12] [INFO ] [Real]Absence check using state equation in 1823 ms returned sat
[2020-05-28 03:10:13] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 43 ms.
[2020-05-28 03:10:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:13] [INFO ] [Nat]Absence check using 201 positive place invariants in 97 ms returned sat
[2020-05-28 03:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:14] [INFO ] [Nat]Absence check using state equation in 1045 ms returned sat
[2020-05-28 03:10:14] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:10:18] [INFO ] Added : 398 causal constraints over 81 iterations in 4473 ms. Result :sat
[2020-05-28 03:10:19] [INFO ] [Real]Absence check using 201 positive place invariants in 151 ms returned sat
[2020-05-28 03:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:20] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2020-05-28 03:10:20] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 33 ms.
[2020-05-28 03:10:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-05-28 03:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:20] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2020-05-28 03:10:20] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 25 ms.
[2020-05-28 03:10:24] [INFO ] Added : 396 causal constraints over 80 iterations in 3448 ms. Result :sat
[2020-05-28 03:10:24] [INFO ] [Real]Absence check using 201 positive place invariants in 86 ms returned sat
[2020-05-28 03:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:25] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2020-05-28 03:10:25] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 27 ms.
[2020-05-28 03:10:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 87 ms returned sat
[2020-05-28 03:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:26] [INFO ] [Nat]Absence check using state equation in 976 ms returned sat
[2020-05-28 03:10:26] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-05-28 03:10:29] [INFO ] Added : 396 causal constraints over 80 iterations in 3248 ms. Result :sat
[2020-05-28 03:10:30] [INFO ] [Real]Absence check using 201 positive place invariants in 87 ms returned sat
[2020-05-28 03:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:30] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2020-05-28 03:10:30] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 36 ms.
[2020-05-28 03:10:31] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:31] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-05-28 03:10:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:31] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2020-05-28 03:10:31] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 44 ms.
[2020-05-28 03:10:36] [INFO ] Added : 396 causal constraints over 80 iterations in 4541 ms. Result :sat
[2020-05-28 03:10:36] [INFO ] [Real]Absence check using 201 positive place invariants in 100 ms returned sat
[2020-05-28 03:10:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:37] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2020-05-28 03:10:37] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 33 ms.
[2020-05-28 03:10:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:37] [INFO ] [Nat]Absence check using 201 positive place invariants in 110 ms returned sat
[2020-05-28 03:10:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:38] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2020-05-28 03:10:38] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:10:41] [INFO ] Added : 398 causal constraints over 80 iterations in 3171 ms. Result :sat
[2020-05-28 03:10:41] [INFO ] [Real]Absence check using 201 positive place invariants in 94 ms returned sat
[2020-05-28 03:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:41] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2020-05-28 03:10:42] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 22 ms.
[2020-05-28 03:10:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:42] [INFO ] [Nat]Absence check using 201 positive place invariants in 96 ms returned sat
[2020-05-28 03:10:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:42] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2020-05-28 03:10:42] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 61 ms.
[2020-05-28 03:10:46] [INFO ] Added : 389 causal constraints over 79 iterations in 3568 ms. Result :sat
[2020-05-28 03:10:46] [INFO ] [Real]Absence check using 201 positive place invariants in 58 ms returned sat
[2020-05-28 03:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:47] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2020-05-28 03:10:47] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 26 ms.
[2020-05-28 03:10:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:47] [INFO ] [Nat]Absence check using 201 positive place invariants in 63 ms returned sat
[2020-05-28 03:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:49] [INFO ] [Nat]Absence check using state equation in 2411 ms returned sat
[2020-05-28 03:10:50] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-05-28 03:10:54] [INFO ] Added : 398 causal constraints over 81 iterations in 4488 ms. Result :sat
[2020-05-28 03:10:55] [INFO ] [Real]Absence check using 201 positive place invariants in 1305 ms returned sat
[2020-05-28 03:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:56] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2020-05-28 03:10:56] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-05-28 03:10:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:10:57] [INFO ] [Nat]Absence check using 201 positive place invariants in 447 ms returned sat
[2020-05-28 03:10:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:10:57] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2020-05-28 03:10:57] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 50 ms.
[2020-05-28 03:11:01] [INFO ] Added : 397 causal constraints over 80 iterations in 3562 ms. Result :sat
[2020-05-28 03:11:01] [INFO ] [Real]Absence check using 201 positive place invariants in 129 ms returned sat
[2020-05-28 03:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:11:01] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2020-05-28 03:11:02] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 38 ms.
[2020-05-28 03:11:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:11:02] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-05-28 03:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:11:02] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2020-05-28 03:11:02] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 42 ms.
[2020-05-28 03:11:05] [INFO ] Added : 397 causal constraints over 80 iterations in 3010 ms. Result :sat
[2020-05-28 03:11:06] [INFO ] [Real]Absence check using 201 positive place invariants in 209 ms returned sat
[2020-05-28 03:11:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-28 03:11:06] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2020-05-28 03:11:06] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 29 ms.
[2020-05-28 03:11:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-28 03:11:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-05-28 03:11:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-28 03:11:07] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2020-05-28 03:11:07] [INFO ] Computed and/alt/rep : 401/1749/401 causal constraints in 35 ms.
[2020-05-28 03:11:10] [INFO ] Added : 398 causal constraints over 81 iterations in 3009 ms. Result :sat
[2020-05-28 03:11:11] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-28 03:11:11] [INFO ] Flatten gal took : 119 ms
FORMULA ShieldRVt-PT-050A-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-28 03:11:11] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-28 03:11:11] [INFO ] Applying decomposition
[2020-05-28 03:11:11] [INFO ] Flatten gal took : 51 ms
[2020-05-28 03:11:11] [INFO ] Input system was already deterministic with 402 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/graph17957650382006097430.txt, -o, /tmp/graph17957650382006097430.bin, -w, /tmp/graph17957650382006097430.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/graph17957650382006097430.bin, -l, -1, -v, -w, /tmp/graph17957650382006097430.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-28 03:11:11] [INFO ] Decomposing Gal with order
[2020-05-28 03:11:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-28 03:11:12] [INFO ] Removed a total of 150 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 402 rows 403 cols
[2020-05-28 03:11:12] [INFO ] Computed 201 place invariants in 8 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p331 + p332 = 1
inv : p0 + p321 + p322 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p341 + p342 = 1
inv : p0 + p351 + p352 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p311 + p312 = 1
inv : p0 + p291 + p292 = 1
inv : p0 + p95 + p96 = 1
inv : p0 + p85 + p86 = 1
inv : p0 + p381 + p382 = 1
inv : p0 + p371 + p372 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p261 + p262 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p135 + p136 = 1
inv : p0 + p401 + p402 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p251 + p252 = 1
inv : p0 + p231 + p232 = 1
inv : p0 + p65 + p66 = 1
inv : p0 + p391 + p392 = 1
inv : p0 + p75 + p76 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p241 + p242 = 1
inv : p0 + p215 + p216 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p131 + p132 = 1
inv : p0 + p195 + p196 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p111 + p112 = 1
inv : p0 + p387 + p388 = 1
inv : p0 + p285 + p286 = 1
inv : p0 + p245 + p246 = 1
inv : p0 + p221 + p222 = 1
inv : p0 + p125 + p126 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p61 + p62 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p105 + p106 = 1
inv : p0 + p367 + p368 = 1
inv : p0 + p335 + p336 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p271 + p272 = 1
inv : p0 + p265 + p266 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p361 + p362 = 1
inv : p0 + p201 + p202 = 1
inv : p0 + p119 + p120 = 1
inv : p0 + p89 + p90 = 1
inv : p0 + p385 + p386 = 1
inv : p0 + p287 + p288 = 1
inv : p0 + p247 + p248 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p317 + p318 = 1
inv : p0 + p189 + p190 = 1
inv : p0 + p199 + p200 = 1
inv : p0 + p315 + p316 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p71 + p72 = 1
inv : p0 + p187 + p188 = 1
inv : p0 + p327 + p328 = 1
inv : p0 + p59 + p60 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p107 + p108 = 1
inv : p0 + p375 + p376 = 1
inv : p0 + p129 + p130 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p257 + p258 = 1
inv : p0 + p141 + p142 = 1
inv : p0 + p363 + p364 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p77 + p78 = 1
inv : p0 + p171 + p172 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p235 + p236 = 1
inv : p0 + p339 + p340 = 1
inv : p0 + p165 + p166 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p101 + p102 = 1
inv : p0 + p397 + p398 = 1
inv : p0 + p293 + p294 = 1
inv : p0 + p269 + p270 = 1
inv : p0 + p333 + p334 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p205 + p206 = 1
inv : p0 + p229 + p230 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p357 + p358 = 1
inv : p0 + p83 + p84 = 1
inv : p0 + p211 + p212 = 1
inv : p0 + p147 + p148 = 1
inv : p0 + p275 + p276 = 1
inv : p0 + p281 + p282 = 1
inv : p0 + p345 + p346 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p217 + p218 = 1
inv : p0 + p183 + p184 = 1
inv : p0 + p173 + p174 = 1
inv : p0 + p203 + p204 = 1
inv : p0 + p163 + p164 = 1
inv : p0 + p223 + p224 = 1
inv : p0 + p133 + p134 = 1
inv : p0 + p143 + p144 = 1
inv : p0 + p213 + p214 = 1
inv : p0 + p253 + p254 = 1
inv : p0 + p273 + p274 = 1
inv : p0 + p369 + p370 = 1
inv : p0 + p103 + p104 = 1
inv : p0 + p379 + p380 = 1
inv : p0 + p359 + p360 = 1
inv : p0 + p283 + p284 = 1
inv : p0 + p263 + p264 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p123 + p124 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p113 + p114 = 1
inv : p0 + p193 + p194 = 1
inv : p0 + p67 + p68 = 1
inv : p0 + p289 + p290 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p353 + p354 = 1
inv : p0 + p87 + p88 = 1
inv : p0 + p373 + p374 = 1
inv : p0 + p343 + p344 = 1
inv : p0 + p279 + p280 = 1
inv : p0 + p259 + p260 = 1
inv : p0 + p117 + p118 = 1
inv : p0 + p323 + p324 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p349 + p350 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p309 + p310 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p93 + p94 = 1
inv : p0 + p399 + p400 = 1
inv : p0 + p73 + p74 = 1
inv : p0 + p303 + p304 = 1
inv : p0 + p239 + p240 = 1
inv : p0 + p329 + p330 = 1
inv : p0 + p393 + p394 = 1
inv : p0 + p137 + p138 = 1
inv : p0 + p169 + p170 = 1
inv : p0 + p233 + p234 = 1
inv : p0 + p109 + p110 = 1
inv : p0 + p99 + p100 = 1
inv : p0 + p395 + p396 = 1
inv : p0 + p267 + p268 = 1
inv : p0 + p227 + p228 = 1
inv : p0 + p207 + p208 = 1
inv : p0 + p355 + p356 = 1
inv : p0 + p307 + p308 = 1
inv : p0 + p149 + p150 = 1
inv : p0 + p69 + p70 = 1
inv : p0 + p365 + p366 = 1
inv : p0 + p79 + p80 = 1
inv : p0 + p277 + p278 = 1
inv : p0 + p39 + p40 = 1
inv : p0 + p325 + p326 = 1
inv : p0 + p197 + p198 = 1
inv : p0 + p237 + p238 = 1
inv : p0 + p347 + p348 = 1
inv : p0 + p167 + p168 = 1
inv : p0 + p337 + p338 = 1
inv : p0 + p219 + p220 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p295 + p296 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p139 + p140 = 1
inv : p0 + p91 + p92 = 1
inv : p0 + p97 + p98 = 1
inv : p0 + p81 + p82 = 1
inv : p0 + p209 + p210 = 1
inv : p0 + p225 + p226 = 1
inv : p0 + p57 + p58 = 1
inv : p0 + p383 + p384 = 1
inv : p0 + p319 + p320 = 1
inv : p0 + p255 + p256 = 1
inv : p0 + p191 + p192 = 1
inv : p0 + p127 + p128 = 1
inv : p0 + p63 + p64 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p115 + p116 = 1
inv : p0 + p389 + p390 = 1
inv : p0 + p179 + p180 = 1
inv : p0 + p243 + p244 = 1
inv : p0 + p313 + p314 = 1
inv : p0 + p377 + p378 = 1
inv : p0 + p121 + p122 = 1
inv : p0 + p185 + p186 = 1
inv : p0 + p249 + p250 = 1
Total of 201 invariants.
[2020-05-28 03:11:12] [INFO ] Computed 201 place invariants in 19 ms
[2020-05-28 03:11:12] [INFO ] Flatten gal took : 134 ms
[2020-05-28 03:11:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2020-05-28 03:11:12] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
[2020-05-28 03:11:12] [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 14 LTL properties
Checking formula 0 : !((!((F("((((((i17.i0.u153.p307==1)&&(i17.i1.u157.p316==1))&&(i17.i1.u160.p322==1))&&(i9.i0.u87.p176==1))&&(i9.i0.u88.p178==1))&&(i9.i1.u91.p183==1))"))U(F("(((i9.i0.u87.p176==1)&&(i9.i0.u88.p178==1))&&(i9.i1.u91.p183==1))")))))
Formula 0 simplified : F"((((((i17.i0.u153.p307==1)&&(i17.i1.u157.p316==1))&&(i17.i1.u160.p322==1))&&(i9.i0.u87.p176==1))&&(i9.i0.u88.p178==1))&&(i9.i1.u91.p183==1))" U F"(((i9.i0.u87.p176==1)&&(i9.i0.u88.p178==1))&&(i9.i1.u91.p183==1))"
built 22 ordering constraints for composite.
built 13 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 15 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 20 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
13 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.270474,21516,1,0,4544,102,1505,7028,64,158,10834
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((((G("(((i6.i1.u61.p124!=1)||(i6.i1.u62.p125!=1))||(i6.i1.u63.p128!=1))"))&&(X("(i11.i1.u108.p217==1)")))&&(!(X("(((i12.i1.u117.p235==1)&&(i13.i0.u121.p244==1))&&(i13.i0.u124.p250==1))"))))&&(F("(((i12.i1.u117.p235==1)&&(i13.i0.u121.p244==1))&&(i13.i0.u124.p250==1))"))))
Formula 1 simplified : !(G"(((i6.i1.u61.p124!=1)||(i6.i1.u62.p125!=1))||(i6.i1.u63.p128!=1))" & X"(i11.i1.u108.p217==1)" & !X"(((i12.i1.u117.p235==1)&&(i13.i0.u121.p244==1))&&(i13.i0.u124.p250==1))" & F"(((i12.i1.u117.p235==1)&&(i13.i0.u121.p244==1))&&(i13.i0.u124.p250==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
12 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.397993,25656,1,0,14233,102,1600,31249,66,158,20743
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G(F((G((G(F("(((i11.i0.u101.p204==1)&&(i11.i0.u102.p205==1))&&(i11.i0.u103.p208==1))")))&&("(i13.i0.u122.p245==1)")))&&(G(!(F("(((i2.i1.u21.p44==1)&&(i2.i1.u22.p45==1))&&(i2.i1.u23.p48==1))")))))))))
Formula 2 simplified : GF(G("(i13.i0.u122.p245==1)" & GF"(((i11.i0.u101.p204==1)&&(i11.i0.u102.p205==1))&&(i11.i0.u103.p208==1))") & G!F"(((i2.i1.u21.p44==1)&&(i2.i1.u22.p45==1))&&(i2.i1.u23.p48==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
29 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.68863,36844,1,0,39813,102,1714,91040,66,158,43100
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(X((((((((F(G("(((i4.i2.u45.p92==1)&&(i4.i2.u46.p93==1))&&(i4.i2.u47.p96==1))")))||("(((i14.i1.u135.p272==1)&&(i14.i1.u136.p274==1))&&(i15.i0.u139.p279==1))"))&&("(i4.i1.u43.p88==1)"))&&("(i4.i1.u44.p90==1)"))&&("(i4.i2.u47.p95==1)"))&&("(i2.i1.u21.p44==1)"))&&("(i2.i1.u22.p45==1)"))&&("(i2.i1.u23.p48==1)")))))
Formula 3 simplified : X("(i2.i1.u21.p44==1)" & "(i2.i1.u22.p45==1)" & "(i2.i1.u23.p48==1)" & "(i4.i1.u43.p88==1)" & "(i4.i1.u44.p90==1)" & "(i4.i2.u47.p95==1)" & ("(((i14.i1.u135.p272==1)&&(i14.i1.u136.p274==1))&&(i15.i0.u139.p279==1))" | FG"(((i4.i2.u45.p92==1)&&(i4.i2.u46.p93==1))&&(i4.i2.u47.p96==1))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.697684,37540,1,0,39813,102,1813,91040,68,158,43163
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-050A-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G(!(G((("(((i8.i1.u79.p160==1)&&(i8.i1.u80.p162==1))&&(i8.i1.u83.p167==1))")U(F("(((i8.i1.u79.p160==1)&&(i8.i1.u80.p162==1))&&(i8.i1.u83.p167==1))")))U("(((i12.i1.u117.p235==1)&&(i13.i0.u121.p244==1))&&(i13.i0.u124.p250==1))")))))||(G("(((i8.i1.u79.p160==1)&&(i8.i1.u80.p162==1))&&(i8.i1.u83.p167==1))"))))
Formula 4 simplified : !(G!G(("(((i8.i1.u79.p160==1)&&(i8.i1.u80.p162==1))&&(i8.i1.u83.p167==1))" U F"(((i8.i1.u79.p160==1)&&(i8.i1.u80.p162==1))&&(i8.i1.u83.p167==1))") U "(((i12.i1.u117.p235==1)&&(i13.i0.u121.p244==1))&&(i13.i0.u124.p250==1))") | G"(((i8.i1.u79.p160==1)&&(i8.i1.u80.p162==1))&&(i8.i1.u83.p167==1))")
5 unique states visited
4 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
45 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.15056,48360,1,0,62817,102,1912,163526,68,158,60478
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(!(G(X(F("((i6.i1.u62.p126==1)&&(i6.i1.u64.p129==1))"))))))))
Formula 5 simplified : !XG!GXF"((i6.i1.u62.p126==1)&&(i6.i1.u64.p129==1))"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
15 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.30042,52584,1,0,73848,102,1941,185038,68,158,71235
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((((!(("((i16.i1.u150.p302!=1)||(i16.i1.u152.p305!=1))")U("(((i16.i1.u150.p302==1)&&(i16.i1.u152.p305==1))||(i6.i0.u59.p119==1))")))&&("(i3.i1.u34.p70==1)"))&&("(i3.i1.u36.p73==1)"))&&("(i6.i0.u59.p119!=1)"))))
Formula 6 simplified : !F("(i3.i1.u34.p70==1)" & "(i3.i1.u36.p73==1)" & "(i6.i0.u59.p119!=1)" & !("((i16.i1.u150.p302!=1)||(i16.i1.u152.p305!=1))" U "(((i16.i1.u150.p302==1)&&(i16.i1.u152.p305==1))||(i6.i0.u59.p119==1))"))
[2020-05-28 03:11:14] [INFO ] Proved 403 variables to be positive in 2349 ms
[2020-05-28 03:11:14] [INFO ] Computing symmetric may disable matrix : 402 transitions.
[2020-05-28 03:11:14] [INFO ] Computation of disable matrix completed :0/402 took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:11:14] [INFO ] Computation of Complete disable matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:11:14] [INFO ] Computing symmetric may enable matrix : 402 transitions.
[2020-05-28 03:11:14] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:11:22] [INFO ] Computing symmetric co enabling matrix : 402 transitions.
[2020-05-28 03:11:23] [INFO ] Computation of co-enabling matrix(0/402) took 377 ms. Total solver calls (SAT/UNSAT): 401(0/401)
[2020-05-28 03:11:26] [INFO ] Computation of co-enabling matrix(102/402) took 3411 ms. Total solver calls (SAT/UNSAT): 681(102/579)
[2020-05-28 03:11:29] [INFO ] Computation of co-enabling matrix(149/402) took 6476 ms. Total solver calls (SAT/UNSAT): 811(149/662)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1567 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,16.9827,308664,1,0,443865,102,2066,1.70458e+06,68,158,203432
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((F(X(X("(i8.i1.u80.p161==1)"))))&&(X(X(!(("((((i16.i0.u147.p296==1)&&(i16.i0.u148.p298==1))&&(i16.i1.u151.p303==1))||(i18.i1.u166.p333==1))")U("(((i16.i0.u147.p296!=1)||(i16.i0.u148.p298!=1))||(i16.i1.u151.p303!=1))"))))))))
Formula 7 simplified : !X(FXX"(i8.i1.u80.p161==1)" & XX!("((((i16.i0.u147.p296==1)&&(i16.i0.u148.p298==1))&&(i16.i1.u151.p303==1))||(i18.i1.u166.p333==1))" U "(((i16.i0.u147.p296!=1)||(i16.i0.u148.p298!=1))||(i16.i1.u151.p303!=1))"))
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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,16.986,308928,1,0,443882,102,2108,1.7046e+06,68,158,203555
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((!(F(X((F("(i10.i1.u98.p197==1)"))||("(i21.i1.u197.p395!=1)"))))))
Formula 8 simplified : FX("(i21.i1.u197.p395!=1)" | F"(i10.i1.u98.p197==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,16.9873,308928,1,0,443882,102,2135,1.7046e+06,68,158,203598
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X(F((("(i11.i0.u102.p205==1)")U(X(!((G("(i7.i1.u69.p139==1)"))U(X("(i11.i0.u102.p205==1)"))))))U("(i17.i1.u158.p317==1)")))))
Formula 9 simplified : !XF(("(i11.i0.u102.p205==1)" U X!(G"(i7.i1.u69.p139==1)" U X"(i11.i0.u102.p205==1)")) U "(i17.i1.u158.p317==1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 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,17.0487,310248,1,0,447926,102,2160,1.71197e+06,68,158,206864
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X(F(((F("(i9.i1.u90.p181==1)"))U("(((i13.i1.u125.p251==1)&&(i14.i0.u129.p260==1))&&(i14.i0.u132.p266==1))"))||(G(X("(((i8.i1.u78.p158==1)&&(i8.i1.u80.p161==1))&&(i9.i1.u90.p181==1))"))))))))
Formula 10 simplified : !FXF((F"(i9.i1.u90.p181==1)" U "(((i13.i1.u125.p251==1)&&(i14.i0.u129.p260==1))&&(i14.i0.u132.p266==1))") | GX"(((i8.i1.u78.p158==1)&&(i8.i1.u80.p161==1))&&(i9.i1.u90.p181==1))")
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
121 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,18.2665,330840,1,0,481859,102,2242,1.83548e+06,68,158,226672
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F("(((i20.i2.u189.p380==1)&&(i20.i2.u190.p381==1))&&(i20.i2.u191.p384==1))"))U((G(F("(((i2.i1.u21.p44==1)&&(i2.i1.u22.p45==1))&&(i2.i1.u23.p48==1))")))||(X("(i19.i1.u174.p349==1)")))))
Formula 11 simplified : !(F"(((i20.i2.u189.p380==1)&&(i20.i2.u190.p381==1))&&(i20.i2.u191.p384==1))" U (GF"(((i2.i1.u21.p44==1)&&(i2.i1.u22.p45==1))&&(i2.i1.u23.p48==1))" | X"(i19.i1.u174.p349==1)"))
[2020-05-28 03:11:32] [INFO ] Computation of co-enabling matrix(298/402) took 9489 ms. Total solver calls (SAT/UNSAT): 1390(346/1044)
[2020-05-28 03:11:33] [INFO ] Computation of Finished co-enabling matrix. took 10587 ms. Total solver calls (SAT/UNSAT): 1449(349/1100)
[2020-05-28 03:11:33] [INFO ] Computing Do-Not-Accords matrix : 402 transitions.
[2020-05-28 03:11:33] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-28 03:11:33] [INFO ] Built C files in 22266ms 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 4484 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 106 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAP34==true)))U(( [](<>((LTLAP7==true)))) || ( X((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, (<>((LTLAP34==true)))U(( [](<>((LTLAP7==true)))) || ( X((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, (<>((LTLAP34==true)))U(( [](<>((LTLAP7==true)))) || ( X((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)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1206 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,30.3283,549432,1,0,804886,102,2315,2.9749e+06,68,158,329028
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(((!(("(i12.i1.u119.p239==1)")U((F("(i2.i1.u22.p45==1)"))&&("(i2.i1.u22.p45==1)"))))U((("(i8.i1.u78.p157==1)")U("(i2.i1.u22.p45==1)"))||(X("(i8.i1.u78.p157!=1)")))))
Formula 12 simplified : !(!("(i12.i1.u119.p239==1)" U ("(i2.i1.u22.p45==1)" & F"(i2.i1.u22.p45==1)")) U (("(i8.i1.u78.p157==1)" U "(i2.i1.u22.p45==1)") | X"(i8.i1.u78.p157!=1)"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,30.3323,549696,1,0,804886,102,2359,2.9749e+06,70,158,329120
no accepting run found
Formula 12 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-050A-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F((X((X("(i15.i0.u140.p281==1)"))U((F("(i20.i0.u184.p369==1)"))&&("(i15.i0.u140.p281==1)"))))||("(i2.i1.u21.p43==1)"))))
Formula 13 simplified : !F("(i2.i1.u21.p43==1)" | X(X"(i15.i0.u140.p281==1)" U ("(i15.i0.u140.p281==1)" & F"(i20.i0.u184.p369==1)")))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
160 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,31.9288,576888,1,0,862130,102,2417,3.09401e+06,70,158,366242
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA ShieldRVt-PT-050A-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
BK_STOP 1590635510082
--------------------
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="ShieldRVt-PT-050A"
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 ShieldRVt-PT-050A, 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-159033476601066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050A.tgz
mv ShieldRVt-PT-050A 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 ;