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-158987872300732.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300732
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591178492674

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:01:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:01:35] [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:01:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 570 ms
[2020-06-03 10:01:35] [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:01:35] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 28 ms.
[2020-06-03 10:01:35] [INFO ] Computed order based on color domains.
[2020-06-03 10:01:35] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions in 10 ms.
[2020-06-03 10:01:35] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Incomplete random walk after 100000 steps, including 9824 resets, run finished after 637 ms. (steps per millisecond=156 ) properties seen :[1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2020-06-03 10:01:36] [INFO ] Computed 155 place invariants in 25 ms
[2020-06-03 10:01:36] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2020-06-03 10:01:36] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-06-03 10:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:37] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2020-06-03 10:01:37] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 17 ms.
[2020-06-03 10:01:37] [INFO ] Added : 20 causal constraints over 4 iterations in 184 ms. Result :sat
[2020-06-03 10:01:37] [INFO ] [Real]Absence check using 11 positive place invariants in 30 ms returned sat
[2020-06-03 10:01:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 81 ms returned sat
[2020-06-03 10:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:37] [INFO ] [Real]Absence check using state equation in 290 ms returned unsat
[2020-06-03 10:01:37] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:01:37] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 72 ms returned sat
[2020-06-03 10:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:38] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-06-03 10:01:38] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 35 ms.
[2020-06-03 10:01:38] [INFO ] Added : 24 causal constraints over 5 iterations in 155 ms. Result :sat
[2020-06-03 10:01:38] [INFO ] [Real]Absence check using 11 positive place invariants in 32 ms returned sat
[2020-06-03 10:01:38] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 80 ms returned sat
[2020-06-03 10:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:38] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2020-06-03 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 36 ms returned sat
[2020-06-03 10:01:39] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 76 ms returned sat
[2020-06-03 10:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:39] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2020-06-03 10:01:39] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 29 ms.
[2020-06-03 10:01:39] [INFO ] Added : 40 causal constraints over 8 iterations in 138 ms. Result :sat
[2020-06-03 10:01:39] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 10:01:39] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 36 ms returned sat
[2020-06-03 10:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:39] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 10:01:39] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 23 ms.
[2020-06-03 10:01:39] [INFO ] Added : 41 causal constraints over 9 iterations in 116 ms. Result :sat
[2020-06-03 10:01:39] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:01:39] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-06-03 10:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:40] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2020-06-03 10:01:40] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:01:40] [INFO ] Added : 41 causal constraints over 9 iterations in 229 ms. Result :sat
[2020-06-03 10:01:40] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 10:01:40] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 44 ms returned sat
[2020-06-03 10:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:40] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2020-06-03 10:01:40] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 10 ms.
[2020-06-03 10:01:40] [INFO ] Added : 19 causal constraints over 4 iterations in 67 ms. Result :sat
[2020-06-03 10:01:41] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:41] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 51 ms returned sat
[2020-06-03 10:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:41] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-03 10:01:41] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:01:41] [INFO ] Added : 48 causal constraints over 10 iterations in 154 ms. Result :sat
[2020-06-03 10:01:41] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:01:41] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 63 ms returned sat
[2020-06-03 10:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:41] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-06-03 10:01:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:01:41] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:01:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:42] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2020-06-03 10:01:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 21 ms.
[2020-06-03 10:01:42] [INFO ] Added : 34 causal constraints over 7 iterations in 125 ms. Result :sat
[2020-06-03 10:01:42] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:01:42] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 45 ms returned sat
[2020-06-03 10:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:42] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-06-03 10:01:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2020-06-03 10:01:42] [INFO ] Added : 19 causal constraints over 4 iterations in 64 ms. Result :sat
[2020-06-03 10:01:42] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
[2020-06-03 10:01:42] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:01:42] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 106 ms returned sat
[2020-06-03 10:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:43] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2020-06-03 10:01:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:43] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 67 ms returned sat
[2020-06-03 10:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:43] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-06-03 10:01:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2020-06-03 10:01:43] [INFO ] Added : 54 causal constraints over 11 iterations in 176 ms. Result :sat
[2020-06-03 10:01:43] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-03 10:01:43] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 32 ms returned sat
[2020-06-03 10:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:43] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2020-06-03 10:01:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2020-06-03 10:01:44] [INFO ] Added : 41 causal constraints over 9 iterations in 116 ms. Result :sat
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 38 ms returned sat
[2020-06-03 10:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2020-06-03 10:01:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:01:44] [INFO ] Added : 40 causal constraints over 8 iterations in 100 ms. Result :sat
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 31 ms returned sat
[2020-06-03 10:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 10:01:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-06-03 10:01:44] [INFO ] Added : 48 causal constraints over 10 iterations in 180 ms. Result :sat
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using 11 positive place invariants in 85 ms returned sat
[2020-06-03 10:01:44] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 31 ms returned sat
[2020-06-03 10:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:45] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2020-06-03 10:01:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-06-03 10:01:45] [INFO ] Added : 40 causal constraints over 8 iterations in 122 ms. Result :sat
[2020-06-03 10:01:45] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-03 10:01:45] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 30 ms returned sat
[2020-06-03 10:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:45] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-03 10:01:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-06-03 10:01:45] [INFO ] Added : 40 causal constraints over 8 iterations in 100 ms. Result :sat
[2020-06-03 10:01:45] [INFO ] [Real]Absence check using 11 positive place invariants in 35 ms returned sat
[2020-06-03 10:01:45] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-06-03 10:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:45] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2020-06-03 10:01:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:01:45] [INFO ] Added : 40 causal constraints over 8 iterations in 91 ms. Result :sat
[2020-06-03 10:01:46] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:01:46] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 47 ms returned sat
[2020-06-03 10:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:46] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2020-06-03 10:01:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:01:46] [INFO ] Added : 48 causal constraints over 10 iterations in 201 ms. Result :sat
[2020-06-03 10:01:46] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 10:01:46] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 42 ms returned sat
[2020-06-03 10:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:46] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2020-06-03 10:01:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 10:01:46] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 50 ms returned sat
[2020-06-03 10:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:46] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-06-03 10:01:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:01:47] [INFO ] Added : 40 causal constraints over 8 iterations in 74 ms. Result :sat
[2020-06-03 10:01:47] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:01:47] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-06-03 10:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:47] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-03 10:01:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:47] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-06-03 10:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:47] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2020-06-03 10:01:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:01:47] [INFO ] Added : 25 causal constraints over 5 iterations in 63 ms. Result :sat
[2020-06-03 10:01:47] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 10:01:47] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-06-03 10:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:47] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2020-06-03 10:01:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:01:47] [INFO ] Added : 49 causal constraints over 10 iterations in 105 ms. Result :sat
[2020-06-03 10:01:47] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 10:01:48] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-06-03 10:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:48] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-03 10:01:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:01:48] [INFO ] Added : 47 causal constraints over 10 iterations in 130 ms. Result :sat
[2020-06-03 10:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-03 10:01:48] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 34 ms returned sat
[2020-06-03 10:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:48] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2020-06-03 10:01:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:01:48] [INFO ] Added : 46 causal constraints over 10 iterations in 137 ms. Result :sat
[2020-06-03 10:01:48] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:48] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-06-03 10:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2020-06-03 10:01:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:01:49] [INFO ] Added : 46 causal constraints over 10 iterations in 105 ms. Result :sat
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-06-03 10:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-06-03 10:01:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:01:49] [INFO ] Added : 49 causal constraints over 10 iterations in 92 ms. Result :sat
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 35 ms returned sat
[2020-06-03 10:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-06-03 10:01:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-06-03 10:01:49] [INFO ] Added : 47 causal constraints over 10 iterations in 119 ms. Result :sat
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-03 10:01:49] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 36 ms returned sat
[2020-06-03 10:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:50] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2020-06-03 10:01:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2020-06-03 10:01:50] [INFO ] Added : 46 causal constraints over 10 iterations in 131 ms. Result :sat
[2020-06-03 10:01:50] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:01:50] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 41 ms returned sat
[2020-06-03 10:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:50] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 10:01:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 23 ms.
[2020-06-03 10:01:50] [INFO ] Added : 41 causal constraints over 9 iterations in 99 ms. Result :sat
[2020-06-03 10:01:50] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 10:01:50] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 63 ms returned sat
[2020-06-03 10:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:50] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2020-06-03 10:01:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2020-06-03 10:01:51] [INFO ] Added : 20 causal constraints over 4 iterations in 57 ms. Result :sat
[2020-06-03 10:01:51] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 10:01:51] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 57 ms returned sat
[2020-06-03 10:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:51] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2020-06-03 10:01:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:01:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:51] [INFO ] [Nat]Absence check using 11 positive and 144 generalized place invariants in 40 ms returned sat
[2020-06-03 10:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:51] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-06-03 10:01:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2020-06-03 10:01:51] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
[2020-06-03 10:01:51] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 10:01:51] [INFO ] [Real]Absence check using 11 positive and 144 generalized place invariants in 43 ms returned sat
[2020-06-03 10:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:01:51] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2020-06-03 10:01:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2020-06-03 10:01:51] [INFO ] Added : 11 causal constraints over 3 iterations in 53 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 10:01:52] [INFO ] Flatten gal took : 94 ms
[2020-06-03 10:01:52] [INFO ] Flatten gal took : 29 ms
[2020-06-03 10:01:52] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-03 10:01:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ QuasiCertifProtocol-COL-06 @ 3570 seconds

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

