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.r176-tajo-158987872300730.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 QuasiCertifProtocol-COL-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300730
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.7K Apr 12 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 61K Mar 24 05:37 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 QuasiCertifProtocol-COL-06-00
FORMULA_NAME QuasiCertifProtocol-COL-06-01
FORMULA_NAME QuasiCertifProtocol-COL-06-02
FORMULA_NAME QuasiCertifProtocol-COL-06-03
FORMULA_NAME QuasiCertifProtocol-COL-06-04
FORMULA_NAME QuasiCertifProtocol-COL-06-05
FORMULA_NAME QuasiCertifProtocol-COL-06-06
FORMULA_NAME QuasiCertifProtocol-COL-06-07
FORMULA_NAME QuasiCertifProtocol-COL-06-08
FORMULA_NAME QuasiCertifProtocol-COL-06-09
FORMULA_NAME QuasiCertifProtocol-COL-06-10
FORMULA_NAME QuasiCertifProtocol-COL-06-11
FORMULA_NAME QuasiCertifProtocol-COL-06-12
FORMULA_NAME QuasiCertifProtocol-COL-06-13
FORMULA_NAME QuasiCertifProtocol-COL-06-14
FORMULA_NAME QuasiCertifProtocol-COL-06-15

=== Now, execution of the tool begins

