fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033478301034
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldRVt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.500 3600000.00 86236.00 302.60 FFFFFFFFFFFTFFFT 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.r211-tajo-159033478301034.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 itslola
Input is ShieldRVt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478301034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 4.2K May 14 02:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 02:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 20:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 20:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.2K May 13 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 82K 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-030A-00
FORMULA_NAME ShieldRVt-PT-030A-01
FORMULA_NAME ShieldRVt-PT-030A-02
FORMULA_NAME ShieldRVt-PT-030A-03
FORMULA_NAME ShieldRVt-PT-030A-04
FORMULA_NAME ShieldRVt-PT-030A-05
FORMULA_NAME ShieldRVt-PT-030A-06
FORMULA_NAME ShieldRVt-PT-030A-07
FORMULA_NAME ShieldRVt-PT-030A-08
FORMULA_NAME ShieldRVt-PT-030A-09
FORMULA_NAME ShieldRVt-PT-030A-10
FORMULA_NAME ShieldRVt-PT-030A-11
FORMULA_NAME ShieldRVt-PT-030A-12
FORMULA_NAME ShieldRVt-PT-030A-13
FORMULA_NAME ShieldRVt-PT-030A-14
FORMULA_NAME ShieldRVt-PT-030A-15

=== Now, execution of the tool begins