FORMULA QuasiCertifProtocol-COL-06-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3511
rslt: Output for CTLFireability @ 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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 10:01:52 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EG(AF((1 <= p257)))",
"processed_size": 19,
"rewrites": 130
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(AX(EF((1 <= p256))))",
"processed_size": 23,
"rewrites": 131
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 28193404,
"markings": 2271960,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "AG(EX(((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0))))",
"processed_size": 133,
"rewrites": 130
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 62,
"markings": 63,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 7,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((1 <= p257) AND ((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)))",
"processed_size": 251,
"rewrites": 128
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 706
},
"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 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))",
"processed_size": 125,
"rewrites": 128
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 22,
"aneg": 0,
"comp": 57,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 57,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "(((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 ((p259 <= 0) AND ((p0 <= 0) OR (p216 <= 0)) AND ((p0 <= 0) OR (p217 <= 0)) AND ((p0 <= 0) OR (p218 <= 0)) AND ((p0 <= 0) OR (p219 <= 0)) AND ((p0 <= 0) OR (p220 <= 0)) AND ((p0 <= 0) OR (p214 <= 0)) AND ((p0 <= 0) OR (p215 <= 0))) 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 ((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": 927,
"rewrites": 128
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1177
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (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": 229,
"rewrites": 129
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 63
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 7
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1766
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (G (((((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 (1 <= p257))))",
"processed_size": 247,
"rewrites": 129
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 66
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 897,
"problems": 129
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 14,
"adisj": 1,
"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": "E (G ((((1 <= p0) AND (1 <= p207)) OR ((1 <= p0) AND (1 <= p208)) OR ((1 <= p0) AND (1 <= p209)) OR ((1 <= p0) AND (1 <= p210)) OR ((1 <= p0) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p212)) OR ((1 <= p0) AND (1 <= p213)) OR ((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <= p220)) OR ((1 <= p0) AND (1 <= p214)) OR ((1 <= p0) AND (1 <= p215)))))",
"processed_size": 453,
"rewrites": 129
},
"result":
{
"edges": 65422,
"markings": 14709,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 63
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p259 <= 0)))",
"processed_size": 19,
"rewrites": 129
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (G ((p258 <= 0)))",
"processed_size": 19,
"rewrites": 129
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((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": 221,
"rewrites": 132
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 7
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 392
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p151 <= 0) OR (p152 <= 0) OR (p153 <= 0) OR (p154 <= 0) OR (p155 <= 0) OR (p156 <= 0) OR (p157 <= 0) OR (p256 <= 0))",
"processed_size": 125,
"rewrites": 131
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((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": 860,
"rewrites": 131
},
"result":
{
"edges": 54,
"markings": 55,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 56,
"problems": 7
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 2,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A(AG((((p0 <= 0) OR (p207 <= 0)) AND ((p0 <= 0) OR (p208 <= 0)) AND ((p0 <= 0) OR (p209 <= 0)) AND ((p0 <= 0) OR (p210 <= 0)) AND ((p0 <= 0) OR (p211 <= 0)) AND ((p0 <= 0) OR (p212 <= 0)) AND ((p0 <= 0) OR (p213 <= 0)))) R ((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0)))",
"processed_size": 356,
"rewrites": 130
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 16,
"markings": 9,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 8,
"aneg": 3,
"comp": 29,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 29,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "EF((AF((((p0 <= 0) OR (p207 <= 0)) AND ((p0 <= 0) OR (p208 <= 0)) AND ((p0 <= 0) OR (p209 <= 0)) AND ((p0 <= 0) OR (p210 <= 0)) AND ((p0 <= 0) OR (p211 <= 0)) AND ((p0 <= 0) OR (p212 <= 0)) AND ((p0 <= 0) OR (p213 <= 0)))) AND ((1 <= p256) AND (((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <= p220)) OR ((1 <= p0) AND (1 <= p214)) OR ((1 <= p0) AND (1 <= p215))))))",
"processed_size": 475,
"rewrites": 130
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 18341858,
"markings": 2271960,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 702
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "AF((AF((((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 (EF(((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 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258)))))",
"processed_size": 1181,
"rewrites": 131
},
"net":
{
"conflict_clusters": 32,
"singleton_clusters": 0
},
"result":
{
"edges": 56,
"markings": 38,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 878
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <= p220)) OR ((1 <= p0) AND (1 <= p214)) OR ((1 <= p0) AND (1 <= p215)))",
"processed_size": 215,
"rewrites": 139
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1170
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": 14,
"visible_transitions": 0
},
"processed": "(((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)))",
"processed_size": 235,
"rewrites": 131
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 14,
"problems": 7
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1756
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p258)",
"processed_size": 11,
"rewrites": 131
},
"result":
{
"edges": 93622,
"markings": 16950,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1756
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"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": 7,
"visible_transitions": 0
},
"processed": "(F (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248))) U ((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248)))",
"processed_size": 227,
"rewrites": 137
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3512
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((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": 215,
"rewrites": 139
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((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": 215,
"rewrites": 139
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"comp": 58,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 58,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 57,
"visible_transitions": 0
},
"processed": "E (G (((((p4 <= 0) OR (p11 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p46 <= 0) OR (p193 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR (p31 <= 0) OR (p38 <= 0) OR (p45 <= 0) OR (p52 <= 0) OR (p199 <= 0)) AND ((p9 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p30 <= 0) OR (p37 <= 0) OR (p44 <= 0) OR (p51 <= 0) OR (p198 <= 0)) AND ((p8 <= 0) OR (p15 <= 0) OR (p22 <= 0) OR (p29 <= 0) OR (p36 <= 0) OR (p43 <= 0) OR (p50 <= 0) OR (p197 <= 0)) AND ((p7 <= 0) OR (p14 <= 0) OR (p21 <= 0) OR (p28 <= 0) OR (p35 <= 0) OR (p42 <= 0) OR (p49 <= 0) OR (p196 <= 0)) AND ((p6 <= 0) OR (p13 <= 0) OR (p20 <= 0) OR (p27 <= 0) OR (p34 <= 0) OR (p41 <= 0) OR (p48 <= 0) OR (p195 <= 0)) AND ((p5 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p26 <= 0) OR (p33 <= 0) OR (p40 <= 0) OR (p47 <= 0) OR (p194 <= 0)) AND (p259 <= 0)) OR (1 <= p259))))",
"processed_size": 894,
"rewrites": 129
},
"result":
{
"edges": 18,
"markings": 19,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 115492,
"runtime": 59.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G(*)) : (E(G(A(F(**)))) AND A(X(**))) : A(G(E(F(**)))) : A(F(A(X(E(F(**)))))) : E(F((A(F(*)) AND (* AND *)))) : (A(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))) : A((A(G(*)) R *)) : E((E(G(*)) R *)) : A(F((A(F(**)) OR (E(F(**)) OR **)))) : (E(F(E(G(**)))) OR **) : (E(G(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))) : E(G(*)) : A(G(A(F(**)))) : A(G(E(X(*)))) : (E(G(*)) AND ((E(G(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (E(G(**)) AND A(X(**))))))))))))) AND **)) : A(F(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "yes no no yes no no no yes yes no yes yes no no no no ",
"value": "yes no no yes no no no yes yes no yes yes 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 CTLFireability.xml
lola: NOT(A (F ((1 <= p259)))) : (E (G (A (F ((1 <= p257))))) AND A (X ((((p231 <= 0) AND (p230 <= 0) AND (p229 <= 0) AND (p228 <= 0) AND (p234 <= 0) AND (p233 <= 0) AND (p232 <= 0)) OR ((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)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256)))))) : A (G (A (G (E (F ((((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))))))))) : A (F (A (X (E (F ((1 <= p256))))))) : NOT(A (G (((E (G ((((1 <= p0) AND (1 <= p207)) OR ((1 <= p0) AND (1 <= p208)) OR ((1 <= p0) AND (1 <= p209)) OR ((1 <= p0) AND (1 <= p210)) OR ((1 <= p0) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p212)) OR ((1 <= p0) AND (1 <= p213))))) OR (p256 <= 0)) OR (((p0 <= 0) OR (p216 <= 0)) AND ((p0 <= 0) OR (p217 <= 0)) AND ((p0 <= 0) OR (p218 <= 0)) AND ((p0 <= 0) OR (p219 <= 0)) AND ((p0 <= 0) OR (p220 <= 0)) AND ((p0 <= 0) OR (p214 <= 0)) AND ((p0 <= 0) OR (p215 <= 0))))))) : (((((((A (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))))) OR ((1 <= p0) AND (1 <= p216))) OR ((1 <= p0) AND (1 <= p217))) OR ((1 <= p0) AND (1 <= p218))) OR ((1 <= p0) AND (1 <= p219))) OR ((1 <= p0) AND (1 <= p220))) OR ((1 <= p0) AND (1 <= p214))) OR ((1 <= p0) AND (1 <= p215))) : NOT(E ((E (F ((((1 <= p0) AND (1 <= p207)) OR ((1 <= p0) AND (1 <= p208)) OR ((1 <= p0) AND (1 <= p209)) OR ((1 <= p0) AND (1 <= p210)) OR ((1 <= p0) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p212)) OR ((1 <= p0) AND (1 <= p213))))) U ((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260))))) : NOT(A ((A (F (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248)))) U ((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248))))) : A (F (((A (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))))) OR E (F (((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 <= p165) AND (1 <= p166) AND (1 <= p167) AND (1 <= p168) AND (1 <= p169) AND (1 <= p170) AND (1 <= p171) AND (1 <= p258))))) : (E (F (E (G ((1 <= p258))))) OR (1 <= p257)) : (((((((NOT(A (F (((((1 <= p4) AND (1 <= p11) AND (1 <= p18) AND (1 <= p25) AND (1 <= p32) AND (1 <= p39) AND (1 <= p46) AND (1 <= p193)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p24) AND (1 <= p31) AND (1 <= p38) AND (1 <= p45) AND (1 <= p52) AND (1 <= p199)) OR ((1 <= p9) AND (1 <= p16) AND (1 <= p23) AND (1 <= p30) AND (1 <= p37) AND (1 <= p44) AND (1 <= p51) AND (1 <= p198)) OR ((1 <= p8) AND (1 <= p15) AND (1 <= p22) AND (1 <= p29) AND (1 <= p36) AND (1 <= p43) AND (1 <= p50) AND (1 <= p197)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p21) AND (1 <= p28) AND (1 <= p35) AND (1 <= p42) AND (1 <= p49) AND (1 <= p196)) OR ((1 <= p6) AND (1 <= p13) AND (1 <= p20) AND (1 <= p27) AND (1 <= p34) AND (1 <= p41) AND (1 <= p48) AND (1 <= p195)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p19) AND (1 <= p26) AND (1 <= p33) AND (1 <= p40) AND (1 <= p47) AND (1 <= p194)) OR (1 <= p259)) AND (p259 <= 0))))) OR ((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(A (F ((1 <= p258)))) : A (G (A (F ((((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))))))) : A (G (NOT(A (X (((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260))))))) : ((NOT(A (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)))))) AND ((((((((((E (G ((((1 <= p0) AND (1 <= p207)) OR ((1 <= p0) AND (1 <= p208)) OR ((1 <= p0) AND (1 <= p209)) OR ((1 <= p0) AND (1 <= p210)) OR ((1 <= p0) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p212)) OR ((1 <= p0) AND (1 <= p213)) OR ((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <= p220)) OR ((1 <= p0) AND (1 <= p214)) OR ((1 <= p0) AND (1 <= p215))))) OR (1 <= p244)) OR (1 <= p245)) OR (1 <= p246)) OR (1 <= p247)) OR (1 <= p242)) OR (1 <= p243)) OR (1 <= p248)) OR ((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))) OR ((1 <= p257) AND ((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)))) OR (E (G (((((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 (1 <= p257)))) AND A (X ((((1 <= p179) AND (1 <= p180) AND (1 <= p181) AND (1 <= p182) AND (1 <= p183) AND (1 <= p184) AND (1 <= p185) AND (1 <= p260)) OR ((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 <= 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 ((p259 <= 0) AND ((p0 <= 0) OR (p216 <= 0)) AND ((p0 <= 0) OR (p217 <= 0)) AND ((p0 <= 0) OR (p218 <= 0)) AND ((p0 <= 0) OR (p219 <= 0)) AND ((p0 <= 0) OR (p220 <= 0)) AND ((p0 <= 0) OR (p214 <= 0)) AND ((p0 <= 0) OR (p215 <= 0))) 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 ((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))))) : A ((E (G (((1 <= p259) OR (1 <= p256)))) U A (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: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:323
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((1 <= p257))))) AND A (X ((((p231 <= 0) AND (p230 <= 0) AND (p229 <= 0) AND (p228 <= 0) AND (p234 <= 0) AND (p233 <= 0) AND (p232 <= 0)) OR ((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)) OR ((1 <= p151) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((1 <= p257)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF((1 <= p257)))
lola: processed formula length: 19
lola: 130 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (E (F ((1 <= p256)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(EF((1 <= p256))))
lola: processed formula length: 23
lola: 131 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 764156 markings, 4868735 edges, 152831 markings/sec, 0 secs
lola: 1458651 markings, 9602483 edges, 138899 markings/sec, 5 secs
lola: 1458651 markings, 14035644 edges, 0 markings/sec, 10 secs
lola: 1697817 markings, 18164654 edges, 47833 markings/sec, 15 secs
lola: 1948495 markings, 22583473 edges, 50136 markings/sec, 20 secs
lola: 2219775 markings, 27242051 edges, 54256 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2271960 markings, 28193404 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0))))
lola: processed formula length: 133
lola: 130 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 63 markings, 62 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (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))))) AND ((E (G ((((1 <= p0) AND (1 <= p207)) OR ((1 <= p0) AND (1 <= p208)) OR ((1 <= p0) AND (1 <= p209)) OR ((1 <= p0) AND (1 <= p210)) OR ((1 <= p0) AND (1 <= p211)) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p257) AND ((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)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p257) AND ((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)))
lola: processed formula length: 251
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 15 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p248)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p248)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p243)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p243)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p242)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p242)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p247)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p247)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p246)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p246)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p245)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p245)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p244)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p244)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((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 initial satisfaction
lola: processed formula: ((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: 125
lola: 128 rewrites
lola: closed formula file CTLFireability.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: subprocess 12 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((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 ((p259 <= 0) AND ((p0 <= 0) OR (p216 <= 0)) AND ((p0 <= 0) OR (p217 <= 0)) AND ((p0 <= 0) OR (p218 <= 0)) AND ((p0 <= 0) OR (p219 <= 0)) AND ((p0 <= 0) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((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 ((p259 <= 0) AND ((p0 <= 0) OR (p216 <= 0)) AND ((p0 <= 0) OR (p217 <= 0)) AND ((p0 <= 0) OR (p218 <= 0)) AND ((p0 <= 0) OR (p219 <= 0)) AND ((p0 <= 0) OR (... (shortened)
lola: processed formula length: 927
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 57 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 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (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 possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (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: 229
lola: 129 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: The predicate is possibly preserved.
lola: state equation task get result unparse finished++ id 0
lola: 23 markings, 22 edges
lola: formula 0: (((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)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 7 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((((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 (1 <= p257))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((((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 (1 <= p257))))
lola: processed formula length: 247
lola: 129 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((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))) OR (p257 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 897 literals and 129 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p0) AND (1 <= p207)) OR ((1 <= p0) AND (1 <= p208)) OR ((1 <= p0) AND (1 <= p209)) OR ((1 <= p0) AND (1 <= p210)) OR ((1 <= p0) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p212)) OR ((1 <= p0) AND (1 <= p213)) OR ((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <= p220)) OR ((1 <= p0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p0) AND (1 <= p207)) OR ((1 <= p0) AND (1 <= p208)) OR ((1 <= p0) AND (1 <= p209)) OR ((1 <= p0) AND (1 <= p210)) OR ((1 <= p0) AND (1 <= p211)) OR ((1 <= p0) AND (1 <= p212)) OR ((1 <= p0) AND (1 <= p213)) OR ((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <= p220)) OR ((1 <= p0... (shortened)
lola: processed formula length: 453
lola: 129 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p0 <= 0) OR (p207 <= 0)) AND ((p0 <= 0) OR (p208 <= 0)) AND ((p0 <= 0) OR (p209 <= 0)) AND ((p0 <= 0) OR (p210 <= 0)) AND ((p0 <= 0) OR (p211 <= 0)) AND ((p0 <= 0) OR (p212 <= 0)) AND ((p0 <= 0) OR (p213 <= 0)) AND ((p0 <= 0) OR (p216 <= 0)) AND ((p0 <= 0) OR (p217 <= 0)) AND ((p0 <= 0) OR (p218 <= 0)) AND ((p0 <= 0) OR (p219 <= 0)) AND ((p0 <= 0) OR (p220 <= 0)) AND ((p0 <= 0) OR (p214 <= 0)) AND ((p0 <= 0) OR (p215 <= 0)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 14709 markings, 65422 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p259 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p259 <= 0)))
lola: processed formula length: 19
lola: 129 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p259)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p258 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p258 <= 0)))
lola: processed formula length: 19
lola: 129 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 14 markings, 13 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p258)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((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: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((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: 221
lola: 132 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((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: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 7 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((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: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 19 markings, 18 edges
sara: try reading problem file CTLFireability-5-0.sara.
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (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 eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p151 <= 0) OR (p152 <= 0) OR (p153 <= 0) OR (p154 <= 0) OR (p155 <= 0) OR (p156 <= 0) OR (p157 <= 0) OR (p256 <= 0))
lola: processed formula length: 125
lola: 131 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 18 edges
sara: place or transition ordering is non-deterministiclola:
rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p151) AND (1 <= p152) AND (1 <= p153) AND (1 <= p154) AND (1 <= p155) AND (1 <= p156) AND (1 <= p157) AND (1 <= p256))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas

lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((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 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (((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) A... (shortened)
lola: processed formula length: 860
lola: 131 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p60 <= 0) OR (p61 <= 0) OR (p62 <= 0) OR (p63 <= 0) OR (p64 <= 0) OR (p65 <= 0) OR (p66 <= 0) OR (p236 <= 0)) AND ((p95 <= 0) OR (p96 <= 0) OR (p97 <= 0) OR (p98 <= 0) OR (p99 <= 0) OR (p100 <= 0) OR (p101 <= 0) OR (p241 <= 0)) AND ((p81 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0) OR (p86 <= 0) OR (p87 <= 0) OR (p239 <= 0)) AND ((p67 <= 0) OR (p68 <= 0) OR (p69 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0) OR (p237 <= 0)) AND ((p88 <= 0) OR (p89 <= 0) OR (p90 <= 0) OR (p91 <= 0) OR (p92 <= 0) OR (p93 <= 0) OR (p94 <= 0) OR (p240 <= 0)) AND ((p53 <= 0) OR (p54 <= 0) OR (p55 <= 0) OR (p56 <= 0) OR (p57 <= 0) OR (p58 <= 0) OR (p59 <= 0) OR (p235 <= 0)) AND ((p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p238 <= 0)))
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 55 markings, 54 edges
lola: formula 1: (((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)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 56 literals and 7 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((((p0 <= 0) OR (p207 <= 0)) AND ((p0 <= 0) OR (p208 <= 0)) AND ((p0 <= 0) OR (p209 <= 0)) AND ((p0 <= 0) OR (p210 <= 0)) AND ((p0 <= 0) OR (p211 <= 0)) AND ((p0 <= 0) OR (p212 <= 0)) AND ((p0 <= 0) OR (p213 <= 0))))) R ((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(AG((((p0 <= 0) OR (p207 <= 0)) AND ((p0 <= 0) OR (p208 <= 0)) AND ((p0 <= 0) OR (p209 <= 0)) AND ((p0 <= 0) OR (p210 <= 0)) AND ((p0 <= 0) OR (p211 <= 0)) AND ((p0 <= 0) OR (p212 <= 0)) AND ((p0 <= 0) OR (p213 <= 0)))) R ((p179 <= 0) OR (p180 <= 0) OR (p181 <= 0) OR (p182 <= 0) OR (p183 <= 0) OR (p184 <= 0) OR (p185 <= 0) OR (p260 <= 0)))
lola: processed formula length: 356
lola: 130 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((((p0 <= 0) OR (p207 <= 0)) AND ((p0 <= 0) OR (p208 <= 0)) AND ((p0 <= 0) OR (p209 <= 0)) AND ((p0 <= 0) OR (p210 <= 0)) AND ((p0 <= 0) OR (p211 <= 0)) AND ((p0 <= 0) OR (p212 <= 0)) AND ((p0 <= 0) OR (p213 <= 0))))) AND ((1 <= p256) AND (((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AF((((p0 <= 0) OR (p207 <= 0)) AND ((p0 <= 0) OR (p208 <= 0)) AND ((p0 <= 0) OR (p209 <= 0)) AND ((p0 <= 0) OR (p210 <= 0)) AND ((p0 <= 0) OR (p211 <= 0)) AND ((p0 <= 0) OR (p212 <= 0)) AND ((p0 <= 0) OR (p213 <= 0)))) AND ((1 <= p256) AND (((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <=... (shortened)
lola: processed formula length: 475
lola: 130 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 574826 markings, 4265120 edges, 114965 markings/sec, 0 secs
lola: 1094850 markings, 8404291 edges, 104005 markings/sec, 5 secs
lola: 1591687 markings, 12786085 edges, 99367 markings/sec, 10 secs
lola: 2150753 markings, 17380478 edges, 111813 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2271960 markings, 18341858 edges
lola: ========================================
lola: subprocess 11 will run for 702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (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)) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AF((((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: 1181
lola: 131 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 38 markings, 56 edges
lola: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (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))))) OR (((1 <= p0) AND (1 <= p216)) OR (((1 <= p0) AND (1 <= p217)) OR (((1 <= p0) AND (1 <= p218)) OR (((1 <= p0) AND (1 <= p219)) OR (((1 <= p0) AND (1 <= p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) AND (1 <= p216)) OR (((1 <= p0) AND (1 <= p217)) OR (((1 <= p0) AND (1 <= p218)) OR (((1 <= p0) AND (1 <= p219)) OR (((1 <= p0) AND (1 <= p220)) OR (((1 <= p0) AND (1 <= p214)) OR ((1 <= p0) AND (1 <= p215))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p0) AND (1 <= p216)) OR ((1 <= p0) AND (1 <= p217)) OR ((1 <= p0) AND (1 <= p218)) OR ((1 <= p0) AND (1 <= p219)) OR ((1 <= p0) AND (1 <= p220)) OR ((1 <= p0) AND (1 <= p214)) OR ((1 <= p0) AND (1 <= p215)))
lola: processed formula length: 215
lola: 139 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 14 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 13 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (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)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((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)))
lola: processed formula length: 235
lola: 131 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((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)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 14 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((1 <= p258))))) OR (1 <= p257))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p257)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p257)
lola: processed formula length: 11
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1756 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= p258)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (1 <= p258)
lola: processed formula length: 11
lola: 131 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p258 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p258)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 16950 markings, 93622 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1756 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0)))) R ((p244 <= 0) AND (p245 <= 0) AND (p246 <= 0) AND (p247 <= 0) AND (p242 <= 0) AND (p243 <= 0) AND (p248 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248))) U ((1 <= p244) OR (1 <= p245) OR (1 <= p246) OR (1 <= p247) OR (1 <= p242) OR (1 <= p243) OR (1 <= p248)))
lola: processed formula length: 227
lola: 137 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 15 will run for 3512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((((p4 <= 0) OR (p11 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p46 <= 0) OR (p193 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR (p31 <= 0) OR (p38 <= 0) OR (p45 <= 0) OR (p52 <= 0) OR (p199 <= 0)) AND ((p9 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p30 <= 0) OR (p37 <= 0) OR (p44 <= 0) OR (p51 <= 0) OR (p198 <= 0)) AND ((p8 <= 0) OR (p15 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3512 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((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))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((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)))
lola: processed formula length: 215
lola: 139 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 14 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (((((p4 <= 0) OR (p11 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p46 <= 0) OR (p193 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR (p31 <= 0) OR (p38 <= 0) OR (p45 <= 0) OR (p52 <= 0) OR (p199 <= 0)) AND ((p9 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p30 <= 0) OR (p37 <= 0) OR (p44 <= 0) OR (p51 <= 0) OR (p198 <= 0)) AND ((p8 <= 0) OR (p15 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((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))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((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)))
lola: processed formula length: 215
lola: 139 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 14 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: ========================================
lola: ...considering subproblem: E (G (((((p4 <= 0) OR (p11 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p46 <= 0) OR (p193 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR (p31 <= 0) OR (p38 <= 0) OR (p45 <= 0) OR (p52 <= 0) OR (p199 <= 0)) AND ((p9 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p30 <= 0) OR (p37 <= 0) OR (p44 <= 0) OR (p51 <= 0) OR (p198 <= 0)) AND ((p8 <= 0) OR (p15 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((((p4 <= 0) OR (p11 <= 0) OR (p18 <= 0) OR (p25 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p46 <= 0) OR (p193 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p24 <= 0) OR (p31 <= 0) OR (p38 <= 0) OR (p45 <= 0) OR (p52 <= 0) OR (p199 <= 0)) AND ((p9 <= 0) OR (p16 <= 0) OR (p23 <= 0) OR (p30 <= 0) OR (p37 <= 0) OR (p44 <= 0) OR (p51 <= 0) OR (p198 <= 0)) AND ((p8 <= 0) OR (p15 <= 0)... (shortened)
lola: processed formula length: 894
lola: 129 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 19 markings, 18 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p4) AND (1 <= p11) AND (1 <= p18) AND (1 <= p25) AND (1 <= p32) AND (1 <= p39) AND (1 <= p46) AND (1 <= p193)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p24) AND (1 <= p31) AND (1 <= p38) AND (1 <= p45) AND (1 <= p52) AND (1 <= p199)) OR ((1 <= p9) AND (1 <= p16) AND (1 <= p23) AND (1 <= p30) AND (1 <= p37) AND (1 <= p44) AND (1 <= p51) AND (1 <= p198)) OR ((1 <= p8) AND (1 <= p15) AND (1 <= p22) AND (1 <= p29) AND (1 <= p36) AND (1 <= p43) AND (1 <= p50) AND (1 <= p197)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p21) AND (1 <= p28) AND (1 <= p35) AND (1 <= p42) AND (1 <= p49) AND (1 <= p196)) OR ((1 <= p6) AND (1 <= p13) AND (1 <= p20) AND (1 <= p27) AND (1 <= p34) AND (1 <= p41) AND (1 <= p48) AND (1 <= p195)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p19) AND (1 <= p26) AND (1 <= p33) AND (1 <= p40) AND (1 <= p47) AND (1 <= p194)) OR (1 <= p259)) AND (p259 <= 0))
lola: lola: SUBRESULT
========================================lola:
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no yes yes no yes yes no no no no
lola:
preliminary result: yes no no yes no no no yes yes no yes yes no no no no
lola: memory consumption: 115492 KB
lola: time consumption: 59 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="CTLFireability"
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 CTLFireability"
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-158987872300732"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;