BK_START 1591178440088

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:00:41] [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-03 10:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:00:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 10:00:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2020-06-03 10:00:42] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2020-06-03 10:00:42] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 31 ms.
[2020-06-03 10:00:42] [INFO ] Computed order based on color domains.
[2020-06-03 10:00:42] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 22 ms.
[2020-06-03 10:00:42] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 46 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9824 resets, run finished after 597 ms. (steps per millisecond=167 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 116 rows 270 cols
[2020-06-03 10:00:43] [INFO ] Computed 155 place invariants in 13 ms
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 59 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-06-03 10:00:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:00:43] [INFO ] Added : 20 causal constraints over 4 iterations in 72 ms. Result :sat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 10:00:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-06-03 10:00:44] [INFO ] Added : 14 causal constraints over 3 iterations in 52 ms. Result :sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-03 10:00:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:44] [INFO ] Added : 15 causal constraints over 3 iterations in 48 ms. Result :sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 33 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 10:00:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:44] [INFO ] Added : 15 causal constraints over 3 iterations in 45 ms. Result :sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:44] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2020-06-03 10:00:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:45] [INFO ] Added : 41 causal constraints over 9 iterations in 103 ms. Result :sat
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 47 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-06-03 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 80 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:45] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-06-03 10:00:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:45] [INFO ] Added : 25 causal constraints over 5 iterations in 59 ms. Result :sat
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-03 10:00:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 59 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:46] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2020-06-03 10:00:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:00:46] [INFO ] Added : 19 causal constraints over 4 iterations in 55 ms. Result :sat
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 10:00:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:46] [INFO ] Added : 19 causal constraints over 4 iterations in 49 ms. Result :sat
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 46 ms returned sat
[2020-06-03 10:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-06-03 10:00:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:47] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2020-06-03 10:00:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:47] [INFO ] Added : 16 causal constraints over 4 iterations in 57 ms. Result :sat
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 67 ms returned sat
[2020-06-03 10:00:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:47] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2020-06-03 10:00:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:00:48] [INFO ] Added : 23 causal constraints over 5 iterations in 71 ms. Result :sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 52 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2020-06-03 10:00:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 63 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:48] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2020-06-03 10:00:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:48] [INFO ] Added : 40 causal constraints over 8 iterations in 104 ms. Result :sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 37 ms returned sat
[2020-06-03 10:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2020-06-03 10:00:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:00:49] [INFO ] Added : 41 causal constraints over 9 iterations in 96 ms. Result :sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2020-06-03 10:00:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:49] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2020-06-03 10:00:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:00:49] [INFO ] Added : 40 causal constraints over 8 iterations in 89 ms. Result :sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-06-03 10:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-03 10:00:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:50] [INFO ] Added : 44 causal constraints over 9 iterations in 117 ms. Result :sat
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 10:00:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:50] [INFO ] Added : 49 causal constraints over 10 iterations in 107 ms. Result :sat
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 43 ms returned sat
[2020-06-03 10:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:50] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-06-03 10:00:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:51] [INFO ] Added : 47 causal constraints over 10 iterations in 173 ms. Result :sat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-06-03 10:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-06-03 10:00:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:51] [INFO ] Added : 47 causal constraints over 10 iterations in 110 ms. Result :sat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:51] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-03 10:00:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:51] [INFO ] Added : 46 causal constraints over 10 iterations in 143 ms. Result :sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 56 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-03 10:00:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:00:52] [INFO ] Added : 47 causal constraints over 10 iterations in 126 ms. Result :sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-06-03 10:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-06-03 10:00:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:00:52] [INFO ] Added : 45 causal constraints over 9 iterations in 113 ms. Result :sat
[2020-06-03 10:00:52] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:53] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 91 ms returned sat
[2020-06-03 10:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:53] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2020-06-03 10:00:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:00:53] [INFO ] Added : 20 causal constraints over 4 iterations in 52 ms. Result :sat
[2020-06-03 10:00:53] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 10:00:53] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 79 ms returned sat
[2020-06-03 10:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:53] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-06-03 10:00:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:53] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 59 ms returned sat
[2020-06-03 10:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:54] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2020-06-03 10:00:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:54] [INFO ] Added : 34 causal constraints over 7 iterations in 138 ms. Result :sat
[2020-06-03 10:00:54] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:54] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 80 ms returned sat
[2020-06-03 10:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:54] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-06-03 10:00:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2020-06-03 10:00:54] [INFO ] Added : 24 causal constraints over 5 iterations in 106 ms. Result :sat
[2020-06-03 10:00:54] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:00:54] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-06-03 10:00:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:55] [INFO ] Added : 24 causal constraints over 5 iterations in 67 ms. Result :sat
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 62 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 10:00:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 12 ms.
[2020-06-03 10:00:55] [INFO ] Added : 23 causal constraints over 5 iterations in 76 ms. Result :sat
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 48 ms returned sat
[2020-06-03 10:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:55] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2020-06-03 10:00:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:55] [INFO ] Added : 24 causal constraints over 5 iterations in 85 ms. Result :sat
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 58 ms returned sat
[2020-06-03 10:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-06-03 10:00:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:00:56] [INFO ] Added : 22 causal constraints over 5 iterations in 65 ms. Result :sat
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 71 ms returned sat
[2020-06-03 10:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-06-03 10:00:56] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:56] [INFO ] Added : 23 causal constraints over 5 iterations in 88 ms. Result :sat
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:56] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 70 ms returned sat
[2020-06-03 10:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:57] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-03 10:00:57] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:00:57] [INFO ] Added : 24 causal constraints over 5 iterations in 88 ms. Result :sat
[2020-06-03 10:00:57] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 10:00:57] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 67 ms returned sat
[2020-06-03 10:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:57] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2020-06-03 10:00:57] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2020-06-03 10:00:57] [INFO ] Added : 19 causal constraints over 4 iterations in 66 ms. Result :sat
[2020-06-03 10:00:57] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 10:00:57] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 96 ms returned sat
[2020-06-03 10:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:58] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2020-06-03 10:00:58] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:58] [INFO ] Added : 48 causal constraints over 10 iterations in 175 ms. Result :sat
[2020-06-03 10:00:58] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:00:58] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 52 ms returned sat
[2020-06-03 10:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:58] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2020-06-03 10:00:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:00:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:00:58] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 72 ms returned sat
[2020-06-03 10:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:00:59] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2020-06-03 10:00:59] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:00:59] [INFO ] Added : 33 causal constraints over 7 iterations in 90 ms. Result :sat
[2020-06-03 10:00:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 10:00:59] [INFO ] Flatten gal took : 72 ms
FORMULA QuasiCertifProtocol-COL-06-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 10:00:59] [INFO ] Applying decomposition
[2020-06-03 10:00:59] [INFO ] Flatten gal took : 24 ms
[2020-06-03 10:00:59] [INFO ] Decomposing Gal with order
[2020-06-03 10:00:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 10:00:59] [INFO ] Removed a total of 104 redundant transitions.
[2020-06-03 10:00:59] [INFO ] Flatten gal took : 71 ms
[2020-06-03 10:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 11 ms.
[2020-06-03 10:00:59] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2020-06-03 10:00:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ QuasiCertifProtocol-COL-06 @ 3570 seconds

FORMULA QuasiCertifProtocol-COL-06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-COL-06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3525
rslt: Output for LTLFireability @ QuasiCertifProtocol-COL-06

{
"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": "Wed Jun 3 10:00:59 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 14,
"adisj": 1,
"aneg": 8,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 7,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (G ((((G (F ((((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220))))) OR (1 <= p260)) R X ((1 <= p257))) AND (((p172 <= 0) OR (p214 <= 0)) AND (((p175 <= 0) OR (p217 <= 0)) AND (((p176 <= 0) OR (p218 <= 0)) AND (((p173 <= 0) OR (p215 <= 0)) AND (((p174 <= 0) OR (p216 <= 0)) AND (((p177 <= 0) OR (p219 <= 0)) AND ((p178 <= 0) OR (p220 <= 0)))))))))))",
"processed_size": 540,
"rewrites": 156
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 8,
"aneg": 0,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "X ((X (((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p163 <= 0) OR (p226 <= 0)) AND ((p160 <= 0) OR (p223 <= 0)) AND ((p164 <= 0) OR (p227 <= 0)) AND (p256 <= 0)))) OR F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))",
"processed_size": 396,
"rewrites": 156
},
"result":
{
"edges": 72,
"markings": 45,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (X (F ((X (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR F (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)))))))",
"processed_size": 276,
"rewrites": 156
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F ((X (F (((1 <= p259) OR (((p0 <= 0) OR (p221 <= 0)) AND ((p0 <= 0) OR (p222 <= 0)) AND ((p0 <= 0) OR (p223 <= 0)) AND ((p0 <= 0) OR (p224 <= 0)) AND ((p0 <= 0) OR (p225 <= 0)) AND ((p0 <= 0) OR (p226 <= 0)) AND ((p0 <= 0) OR (p227 <= 0)))))) AND (p259 <= 0)))",
"processed_size": 269,
"rewrites": 156
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 58,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 58,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 57,
"visible_transitions": 0
},
"processed": "X (((1 <= p256) OR (F ((1 <= p256)) AND F (G ((((1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p66) AND (1 <= p236)) OR ((1 <= p95) AND (1 <= p96) AND (1 <= p97) AND (1 <= p98) AND (1 <= p99) AND (1 <= p100) AND (1 <= p101) AND (1 <= p241)) OR ((1 <= p81) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85) AND (1 <= p86) AND (1 <= p87) AND (1 <= p239)) OR ((1 <= p67) AND (1 <= p68) AND (1 <= p69) AND (1 <= p70) AND (1 <= p71) AND (1 <= p72) AND (1 <= p73) AND (1 <= p237)) OR ((1 <= p88) AND (1 <= p89) AND (1 <= p90) AND (1 <= p91) AND (1 <= p92) AND (1 <= p93) AND (1 <= p94) AND (1 <= p240)) OR ((1 <= p53) AND (1 <= p54) AND (1 <= p55) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p235)) OR ((1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77) AND (1 <= p78) AND (1 <= p79) AND (1 <= p80) AND (1 <= p238))))))))",
"processed_size": 911,
"rewrites": 156
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 4,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 8,
"aneg": 2,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "X ((F ((((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0)))) AND (((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0)) R (((p172 <= 0) OR (p214 <= 0)) AND ((p175 <= 0) OR (p217 <= 0)) AND ((p176 <= 0) OR (p218 <= 0)) AND ((p173 <= 0) OR (p215 <= 0)) AND ((p174 <= 0) OR (p216 <= 0)) AND ((p177 <= 0) OR (p219 <= 0)) AND ((p178 <= 0) OR (p220 <= 0))))))",
"processed_size": 601,
"rewrites": 156
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(X (X (G (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))))) U (1 <= p257))",
"processed_size": 153,
"rewrites": 156
},
"result":
{
"edges": 63,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 3,
"aconj": 28,
"adisj": 4,
"aneg": 1,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))))) OR (F ((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p163 <= 0) OR (p226 <= 0)) AND ((p160 <= 0) OR (p223 <= 0)) AND ((p164 <= 0) OR (p227 <= 0)))) U G ((F ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))) AND (((1 <= p0) AND (1 <= p193)) OR ((1 <= p0) AND (1 <= p194)) OR ((1 <= p0) AND (1 <= p195)) OR ((1 <= p0) AND (1 <= p196)) OR ((1 <= p0) AND (1 <= p197)) OR ((1 <= p0) AND (1 <= p198)) OR ((1 <= p0) AND (1 <= p199))))))))",
"processed_size": 972,
"rewrites": 156
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"compoundnumber": 7,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 7,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= 0) OR (p235 <= 0)) AND ((p0 <= 0) OR (p236 <= 0)) AND ((p0 <= 0) OR (p237 <= 0)) AND ((p0 <= 0) OR (p238 <= 0)) AND ((p0 <= 0) OR (p239 <= 0)) AND ((p0 <= 0) OR (p240 <= 0)) AND ((p0 <= 0) OR (p241 <= 0)))))",
"processed_size": 229,
"rewrites": 156
},
"result":
{
"edges": 34281802,
"markings": 4276346,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 705
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))) AND ((1 <= p257) OR ((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))))))",
"processed_size": 254,
"rewrites": 156
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 881
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 5,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 1,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G ((F (G ((1 <= p259))) OR ((G (((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))) AND F (G ((1 <= p259)))) OR (G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))) OR (((1 <= p0) AND (1 <= p248)) OR (((1 <= p0) AND (1 <= p242)) OR (((1 <= p0) AND (1 <= p243)) OR (((1 <= p0) AND (1 <= p244)) OR (((1 <= p0) AND (1 <= p245)) OR (((1 <= p0) AND (1 <= p246)) OR ((1 <= p0) AND (1 <= p247))))))))))))",
"processed_size": 534,
"rewrites": 156
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 10,
"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": 1175
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1175
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 15,
"adisj": 2,
"aneg": 0,
"comp": 28,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((((1 <= p0) AND (1 <= p232)) OR ((1 <= p0) AND (1 <= p233)) OR ((1 <= p0) AND (1 <= p234)) OR ((1 <= p0) AND (1 <= p228)) OR ((1 <= p0) AND (1 <= p229)) OR ((1 <= p0) AND (1 <= p230)) OR ((1 <= p0) AND (1 <= p231))) AND (((1 <= p0) AND (1 <= p235)) OR ((1 <= p0) AND (1 <= p236)) OR ((1 <= p0) AND (1 <= p237)) OR ((1 <= p0) AND (1 <= p238)) OR ((1 <= p0) AND (1 <= p239)) OR ((1 <= p0) AND (1 <= p240)) OR ((1 <= p0) AND (1 <= p241))))",
"processed_size": 449,
"rewrites": 156
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1762
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 1,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G ((((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0))))",
"processed_size": 225,
"rewrites": 156
},
"result":
{
"edges": 243,
"markings": 117,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1762
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((p231 <= 0) AND (p230 <= 0) AND (p229 <= 0) AND (p228 <= 0) AND (p234 <= 0) AND (p233 <= 0) AND (p232 <= 0))",
"processed_size": 109,
"rewrites": 167
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 14,
"adisj": 2,
"aneg": 0,
"comp": 112,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 112,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "G (F ((F ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204)))) AND (((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204))))))",
"processed_size": 1833,
"rewrites": 156
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))",
"processed_size": 125,
"rewrites": 156
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 0,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204)))))",
"processed_size": 915,
"rewrites": 156
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 64,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "F ((F (G ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204))))) OR ((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))))",
"processed_size": 1050,
"rewrites": 156
},
"result":
{
"edges": 21,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 129276,
"runtime": 45.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((((G(F(**)) OR *) R X(**)) AND (* AND (* AND (* AND (* AND (* AND (* AND *))))))))) : X((X(**) OR F(**))) : X(X(F((X(**) OR F(**))))) : F((X(F(*)) AND **)) : F(G((F(**) AND (** OR **)))) : X((** OR (F(**) AND F(G(**))))) : G(F(**)) : G((F(G(**)) OR ((G(**) AND F(G(**))) OR (G(**) OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))) : X((F(**) AND (* R *))) : (G(F((F(**) AND **))) AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))) : (X(X(G(**))) U **) : (F(G(**)) OR (** OR (G(*) AND F((F(G(**)) OR **))))) : X((X(X(G(**))) OR (F(*) U G((F(**) AND **))))) : (G(*) OR **)"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no yes no yes no no yes no yes no no no no no ",
"value": "no yes no yes no no yes no yes no no no no no "
},
"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: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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: G (NOT(X ((((((((((NOT(G (F ((((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220)))))) AND (p260 <= 0)) U NOT(X ((1 <= p257)))) OR ((1 <= p172) AND (1 <= p214))) OR ((1 <= p175) AND (1 <= p217))) OR ((1 <= p176) AND (1 <= p218))) OR ((1 <= p173) AND (1 <= p215))) OR ((1 <= p174) AND (1 <= p216))) OR ((1 <= p177) AND (1 <= p219))) OR ((1 <= p178) AND (1 <= p220)))))) : (X (X (((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p163 <= 0) OR (p226 <= 0)) AND ((p160 <= 0) OR (p223 <= 0)) AND ((p164 <= 0) OR (p227 <= 0)) AND (p256 <= 0))))) OR X (F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))))) : F (X (X ((X (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR F (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))))))) : F ((NOT(G (X (((p259 <= 0) AND (((1 <= p0) AND (1 <= p221)) OR ((1 <= p0) AND (1 <= p222)) OR ((1 <= p0) AND (1 <= p223)) OR ((1 <= p0) AND (1 <= p224)) OR ((1 <= p0) AND (1 <= p225)) OR ((1 <= p0) AND (1 <= p226)) OR ((1 <= p0) AND (1 <= p227))))))) AND (p259 <= 0))) : F (G (((1 <= p257) U ((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))))) : X ((F (G ((((1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p66) AND (1 <= p236)) OR ((1 <= p95) AND (1 <= p96) AND (1 <= p97) AND (1 <= p98) AND (1 <= p99) AND (1 <= p100) AND (1 <= p101) AND (1 <= p241)) OR ((1 <= p81) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85) AND (1 <= p86) AND (1 <= p87) AND (1 <= p239)) OR ((1 <= p67) AND (1 <= p68) AND (1 <= p69) AND (1 <= p70) AND (1 <= p71) AND (1 <= p72) AND (1 <= p73) AND (1 <= p237)) OR ((1 <= p88) AND (1 <= p89) AND (1 <= p90) AND (1 <= p91) AND (1 <= p92) AND (1 <= p93) AND (1 <= p94) AND (1 <= p240)) OR ((1 <= p53) AND (1 <= p54) AND (1 <= p55) AND (1 <= p56) AND (1 <= p57) AND (1 <= p58) AND (1 <= p59) AND (1 <= p235)) OR ((1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77) AND (1 <= p78) AND (1 <= p79) AND (1 <= p80) AND (1 <= p238))))) U (1 <= p256))) : G (X (F ((((p0 <= 0) OR (p235 <= 0)) AND ((p0 <= 0) OR (p236 <= 0)) AND ((p0 <= 0) OR (p237 <= 0)) AND ((p0 <= 0) OR (p238 <= 0)) AND ((p0 <= 0) OR (p239 <= 0)) AND ((p0 <= 0) OR (p240 <= 0)) AND ((p0 <= 0) OR (p241 <= 0)))))) : G ((((((((((G (((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))) U F (G ((1 <= p259)))) OR G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)))) OR ((1 <= p0) AND (1 <= p248))) OR ((1 <= p0) AND (1 <= p242))) OR ((1 <= p0) AND (1 <= p243))) OR ((1 <= p0) AND (1 <= p244))) OR ((1 <= p0) AND (1 <= p245))) OR ((1 <= p0) AND (1 <= p246))) OR ((1 <= p0) AND (1 <= p247)))) : (X (F ((F (((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0))) U (((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0)))))) AND NOT(X ((((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260)) U (((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220))))))) : (((((((NOT(X (X (F (NOT(F ((F ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204)))) AND (((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204)))))))))) AND (p231 <= 0)) AND (p230 <= 0)) AND (p229 <= 0)) AND (p228 <= 0)) AND (p234 <= 0)) AND (p233 <= 0)) AND (p232 <= 0)) : (G (X (G (X (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))) U (1 <= p257)) : (NOT(F ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204))))) U (F (G (X (G ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1 <= p103) AND (1 <= p110) AND (1 <= p117) AND (1 <= p124) AND (1 <= p131) AND (1 <= p138) AND (1 <= p145) AND (1 <= p201)) OR ((1 <= p105) AND (1 <= p112) AND (1 <= p119) AND (1 <= p126) AND (1 <= p133) AND (1 <= p140) AND (1 <= p147) AND (1 <= p203)) OR ((1 <= p107) AND (1 <= p114) AND (1 <= p121) AND (1 <= p128) AND (1 <= p135) AND (1 <= p142) AND (1 <= p149) AND (1 <= p205)) OR ((1 <= p106) AND (1 <= p113) AND (1 <= p120) AND (1 <= p127) AND (1 <= p134) AND (1 <= p141) AND (1 <= p148) AND (1 <= p204))))))) OR ((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)))) : X ((X (X (G ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))))) OR (NOT(G ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227))))) U G ((F ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))) AND (((1 <= p0) AND (1 <= p193)) OR ((1 <= p0) AND (1 <= p194)) OR ((1 <= p0) AND (1 <= p195)) OR ((1 <= p0) AND (1 <= p196)) OR ((1 <= p0) AND (1 <= p197)) OR ((1 <= p0) AND (1 <= p198)) OR ((1 <= p0) AND (1 <= p199)))))))) : (NOT(F ((((1 <= p0) AND (1 <= p232)) OR ((1 <= p0) AND (1 <= p233)) OR ((1 <= p0) AND (1 <= p234)) OR ((1 <= p0) AND (1 <= p228)) OR ((1 <= p0) AND (1 <= p229)) OR ((1 <= p0) AND (1 <= p230)) OR ((1 <= p0) AND (1 <= p231))))) OR ((((1 <= p0) AND (1 <= p232)) OR ((1 <= p0) AND (1 <= p233)) OR ((1 <= p0) AND (1 <= p234)) OR ((1 <= p0) AND (1 <= p228)) OR ((1 <= p0) AND (1 <= p229)) OR ((1 <= p0) AND (1 <= p230)) OR ((1 <= p0) AND (1 <= p231))) AND (((1 <= p0) AND (1 <= p235)) OR ((1 <= p0) AND (1 <= p236)) OR ((1 <= p0) AND (1 <= p237)) OR ((1 <= p0) AND (1 <= p238)) OR ((1 <= p0) AND (1 <= p239)) OR ((1 <= p0) AND (1 <= p240)) OR ((1 <= p0) AND (1 <= p241)))))
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: 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 ((((G (F ((((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220))))) OR (1 <= p260)) R X ((1 <= p257))) AND (((p172 <= 0) OR (p214 <= 0)) AND (((p175 <= 0) OR (p217 <= 0)) AND (((p176 <= 0) OR (p218 <= 0)) AND (((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((G (F ((((1 <= p172) AND (1 <= p214)) OR ((1 <= p175) AND (1 <= p217)) OR ((1 <= p176) AND (1 <= p218)) OR ((1 <= p173) AND (1 <= p215)) OR ((1 <= p174) AND (1 <= p216)) OR ((1 <= p177) AND (1 <= p219)) OR ((1 <= p178) AND (1 <= p220))))) OR (1 <= p260)) R X ((1 <= p257))) AND (((p172 <= 0) OR (p214 <= 0)) AND (((p175 <= 0) OR (p217 <= 0)) AND (((p176 <= 0) OR (p218 <= 0)) AND (((... (shortened)
lola: processed formula length: 540
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p163 <= 0) OR (p226 <= 0)) AND ((p160 <= 0) OR (p223 <= 0)) AND ((p164 <= 0) OR (p227 <= 0)) AND (p256 <= 0)))) OR F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p163 <= 0) OR (p226 <= 0)) AND ((p160 <= 0) OR (p223 <= 0)) AND ((p164 <= 0) OR (p227 <= 0)) AND (p256 <= 0)))) OR F (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))
lola: processed formula length: 396
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 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: 45 markings, 72 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR F (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR F (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)))))))
lola: processed formula length: 276
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((1 <= p259) OR (((p0 <= 0) OR (p221 <= 0)) AND ((p0 <= 0) OR (p222 <= 0)) AND ((p0 <= 0) OR (p223 <= 0)) AND ((p0 <= 0) OR (p224 <= 0)) AND ((p0 <= 0) OR (p225 <= 0)) AND ((p0 <= 0) OR (p226 <= 0)) AND ((p0 <= 0) OR (p227 <= 0)))))) AND (p259 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((1 <= p259) OR (((p0 <= 0) OR (p221 <= 0)) AND ((p0 <= 0) OR (p222 <= 0)) AND ((p0 <= 0) OR (p223 <= 0)) AND ((p0 <= 0) OR (p224 <= 0)) AND ((p0 <= 0) OR (p225 <= 0)) AND ((p0 <= 0) OR (p226 <= 0)) AND ((p0 <= 0) OR (p227 <= 0)))))) AND (p259 <= 0)))
lola: processed formula length: 269
lola: 156 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p256) OR (F ((1 <= p256)) AND F (G ((((1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p66) AND (1 <= p236)) OR ((1 <= p95) AND (1 <= p96) AND (1 <= p97) AND (1 <= p98) AND (1 <= p99) AND (1 <= p100) AND (1 <= p101) AND (1 <= p241)) OR ((1 <= p81) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85) AND (1 <= p86) AND (1 <= p87) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p256) OR (F ((1 <= p256)) AND F (G ((((1 <= p60) AND (1 <= p61) AND (1 <= p62) AND (1 <= p63) AND (1 <= p64) AND (1 <= p65) AND (1 <= p66) AND (1 <= p236)) OR ((1 <= p95) AND (1 <= p96) AND (1 <= p97) AND (1 <= p98) AND (1 <= p99) AND (1 <= p100) AND (1 <= p101) AND (1 <= p241)) OR ((1 <= p81) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85) AND (1 <= p86) AND (1 <= p87) AND... (shortened)
lola: processed formula length: 911
lola: 156 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0)))) AND (((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0)) R (((p172 <= 0) OR (p214 <= 0)) AND ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0)))) AND (((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0)) R (((p172 <= 0) OR (p214 <= 0)) AND ((... (shortened)
lola: processed formula length: 601
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))))) U (1 <= p257))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G (((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))))) U (1 <= p257))
lola: processed formula length: 153
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 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: 63 markings, 63 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))))) OR (F ((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((((1 <= p158) AND (1 <= p221)) OR ((1 <= p162) AND (1 <= p225)) OR ((1 <= p159) AND (1 <= p222)) OR ((1 <= p161) AND (1 <= p224)) OR ((1 <= p163) AND (1 <= p226)) OR ((1 <= p160) AND (1 <= p223)) OR ((1 <= p164) AND (1 <= p227)))))) OR (F ((((p158 <= 0) OR (p221 <= 0)) AND ((p162 <= 0) OR (p225 <= 0)) AND ((p159 <= 0) OR (p222 <= 0)) AND ((p161 <= 0) OR (p224 <= 0)) AND ((p1... (shortened)
lola: processed formula length: 972
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 18 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 0) OR (p235 <= 0)) AND ((p0 <= 0) OR (p236 <= 0)) AND ((p0 <= 0) OR (p237 <= 0)) AND ((p0 <= 0) OR (p238 <= 0)) AND ((p0 <= 0) OR (p239 <= 0)) AND ((p0 <= 0) OR (p240 <= 0)) AND ((p0 <= 0) OR (p241 <= 0)))))
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 ((((p0 <= 0) OR (p235 <= 0)) AND ((p0 <= 0) OR (p236 <= 0)) AND ((p0 <= 0) OR (p237 <= 0)) AND ((p0 <= 0) OR (p238 <= 0)) AND ((p0 <= 0) OR (p239 <= 0)) AND ((p0 <= 0) OR (p240 <= 0)) AND ((p0 <= 0) OR (p241 <= 0)))))
lola: processed formula length: 229
lola: 156 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: 1104101 markings, 3994831 edges, 220820 markings/sec, 0 secs
lola: 1978491 markings, 8409134 edges, 174878 markings/sec, 5 secs
lola: 2415569 markings, 13199546 edges, 87416 markings/sec, 10 secs
lola: 2813662 markings, 17361430 edges, 79619 markings/sec, 15 secs
lola: 3173812 markings, 21501957 edges, 72030 markings/sec, 20 secs
lola: 3489791 markings, 25811551 edges, 63196 markings/sec, 25 secs
lola: 3782978 markings, 30642696 edges, 58637 markings/sec, 30 secs
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: 4276346 markings, 34281802 edges
lola: ========================================
lola: subprocess 9 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))) AND ((1 <= p257) OR ((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))) AND ((1 <= p257) OR ((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))))))
lola: processed formula length: 254
lola: 156 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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 10 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((1 <= p259))) OR ((G (((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))) AND F (G ((1 <= p259)))) OR (G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))) OR (((1 <= p0) AND (1 <= p248)) OR (((1 <= p0) AND (1 <= p242)) OR (((1 <= p0) AND (1 <= p243)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((1 <= p259))) OR ((G (((1 <= p231) OR (1 <= p230) OR (1 <= p229) OR (1 <= p228) OR (1 <= p234) OR (1 <= p233) OR (1 <= p232))) AND F (G ((1 <= p259)))) OR (G (((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))) OR (((1 <= p0) AND (1 <= p248)) OR (((1 <= p0) AND (1 <= p242)) OR (((1 <= p0) AND (1 <= p243)) OR... (shortened)
lola: processed formula length: 534
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0)))) OR ((((1 <= p0) AND (1 <= p232)) OR ((1 <= p0) AND (1 <= p233)) OR ((1 <= p0) AND (1 <= p234)) OR ((1 <= p0) AND (1 <= p228)) OR ((1 <= p0) AND (1 <= p229)) OR ((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p0) AND (1 <= p232)) OR ((1 <= p0) AND (1 <= p233)) OR ((1 <= p0) AND (1 <= p234)) OR ((1 <= p0) AND (1 <= p228)) OR ((1 <= p0) AND (1 <= p229)) OR ((1 <= p0) AND (1 <= p230)) OR ((1 <= p0) AND (1 <= p231))) AND (((1 <= p0) AND (1 <= p235)) OR ((1 <= p0) AND (1 <= p236)) OR ((1 <= p0) AND (1 <= p237)) OR ((1 <= p0) AND (1 <= p238)) OR ((1 <= p0) AND (1 <= p239)) OR ((1 <= p0) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p0) AND (1 <= p232)) OR ((1 <= p0) AND (1 <= p233)) OR ((1 <= p0) AND (1 <= p234)) OR ((1 <= p0) AND (1 <= p228)) OR ((1 <= p0) AND (1 <= p229)) OR ((1 <= p0) AND (1 <= p230)) OR ((1 <= p0) AND (1 <= p231))) AND (((1 <= p0) AND (1 <= p235)) OR ((1 <= p0) AND (1 <= p236)) OR ((1 <= p0) AND (1 <= p237)) OR ((1 <= p0) AND (1 <= p238)) OR ((1 <= p0) AND (1 <= p239)) OR ((1 <= p0) A... (shortened)
lola: processed formula length: 449
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 28 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 12 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p0 <= 0) OR (p232 <= 0)) AND ((p0 <= 0) OR (p233 <= 0)) AND ((p0 <= 0) OR (p234 <= 0)) AND ((p0 <= 0) OR (p228 <= 0)) AND ((p0 <= 0) OR (p229 <= 0)) AND ((p0 <= 0) OR (p230 <= 0)) AND ((p0 <= 0) OR (p231 <= 0))))
lola: processed formula length: 225
lola: 156 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: 117 markings, 243 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((F ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p231 <= 0) AND ((p230 <= 0) AND ((p229 <= 0) AND ((p228 <= 0) AND ((p234 <= 0) AND ((p233 <= 0) AND (p232 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((p231 <= 0) AND (p230 <= 0) AND (p229 <= 0) AND (p228 <= 0) AND (p234 <= 0) AND (p233 <= 0) AND (p232 <= 0))
lola: processed formula length: 109
lola: 167 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 3525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ... (shortened)
lola: processed formula length: 1833
lola: 156 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: 19 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))
lola: processed formula length: 125
lola: 156 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 8 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: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1... (shortened)
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 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ((1... (shortened)
lola: processed formula length: 915
lola: 156 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: 20 markings, 21 edges
lola: ========================================
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((1 <= p102) AND (1 <= p109) AND (1 <= p116) AND (1 <= p123) AND (1 <= p130) AND (1 <= p137) AND (1 <= p144) AND (1 <= p200)) OR ((1 <= p108) AND (1 <= p115) AND (1 <= p122) AND (1 <= p129) AND (1 <= p136) AND (1 <= p143) AND (1 <= p150) AND (1 <= p206)) OR ((1 <= p104) AND (1 <= p111) AND (1 <= p118) AND (1 <= p125) AND (1 <= p132) AND (1 <= p139) AND (1 <= p146) AND (1 <= p202)) OR ... (shortened)
lola: processed formula length: 1050
lola: 156 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: 20 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no yes no yes no no no no no
lola:
preliminary result: no yes no yes no no yes no yes no no no no no
lola: memory consumption: 129276 KB
lola: time consumption: 45 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="QuasiCertifProtocol-COL-06"
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 QuasiCertifProtocol-COL-06, 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 r176-tajo-158987872300730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 ;