BK_START 1591338722894

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 06:32:04] [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, -timeout, 3600, -rebuildPNML]
[2020-06-05 06:32:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 06:32:04] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2020-06-05 06:32:04] [INFO ] Transformed 243 places.
[2020-06-05 06:32:04] [INFO ] Transformed 243 transitions.
[2020-06-05 06:32:04] [INFO ] Found NUPN structural information;
[2020-06-05 06:32:04] [INFO ] Parsed PT model containing 243 places and 243 transitions in 102 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 395 ms. (steps per millisecond=253 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1]
// Phase 1: matrix 242 rows 243 cols
[2020-06-05 06:32:05] [INFO ] Computed 121 place invariants in 8 ms
[2020-06-05 06:32:05] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:05] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2020-06-05 06:32:05] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 51 ms.
[2020-06-05 06:32:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2020-06-05 06:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:05] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-06-05 06:32:05] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:07] [INFO ] Added : 239 causal constraints over 48 iterations in 1093 ms. Result :sat
[2020-06-05 06:32:07] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2020-06-05 06:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:07] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-05 06:32:07] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 22 ms.
[2020-06-05 06:32:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:07] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2020-06-05 06:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:07] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-05 06:32:07] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 19 ms.
[2020-06-05 06:32:08] [INFO ] Added : 236 causal constraints over 48 iterations in 1189 ms. Result :sat
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:09] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-05 06:32:09] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 22 ms.
[2020-06-05 06:32:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 44 ms returned sat
[2020-06-05 06:32:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:09] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2020-06-05 06:32:09] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:10] [INFO ] Added : 239 causal constraints over 49 iterations in 1105 ms. Result :sat
[2020-06-05 06:32:10] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2020-06-05 06:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:11] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2020-06-05 06:32:11] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-06-05 06:32:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2020-06-05 06:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:11] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2020-06-05 06:32:11] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 15 ms.
[2020-06-05 06:32:12] [INFO ] Added : 238 causal constraints over 48 iterations in 869 ms. Result :sat
[2020-06-05 06:32:12] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2020-06-05 06:32:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:12] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-05 06:32:12] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 18 ms.
[2020-06-05 06:32:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:12] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2020-06-05 06:32:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:12] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2020-06-05 06:32:13] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 20 ms.
[2020-06-05 06:32:13] [INFO ] Added : 239 causal constraints over 49 iterations in 877 ms. Result :sat
[2020-06-05 06:32:14] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2020-06-05 06:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:14] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2020-06-05 06:32:14] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2020-06-05 06:32:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:14] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2020-06-05 06:32:14] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:15] [INFO ] Added : 240 causal constraints over 49 iterations in 1335 ms. Result :sat
[2020-06-05 06:32:16] [INFO ] [Real]Absence check using 121 positive place invariants in 43 ms returned sat
[2020-06-05 06:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:16] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-05 06:32:16] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 40 ms returned sat
[2020-06-05 06:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:16] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2020-06-05 06:32:16] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:17] [INFO ] Added : 235 causal constraints over 47 iterations in 988 ms. Result :sat
[2020-06-05 06:32:17] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2020-06-05 06:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:17] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-05 06:32:17] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2020-06-05 06:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:18] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2020-06-05 06:32:18] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:18] [INFO ] Added : 238 causal constraints over 48 iterations in 823 ms. Result :sat
[2020-06-05 06:32:19] [INFO ] [Real]Absence check using 121 positive place invariants in 45 ms returned sat
[2020-06-05 06:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:19] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-06-05 06:32:19] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 11 ms.
[2020-06-05 06:32:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2020-06-05 06:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:19] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2020-06-05 06:32:19] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 12 ms.
[2020-06-05 06:32:20] [INFO ] Added : 240 causal constraints over 49 iterations in 895 ms. Result :sat
[2020-06-05 06:32:20] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2020-06-05 06:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:20] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-05 06:32:20] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 12 ms.
[2020-06-05 06:32:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2020-06-05 06:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:21] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-06-05 06:32:21] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:22] [INFO ] Added : 239 causal constraints over 49 iterations in 1087 ms. Result :sat
[2020-06-05 06:32:22] [INFO ] [Real]Absence check using 121 positive place invariants in 44 ms returned sat
[2020-06-05 06:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:22] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-05 06:32:22] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 12 ms.
[2020-06-05 06:32:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:22] [INFO ] [Nat]Absence check using 121 positive place invariants in 38 ms returned sat
[2020-06-05 06:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:22] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-06-05 06:32:22] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 11 ms.
[2020-06-05 06:32:23] [INFO ] Added : 237 causal constraints over 48 iterations in 795 ms. Result :sat
[2020-06-05 06:32:23] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2020-06-05 06:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:23] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-05 06:32:23] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 12 ms.
[2020-06-05 06:32:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:23] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2020-06-05 06:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:23] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-06-05 06:32:23] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:24] [INFO ] Added : 236 causal constraints over 48 iterations in 1011 ms. Result :sat
[2020-06-05 06:32:25] [INFO ] [Real]Absence check using 121 positive place invariants in 39 ms returned sat
[2020-06-05 06:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:25] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-06-05 06:32:25] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 10 ms.
[2020-06-05 06:32:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2020-06-05 06:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:25] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-05 06:32:25] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 11 ms.
[2020-06-05 06:32:26] [INFO ] Added : 237 causal constraints over 48 iterations in 809 ms. Result :sat
[2020-06-05 06:32:26] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2020-06-05 06:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:26] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-05 06:32:26] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2020-06-05 06:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:26] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2020-06-05 06:32:26] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 14 ms.
[2020-06-05 06:32:27] [INFO ] Added : 237 causal constraints over 49 iterations in 951 ms. Result :sat
[2020-06-05 06:32:27] [INFO ] [Real]Absence check using 121 positive place invariants in 43 ms returned sat
[2020-06-05 06:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:28] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-06-05 06:32:28] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 11 ms.
[2020-06-05 06:32:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 38 ms returned sat
[2020-06-05 06:32:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:28] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-06-05 06:32:28] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:29] [INFO ] Added : 239 causal constraints over 49 iterations in 829 ms. Result :sat
[2020-06-05 06:32:29] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2020-06-05 06:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:29] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-06-05 06:32:29] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 16 ms.
[2020-06-05 06:32:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2020-06-05 06:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:29] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2020-06-05 06:32:29] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 11 ms.
[2020-06-05 06:32:30] [INFO ] Added : 238 causal constraints over 48 iterations in 995 ms. Result :sat
[2020-06-05 06:32:30] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned unsat
[2020-06-05 06:32:30] [INFO ] [Real]Absence check using 121 positive place invariants in 38 ms returned sat
[2020-06-05 06:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:31] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2020-06-05 06:32:31] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 17 ms.
[2020-06-05 06:32:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 46 ms returned sat
[2020-06-05 06:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:31] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2020-06-05 06:32:31] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:32] [INFO ] Added : 239 causal constraints over 49 iterations in 897 ms. Result :sat
[2020-06-05 06:32:32] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2020-06-05 06:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:32] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-05 06:32:32] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 12 ms.
[2020-06-05 06:32:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 06:32:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 47 ms returned sat
[2020-06-05 06:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 06:32:32] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2020-06-05 06:32:32] [INFO ] Computed and/alt/rep : 241/1049/241 causal constraints in 13 ms.
[2020-06-05 06:32:33] [INFO ] Added : 236 causal constraints over 48 iterations in 914 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-05 06:32:34] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 06:32:34] [INFO ] Flatten gal took : 70 ms
FORMULA ShieldRVt-PT-030A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 06:32:34] [INFO ] Applying decomposition
[2020-06-05 06:32:34] [INFO ] Flatten gal took : 23 ms
[2020-06-05 06:32:34] [INFO ] Decomposing Gal with order
[2020-06-05 06:32:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 06:32:34] [INFO ] Removed a total of 90 redundant transitions.
[2020-06-05 06:32:34] [INFO ] Flatten gal took : 49 ms
[2020-06-05 06:32:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-06-05 06:32:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-05 06:32:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-030A @ 3570 seconds

FORMULA ShieldRVt-PT-030A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-030A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3528
rslt: Output for LTLFireability @ ShieldRVt-PT-030A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 06:32:34 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p94) AND (1 <= p97))) OR (X (X (F (((1 <= p188) AND (1 <= p189) AND (1 <= p192))))) AND (F (((1 <= p73))) AND (((1 <= p73)) AND (((1 <= p94)) AND ((1 <= p97))))))))",
"processed_size": 178,
"rewrites": 63
},
"result":
{
"edges": 20654707,
"markings": 20654707,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((G (F (((1 <= p11)))) AND F (((1 <= p67)))))))",
"processed_size": 55,
"rewrites": 63
},
"result":
{
"edges": 191,
"markings": 191,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p67)))",
"processed_size": 16,
"rewrites": 63
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p67)))",
"processed_size": 16,
"rewrites": 63
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p5 <= 0))",
"processed_size": 11,
"rewrites": 65
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((X ((((1 <= p9)) OR ((1 <= p44) AND (1 <= p45) AND (1 <= p48)) OR ((1 <= p89)))) OR ((1 <= p131))))",
"processed_size": 104,
"rewrites": 63
},
"result":
{
"edges": 194,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p0 <= 0))",
"processed_size": 11,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (((1 <= p188) AND (1 <= p189) AND (1 <= p192))) U ((1 <= p35)))",
"processed_size": 66,
"rewrites": 63
},
"result":
{
"edges": 194,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F (((p0 <= 0))))",
"processed_size": 19,
"rewrites": 63
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (X (F (((p203 <= 0))))) AND G (((p174 <= 0) OR (p177 <= 0)))))",
"processed_size": 69,
"rewrites": 63
},
"result":
{
"edges": 191,
"markings": 191,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p157)) OR ((1 <= p150) AND (1 <= p153)))))",
"processed_size": 57,
"rewrites": 63
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((((1 <= p23)) OR (G (((1 <= p238) AND (1 <= p241))) AND F (((1 <= p23))))) AND X (F ((F (((p239 <= 0))) OR ((1 <= p238) AND (1 <= p241)))))))",
"processed_size": 145,
"rewrites": 63
},
"result":
{
"edges": 194,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 705
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 705
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p211) AND ((p100 <= 0) OR (p101 <= 0) OR (p104 <= 0)))",
"processed_size": 63,
"rewrites": 63
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 882
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((X (((p211 <= 0))) OR ((1 <= p65))))",
"processed_size": 39,
"rewrites": 63
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 882
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p25))))",
"processed_size": 20,
"rewrites": 63
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1176
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((G (F (((1 <= p231)))) OR F (G (((1 <= p86) AND (1 <= p89)))))))",
"processed_size": 70,
"rewrites": 63
},
"result":
{
"edges": 86,
"markings": 82,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1764
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((F (G (((1 <= p99) AND (1 <= p108) AND (1 <= p114)))) AND (((1 <= p104)) AND (((1 <= p106)) AND ((1 <= p111))))))",
"processed_size": 116,
"rewrites": 63
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3528
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p223))))",
"processed_size": 21,
"rewrites": 63
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 41828,
"runtime": 42.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(**) OR (X(X(F(**))) AND (F(**) AND (** AND (** AND **)))))) : F(G((G(F(**)) OR F(G(**))))) : X(X(G((G(F(**)) AND F(**))))) : (F(G(**)) AND G(F(**))) : F(G(**)) : F((F(G(**)) AND (** AND (** AND **)))) : ((F(**) OR G(**)) AND (X(F(**)) OR G(**))) : G((X(*) OR **)) : ((X(**) U **) OR **) : X(F(*)) : F((X(X(F(*))) AND G(*))) : (G(F(**)) AND X(**)) : X(((** OR (G(**) AND F(**))) AND X(F((F(*) OR **))))) : (F((X(**) OR **)) OR **)"
},
"net":
{
"arcs": 1024,
"conflict_clusters": 63,
"places": 243,
"places_significant": 122,
"singleton_clusters": 0,
"transitions": 242
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no no no yes ",
"value": "no no no no no no no no no yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 485/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7776
lola: finding significant places
lola: 243 places, 242 transitions, 122 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p239 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p241 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: X ((G (((1 <= p94) AND (1 <= p97))) OR ((((F (X (X (((1 <= p188) AND (1 <= p189) AND (1 <= p192))))) AND F (((1 <= p73)))) AND ((1 <= p73))) AND ((1 <= p94))) AND ((1 <= p97))))) : NOT(F (G (NOT(G ((G (F (X (X (((1 <= p231)))))) OR F (G (((1 <= p86) AND (1 <= p89)))))))))) : G (X (X ((G (F (((1 <= p11)))) AND F (((1 <= p67))))))) : (F (G (((1 <= p65)))) AND G ((((1 <= p212) AND (1 <= p213) AND (1 <= p216)) U F (((1 <= p223)))))) : (F ((((1 <= p95)) U F (((1 <= p95))))) U F (X (G (X (G (((1 <= p25)))))))) : F ((((p156 <= 0) OR (p157 <= 0) OR (p160 <= 0)) U (((F (G (((1 <= p99) AND (1 <= p108) AND (1 <= p114)))) AND ((1 <= p104))) AND ((1 <= p106))) AND ((1 <= p111))))) : ((F (((1 <= p5))) OR G (((1 <= p67)))) AND (X (F (((1 <= p151) AND (1 <= p68) AND (1 <= p69) AND (1 <= p72)))) OR G (((1 <= p67))))) : G ((NOT(X ((((p9 <= 0)) AND ((p44 <= 0) OR (p45 <= 0) OR (p48 <= 0)) AND ((p89 <= 0))))) OR ((1 <= p131)))) : ((X (((1 <= p188) AND (1 <= p189) AND (1 <= p192))) U ((1 <= p35))) OR ((p0 <= 0))) : X (NOT(G (((1 <= p0))))) : F ((NOT(X (G (X (((1 <= p203)))))) AND NOT(F (((1 <= p174) AND (1 <= p177)))))) : (F (G (F ((((1 <= p157)) OR ((1 <= p150) AND (1 <= p153)))))) AND X (((1 <= p69)))) : X (((G (((1 <= p238) AND (1 <= p241))) U ((1 <= p23))) AND X (F ((NOT(G (((1 <= p239)))) OR ((1 <= p238) AND (1 <= p241))))))) : (F ((X (((p211 <= 0))) OR ((1 <= p65)))) OR ((1 <= p211) AND ((p100 <= 0) OR (p101 <= 0) OR (p104 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p94) AND (1 <= p97))) OR (X (X (F (((1 <= p188) AND (1 <= p189) AND (1 <= p192))))) AND (F (((1 <= p73))) AND (((1 <= p73)) AND (((1 <= p94)) AND ((1 <= p97))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p94) AND (1 <= p97))) OR (X (X (F (((1 <= p188) AND (1 <= p189) AND (1 <= p192))))) AND (F (((1 <= p73))) AND (((1 <= p73)) AND (((1 <= p94)) AND ((1 <= p97))))))))
lola: processed formula length: 178
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2755645 markings, 2755645 edges, 551129 markings/sec, 0 secs
lola: 5657142 markings, 5657142 edges, 580299 markings/sec, 5 secs
lola: 8558858 markings, 8558857 edges, 580343 markings/sec, 10 secs
lola: 11429694 markings, 11429694 edges, 574167 markings/sec, 15 secs
lola: 14252896 markings, 14252896 edges, 564640 markings/sec, 20 secs
lola: 17036432 markings, 17036431 edges, 556707 markings/sec, 25 secs
lola: 19822091 markings, 19822091 edges, 557132 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20654707 markings, 20654707 edges
lola: ========================================
lola: subprocess 1 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((G (F (((1 <= p11)))) AND F (((1 <= p67)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G (F (((1 <= p11)))) AND F (((1 <= p67)))))))
lola: processed formula length: 55
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 191 markings, 191 edges
lola: ========================================
lola: subprocess 2 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p5))) OR G (((1 <= p67)))) AND (X (F (((1 <= p151) AND (1 <= p68) AND (1 <= p69) AND (1 <= p72)))) OR G (((1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p67)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p67)))
lola: processed formula length: 16
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p67)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p67)))
lola: processed formula length: 16
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p5 <= 0))
lola: processed formula length: 11
lola: 65 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((1 <= p9)) OR ((1 <= p44) AND (1 <= p45) AND (1 <= p48)) OR ((1 <= p89)))) OR ((1 <= p131))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((1 <= p9)) OR ((1 <= p44) AND (1 <= p45) AND (1 <= p48)) OR ((1 <= p89)))) OR ((1 <= p131))))
lola: processed formula length: 104
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 194 markings, 194 edges
lola: ========================================
lola: subprocess 4 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p188) AND (1 <= p189) AND (1 <= p192))) U ((1 <= p35))) OR ((p0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 <= 0))
lola: processed formula length: 11
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p188) AND (1 <= p189) AND (1 <= p192))) U ((1 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p188) AND (1 <= p189) AND (1 <= p192))) U ((1 <= p35)))
lola: processed formula length: 66
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 194 markings, 194 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p0 <= 0))))
lola: processed formula length: 19
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F (((p203 <= 0))))) AND G (((p174 <= 0) OR (p177 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F (((p203 <= 0))))) AND G (((p174 <= 0) OR (p177 <= 0)))))
lola: processed formula length: 69
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 191 markings, 191 edges
lola: ========================================
lola: subprocess 7 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((1 <= p157)) OR ((1 <= p150) AND (1 <= p153))))) AND X (((1 <= p69))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p157)) OR ((1 <= p150) AND (1 <= p153)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p157)) OR ((1 <= p150) AND (1 <= p153)))))
lola: processed formula length: 57
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p23)) OR (G (((1 <= p238) AND (1 <= p241))) AND F (((1 <= p23))))) AND X (F ((F (((p239 <= 0))) OR ((1 <= p238) AND (1 <= p241)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p23)) OR (G (((1 <= p238) AND (1 <= p241))) AND F (((1 <= p23))))) AND X (F ((F (((p239 <= 0))) OR ((1 <= p238) AND (1 <= p241)))))))
lola: processed formula length: 145
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 194 markings, 194 edges
lola: ========================================
lola: subprocess 9 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (((p211 <= 0))) OR ((1 <= p65)))) OR ((1 <= p211) AND ((p100 <= 0) OR (p101 <= 0) OR (p104 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p211) AND ((p100 <= 0) OR (p101 <= 0) OR (p104 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p211) AND ((p100 <= 0) OR (p101 <= 0) OR (p104 <= 0)))
lola: processed formula length: 63
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p211 <= 0))) OR ((1 <= p65))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p211 <= 0))) OR ((1 <= p65))))
lola: processed formula length: 39
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 882 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p25))))
lola: processed formula length: 20
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 11 will run for 1176 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F (((1 <= p231)))) OR F (G (((1 <= p86) AND (1 <= p89)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F (((1 <= p231)))) OR F (G (((1 <= p86) AND (1 <= p89)))))))
lola: processed formula length: 70
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 82 markings, 86 edges
lola: ========================================
lola: subprocess 12 will run for 1764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((1 <= p99) AND (1 <= p108) AND (1 <= p114)))) AND (((1 <= p104)) AND (((1 <= p106)) AND ((1 <= p111))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((1 <= p99) AND (1 <= p108) AND (1 <= p114)))) AND (((1 <= p104)) AND (((1 <= p106)) AND ((1 <= p111))))))
lola: processed formula length: 116
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 3528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p65)))) AND G (F (((1 <= p223)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p223))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p223))))
lola: processed formula length: 21
lola: 63 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no no no yes
lola:
preliminary result: no no no no no no no no no yes no no no yes
lola: memory consumption: 41828 KB
lola: time consumption: 42 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

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-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is ShieldRVt-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 r211-tajo-159033478301034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030A.tgz
mv ShieldRVt-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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;