Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853500668.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Peterson-COL-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853500668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 43K Apr 27 15:14 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 Peterson-COL-3-CTLFireability-00
FORMULA_NAME Peterson-COL-3-CTLFireability-01
FORMULA_NAME Peterson-COL-3-CTLFireability-02
FORMULA_NAME Peterson-COL-3-CTLFireability-03
FORMULA_NAME Peterson-COL-3-CTLFireability-04
FORMULA_NAME Peterson-COL-3-CTLFireability-05
FORMULA_NAME Peterson-COL-3-CTLFireability-06
FORMULA_NAME Peterson-COL-3-CTLFireability-07
FORMULA_NAME Peterson-COL-3-CTLFireability-08
FORMULA_NAME Peterson-COL-3-CTLFireability-09
FORMULA_NAME Peterson-COL-3-CTLFireability-10
FORMULA_NAME Peterson-COL-3-CTLFireability-11
FORMULA_NAME Peterson-COL-3-CTLFireability-12
FORMULA_NAME Peterson-COL-3-CTLFireability-13
FORMULA_NAME Peterson-COL-3-CTLFireability-14
FORMULA_NAME Peterson-COL-3-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591162543642

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:35:46] [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 05:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:35:46] [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 05:35:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 870 ms
[2020-06-03 05:35:47] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-06-03 05:35:47] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 142 ms.
[2020-06-03 05:35:47] [INFO ] Computed order based on color domains.
[2020-06-03 05:35:47] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 26 ms.
[2020-06-03 05:35:47] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 24 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 83 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 648 ms. (steps per millisecond=154 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1]
[2020-06-03 05:35:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:35:48] [INFO ] Computed 15 place invariants in 12 ms
[2020-06-03 05:35:48] [INFO ] [Real]Absence check using 11 positive place invariants in 43 ms returned sat
[2020-06-03 05:35:48] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 13 ms returned sat
[2020-06-03 05:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:49] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2020-06-03 05:35:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:35:49] [INFO ] [Real]Added 66 Read/Feed constraints in 33 ms returned sat
[2020-06-03 05:35:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 171 ms returned sat
[2020-06-03 05:35:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 05:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:49] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2020-06-03 05:35:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 20 places in 188 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 13 places in 273 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 56 places in 175 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 27 places in 154 ms
[2020-06-03 05:35:50] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 17 places in 120 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 14 places in 101 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 53 places in 60 ms
[2020-06-03 05:35:51] [INFO ] Deduced a trap composed of 57 places in 67 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 57 places in 120 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 53 places in 68 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 52 places in 108 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 31 places in 65 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 34 places in 68 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 27 places in 96 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 31 places in 102 ms
[2020-06-03 05:35:52] [INFO ] Deduced a trap composed of 35 places in 104 ms
[2020-06-03 05:35:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2930 ms
[2020-06-03 05:35:52] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 26 ms.
[2020-06-03 05:35:54] [INFO ] Added : 303 causal constraints over 61 iterations in 2033 ms. Result :sat
[2020-06-03 05:35:55] [INFO ] [Real]Absence check using 11 positive place invariants in 63 ms returned sat
[2020-06-03 05:35:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 56 ms returned sat
[2020-06-03 05:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:55] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2020-06-03 05:35:55] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:35:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:35:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 05:35:55] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:35:56] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2020-06-03 05:35:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 20 places in 221 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 49 places in 73 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 16 places in 72 ms
[2020-06-03 05:35:56] [INFO ] Deduced a trap composed of 84 places in 175 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 57 places in 94 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 56 places in 60 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 51 places in 148 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 57 places in 73 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 55 places in 100 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 9 places in 70 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 51 places in 93 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 26 places in 64 ms
[2020-06-03 05:35:57] [INFO ] Deduced a trap composed of 38 places in 71 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 38 places in 83 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 46 places in 106 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 43 places in 64 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 37 places in 96 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 34 places in 56 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 39 places in 64 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 31 places in 64 ms
[2020-06-03 05:35:58] [INFO ] Deduced a trap composed of 51 places in 69 ms
[2020-06-03 05:35:58] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2606 ms
[2020-06-03 05:35:58] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 25 ms.
[2020-06-03 05:36:00] [INFO ] Added : 279 causal constraints over 56 iterations in 1445 ms. Result :sat
[2020-06-03 05:36:00] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 05:36:00] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:00] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2020-06-03 05:36:00] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:36:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 05:36:00] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 19 ms returned sat
[2020-06-03 05:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:01] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2020-06-03 05:36:01] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 33 places in 81 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 17 places in 98 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 36 places in 119 ms
[2020-06-03 05:36:01] [INFO ] Deduced a trap composed of 30 places in 77 ms
[2020-06-03 05:36:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 739 ms
[2020-06-03 05:36:01] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 27 ms.
[2020-06-03 05:36:03] [INFO ] Added : 304 causal constraints over 61 iterations in 1665 ms. Result :sat
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 50 places in 128 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 54 places in 105 ms
[2020-06-03 05:36:03] [INFO ] Deduced a trap composed of 37 places in 149 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 31 places in 126 ms
[2020-06-03 05:36:04] [INFO ] Deduced a trap composed of 56 places in 98 ms
[2020-06-03 05:36:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 864 ms
[2020-06-03 05:36:04] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 05:36:04] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:04] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2020-06-03 05:36:04] [INFO ] [Real]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-06-03 05:36:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:36:04] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:05] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2020-06-03 05:36:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 36 places in 47 ms
[2020-06-03 05:36:05] [INFO ] Deduced a trap composed of 35 places in 60 ms
[2020-06-03 05:36:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2020-06-03 05:36:05] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 56 ms.
[2020-06-03 05:36:06] [INFO ] Added : 304 causal constraints over 61 iterations in 1499 ms. Result :sat
[2020-06-03 05:36:06] [INFO ] Deduced a trap composed of 53 places in 113 ms
[2020-06-03 05:36:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2020-06-03 05:36:06] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:07] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2020-06-03 05:36:07] [INFO ] [Real]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-06-03 05:36:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:36:07] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:07] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2020-06-03 05:36:07] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 33 places in 79 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 35 places in 71 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2020-06-03 05:36:07] [INFO ] Deduced a trap composed of 17 places in 72 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 34 places in 76 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 44 places in 66 ms
[2020-06-03 05:36:08] [INFO ] Deduced a trap composed of 45 places in 61 ms
[2020-06-03 05:36:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 679 ms
[2020-06-03 05:36:08] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-06-03 05:36:09] [INFO ] Added : 304 causal constraints over 61 iterations in 1366 ms. Result :sat
[2020-06-03 05:36:09] [INFO ] Deduced a trap composed of 53 places in 64 ms
[2020-06-03 05:36:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2020-06-03 05:36:09] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:36:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:10] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-03 05:36:10] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:36:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 59 ms returned sat
[2020-06-03 05:36:10] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2020-06-03 05:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:10] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2020-06-03 05:36:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 39 ms returned sat
[2020-06-03 05:36:10] [INFO ] Deduced a trap composed of 16 places in 96 ms
[2020-06-03 05:36:10] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-06-03 05:36:10] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-06-03 05:36:10] [INFO ] Deduced a trap composed of 27 places in 77 ms
[2020-06-03 05:36:10] [INFO ] Deduced a trap composed of 27 places in 64 ms
[2020-06-03 05:36:11] [INFO ] Deduced a trap composed of 27 places in 74 ms
[2020-06-03 05:36:11] [INFO ] Deduced a trap composed of 45 places in 105 ms
[2020-06-03 05:36:11] [INFO ] Deduced a trap composed of 45 places in 48 ms
[2020-06-03 05:36:11] [INFO ] Deduced a trap composed of 45 places in 49 ms
[2020-06-03 05:36:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 799 ms
[2020-06-03 05:36:11] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-06-03 05:36:12] [INFO ] Added : 304 causal constraints over 61 iterations in 1377 ms. Result :sat
[2020-06-03 05:36:12] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:12] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:13] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2020-06-03 05:36:13] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:36:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-06-03 05:36:13] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:13] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2020-06-03 05:36:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 23 ms returned sat
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 16 places in 60 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 9 places in 45 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 34 places in 47 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 17 places in 58 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 35 places in 61 ms
[2020-06-03 05:36:13] [INFO ] Deduced a trap composed of 27 places in 46 ms
[2020-06-03 05:36:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 408 ms
[2020-06-03 05:36:13] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 12 ms.
[2020-06-03 05:36:14] [INFO ] Added : 265 causal constraints over 53 iterations in 1113 ms. Result :sat
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 14 places in 116 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 42 places in 74 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 37 places in 71 ms
[2020-06-03 05:36:15] [INFO ] Deduced a trap composed of 42 places in 68 ms
[2020-06-03 05:36:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 549 ms
[2020-06-03 05:36:15] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:36:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 05:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:15] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2020-06-03 05:36:15] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 05:36:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 05:36:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 05:36:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:16] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2020-06-03 05:36:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 56 places in 94 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 16 places in 91 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 51 places in 80 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 38 places in 90 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 13 places in 73 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 17 places in 67 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 34 places in 65 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 39 places in 68 ms
[2020-06-03 05:36:16] [INFO ] Deduced a trap composed of 56 places in 98 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 47 places in 103 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 16 places in 69 ms
[2020-06-03 05:36:17] [INFO ] Deduced a trap composed of 53 places in 67 ms
[2020-06-03 05:36:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1132 ms
[2020-06-03 05:36:17] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-06-03 05:36:18] [INFO ] Added : 304 causal constraints over 61 iterations in 1418 ms. Result :sat
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 37 places in 95 ms
[2020-06-03 05:36:18] [INFO ] Deduced a trap composed of 53 places in 62 ms
[2020-06-03 05:36:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2020-06-03 05:36:18] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:36:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:19] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2020-06-03 05:36:19] [INFO ] [Real]Added 66 Read/Feed constraints in 7 ms returned sat
[2020-06-03 05:36:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:19] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2020-06-03 05:36:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 59 places in 81 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 38 places in 88 ms
[2020-06-03 05:36:19] [INFO ] Deduced a trap composed of 56 places in 88 ms
[2020-06-03 05:36:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 402 ms
[2020-06-03 05:36:19] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-06-03 05:36:21] [INFO ] Added : 277 causal constraints over 56 iterations in 1395 ms. Result :sat
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 14 places in 86 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 17 places in 90 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 17 places in 97 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 38 places in 68 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-06-03 05:36:21] [INFO ] Deduced a trap composed of 17 places in 100 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2020-06-03 05:36:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 822 ms
[2020-06-03 05:36:22] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 05:36:22] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:22] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2020-06-03 05:36:22] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:36:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 05:36:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:22] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2020-06-03 05:36:22] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 59 places in 115 ms
[2020-06-03 05:36:22] [INFO ] Deduced a trap composed of 52 places in 98 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 38 places in 81 ms
[2020-06-03 05:36:23] [INFO ] Deduced a trap composed of 56 places in 84 ms
[2020-06-03 05:36:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 435 ms
[2020-06-03 05:36:23] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-06-03 05:36:24] [INFO ] Added : 277 causal constraints over 56 iterations in 1514 ms. Result :sat
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 9 places in 123 ms
[2020-06-03 05:36:24] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2020-06-03 05:36:25] [INFO ] Deduced a trap composed of 29 places in 96 ms
[2020-06-03 05:36:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2020-06-03 05:36:25] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2020-06-03 05:36:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:25] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-06-03 05:36:25] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:36:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 05:36:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:25] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2020-06-03 05:36:25] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 13 places in 114 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 17 places in 65 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 18 places in 64 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 31 places in 100 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 31 places in 100 ms
[2020-06-03 05:36:26] [INFO ] Deduced a trap composed of 56 places in 93 ms
[2020-06-03 05:36:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 638 ms
[2020-06-03 05:36:26] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-06-03 05:36:27] [INFO ] Added : 302 causal constraints over 61 iterations in 1371 ms. Result :sat
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 30 places in 106 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 49 places in 119 ms
[2020-06-03 05:36:28] [INFO ] Deduced a trap composed of 27 places in 66 ms
[2020-06-03 05:36:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2020-06-03 05:36:28] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 05:36:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:28] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-06-03 05:36:28] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:36:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 05:36:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 13 ms returned sat
[2020-06-03 05:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:29] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2020-06-03 05:36:29] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 13 places in 91 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 18 places in 88 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 37 places in 83 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 54 places in 64 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 51 places in 109 ms
[2020-06-03 05:36:29] [INFO ] Deduced a trap composed of 16 places in 126 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 16 places in 73 ms
[2020-06-03 05:36:30] [INFO ] Deduced a trap composed of 53 places in 87 ms
[2020-06-03 05:36:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1234 ms
[2020-06-03 05:36:30] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-06-03 05:36:31] [INFO ] Added : 272 causal constraints over 55 iterations in 1485 ms. Result :sat
[2020-06-03 05:36:31] [INFO ] Deduced a trap composed of 43 places in 129 ms
[2020-06-03 05:36:32] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2020-06-03 05:36:32] [INFO ] Deduced a trap composed of 31 places in 110 ms
[2020-06-03 05:36:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 434 ms
[2020-06-03 05:36:32] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:36:32] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:32] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2020-06-03 05:36:32] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:36:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 05:36:32] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 9 ms returned sat
[2020-06-03 05:36:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:32] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-06-03 05:36:32] [INFO ] [Nat]Added 66 Read/Feed constraints in 24 ms returned sat
[2020-06-03 05:36:32] [INFO ] Deduced a trap composed of 35 places in 84 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 38 places in 51 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 37 places in 51 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 34 places in 59 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 38 places in 38 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 31 places in 45 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 53 places in 119 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 31 places in 64 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 49 places in 95 ms
[2020-06-03 05:36:33] [INFO ] Deduced a trap composed of 52 places in 104 ms
[2020-06-03 05:36:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1067 ms
[2020-06-03 05:36:33] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 23 ms.
[2020-06-03 05:36:35] [INFO ] Added : 304 causal constraints over 61 iterations in 1277 ms. Result :sat
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 12 places in 61 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 37 places in 77 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2020-06-03 05:36:35] [INFO ] Deduced a trap composed of 53 places in 56 ms
[2020-06-03 05:36:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2020-06-03 05:36:35] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:35] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:35] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-06-03 05:36:35] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:36:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 05:36:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:36] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2020-06-03 05:36:36] [INFO ] [Nat]Added 66 Read/Feed constraints in 21 ms returned sat
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 35 places in 54 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 18 places in 73 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 38 places in 54 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 37 places in 57 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 34 places in 64 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 38 places in 55 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 53 places in 105 ms
[2020-06-03 05:36:36] [INFO ] Deduced a trap composed of 31 places in 52 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 49 places in 91 ms
[2020-06-03 05:36:37] [INFO ] Deduced a trap composed of 49 places in 88 ms
[2020-06-03 05:36:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1010 ms
[2020-06-03 05:36:37] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 26 ms.
[2020-06-03 05:36:38] [INFO ] Added : 304 causal constraints over 61 iterations in 1238 ms. Result :sat
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 30 places in 71 ms
[2020-06-03 05:36:38] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2020-06-03 05:36:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2020-06-03 05:36:38] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:38] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:38] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2020-06-03 05:36:38] [INFO ] [Real]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:36:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:36:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 05:36:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:39] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-06-03 05:36:39] [INFO ] [Nat]Added 66 Read/Feed constraints in 29 ms returned sat
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 38 places in 106 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 38 places in 88 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 56 places in 98 ms
[2020-06-03 05:36:39] [INFO ] Deduced a trap composed of 56 places in 83 ms
[2020-06-03 05:36:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 441 ms
[2020-06-03 05:36:39] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:36:40] [INFO ] Added : 219 causal constraints over 44 iterations in 942 ms. Result :sat
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 54 places in 94 ms
[2020-06-03 05:36:40] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-03 05:36:41] [INFO ] Deduced a trap composed of 31 places in 124 ms
[2020-06-03 05:36:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 419 ms
[2020-06-03 05:36:41] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:41] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:41] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-06-03 05:36:41] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:36:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:41] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:41] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2020-06-03 05:36:41] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-06-03 05:36:41] [INFO ] Deduced a trap composed of 38 places in 133 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 38 places in 113 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 56 places in 88 ms
[2020-06-03 05:36:42] [INFO ] Deduced a trap composed of 56 places in 91 ms
[2020-06-03 05:36:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 480 ms
[2020-06-03 05:36:42] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-06-03 05:36:43] [INFO ] Added : 219 causal constraints over 44 iterations in 942 ms. Result :sat
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 16 places in 128 ms
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 77 places in 127 ms
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 56 places in 71 ms
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 80 places in 117 ms
[2020-06-03 05:36:43] [INFO ] Deduced a trap composed of 54 places in 126 ms
[2020-06-03 05:36:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 763 ms
[2020-06-03 05:36:44] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:36:44] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:44] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-06-03 05:36:44] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:36:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:44] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2020-06-03 05:36:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:36:44] [INFO ] Deduced a trap composed of 38 places in 129 ms
[2020-06-03 05:36:44] [INFO ] Deduced a trap composed of 38 places in 90 ms
[2020-06-03 05:36:45] [INFO ] Deduced a trap composed of 56 places in 97 ms
[2020-06-03 05:36:45] [INFO ] Deduced a trap composed of 56 places in 106 ms
[2020-06-03 05:36:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 478 ms
[2020-06-03 05:36:45] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-06-03 05:36:46] [INFO ] Added : 219 causal constraints over 44 iterations in 967 ms. Result :sat
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 16 places in 108 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 56 places in 80 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 39 places in 60 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 9 places in 62 ms
[2020-06-03 05:36:46] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-06-03 05:36:47] [INFO ] Deduced a trap composed of 14 places in 82 ms
[2020-06-03 05:36:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1112 ms
[2020-06-03 05:36:47] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:47] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:47] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2020-06-03 05:36:47] [INFO ] [Real]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:36:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-06-03 05:36:47] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:47] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2020-06-03 05:36:47] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 38 places in 122 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 20 places in 91 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 38 places in 93 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 62 places in 75 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 59 places in 65 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 19 places in 24 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 20 places in 70 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 57 places in 109 ms
[2020-06-03 05:36:48] [INFO ] Deduced a trap composed of 57 places in 73 ms
[2020-06-03 05:36:48] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 859 ms
[2020-06-03 05:36:48] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 22 ms.
[2020-06-03 05:36:50] [INFO ] Added : 303 causal constraints over 61 iterations in 1399 ms. Result :sat
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 21 places in 110 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 36 places in 81 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 27 places in 77 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 34 places in 60 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 66 places in 74 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 35 places in 63 ms
[2020-06-03 05:36:50] [INFO ] Deduced a trap composed of 47 places in 66 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 47 places in 98 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 46 places in 78 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 27 places in 108 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 47 places in 80 ms
[2020-06-03 05:36:51] [INFO ] Deduced a trap composed of 50 places in 94 ms
[2020-06-03 05:36:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1439 ms
[2020-06-03 05:36:51] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:51] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2020-06-03 05:36:51] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:36:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:36:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:52] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2020-06-03 05:36:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 38 places in 115 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 20 places in 106 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 38 places in 84 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 62 places in 69 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 59 places in 84 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 19 places in 31 ms
[2020-06-03 05:36:52] [INFO ] Deduced a trap composed of 20 places in 69 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 57 places in 52 ms
[2020-06-03 05:36:53] [INFO ] Deduced a trap composed of 57 places in 50 ms
[2020-06-03 05:36:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 809 ms
[2020-06-03 05:36:53] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 12 ms.
[2020-06-03 05:36:54] [INFO ] Added : 303 causal constraints over 61 iterations in 1882 ms. Result :sat
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 27 places in 122 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 78 places in 75 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 35 places in 110 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 47 places in 63 ms
[2020-06-03 05:36:55] [INFO ] Deduced a trap composed of 34 places in 101 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 47 places in 90 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 18 places in 122 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-06-03 05:36:56] [INFO ] Deduced a trap composed of 47 places in 82 ms
[2020-06-03 05:36:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1505 ms
[2020-06-03 05:36:56] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:56] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:36:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:57] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2020-06-03 05:36:57] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 34 places in 127 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 20 places in 88 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 62 places in 64 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 59 places in 67 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 19 places in 43 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2020-06-03 05:36:57] [INFO ] Deduced a trap composed of 57 places in 140 ms
[2020-06-03 05:36:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 824 ms
[2020-06-03 05:36:58] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 33 ms.
[2020-06-03 05:36:59] [INFO ] Added : 271 causal constraints over 55 iterations in 1246 ms. Result :sat
[2020-06-03 05:36:59] [INFO ] Deduced a trap composed of 38 places in 89 ms
[2020-06-03 05:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2020-06-03 05:36:59] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 05:36:59] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:36:59] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2020-06-03 05:36:59] [INFO ] [Real]Added 66 Read/Feed constraints in 8 ms returned sat
[2020-06-03 05:36:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:36:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 30 ms returned sat
[2020-06-03 05:36:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:36:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:00] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-06-03 05:37:00] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 95 places in 129 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 20 places in 112 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 62 places in 92 ms
[2020-06-03 05:37:00] [INFO ] Deduced a trap composed of 66 places in 88 ms
[2020-06-03 05:37:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 481 ms
[2020-06-03 05:37:00] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 12 ms.
[2020-06-03 05:37:02] [INFO ] Added : 304 causal constraints over 61 iterations in 1504 ms. Result :sat
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 21 places in 93 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 46 places in 62 ms
[2020-06-03 05:37:02] [INFO ] Deduced a trap composed of 20 places in 70 ms
[2020-06-03 05:37:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 443 ms
[2020-06-03 05:37:02] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:37:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 05:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:02] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2020-06-03 05:37:02] [INFO ] [Real]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-06-03 05:37:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 26 ms returned sat
[2020-06-03 05:37:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:03] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2020-06-03 05:37:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 92 places in 157 ms
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 62 places in 105 ms
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 22 places in 114 ms
[2020-06-03 05:37:03] [INFO ] Deduced a trap composed of 52 places in 138 ms
[2020-06-03 05:37:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 579 ms
[2020-06-03 05:37:03] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:37:05] [INFO ] Added : 301 causal constraints over 61 iterations in 1322 ms. Result :sat
[2020-06-03 05:37:05] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-06-03 05:37:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:05] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 05:37:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:05] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2020-06-03 05:37:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 41 places in 93 ms
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 38 places in 75 ms
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 35 places in 66 ms
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 56 places in 73 ms
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 19 places in 37 ms
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 20 places in 77 ms
[2020-06-03 05:37:06] [INFO ] Deduced a trap composed of 34 places in 72 ms
[2020-06-03 05:37:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 680 ms
[2020-06-03 05:37:06] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-06-03 05:37:07] [INFO ] Added : 304 causal constraints over 61 iterations in 1302 ms. Result :sat
[2020-06-03 05:37:08] [INFO ] Deduced a trap composed of 21 places in 89 ms
[2020-06-03 05:37:08] [INFO ] Deduced a trap composed of 36 places in 60 ms
[2020-06-03 05:37:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2020-06-03 05:37:08] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:08] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Real]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:08] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2020-06-03 05:37:08] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:37:08] [INFO ] Deduced a trap composed of 41 places in 76 ms
[2020-06-03 05:37:08] [INFO ] Deduced a trap composed of 38 places in 54 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 35 places in 64 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 56 places in 46 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 19 places in 40 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 20 places in 91 ms
[2020-06-03 05:37:09] [INFO ] Deduced a trap composed of 34 places in 50 ms
[2020-06-03 05:37:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 611 ms
[2020-06-03 05:37:09] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 13 ms.
[2020-06-03 05:37:10] [INFO ] Added : 304 causal constraints over 61 iterations in 1220 ms. Result :sat
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 21 places in 66 ms
[2020-06-03 05:37:10] [INFO ] Deduced a trap composed of 36 places in 48 ms
[2020-06-03 05:37:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2020-06-03 05:37:10] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:37:10] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:11] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2020-06-03 05:37:11] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:37:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:37:11] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:11] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2020-06-03 05:37:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:11] [INFO ] Deduced a trap composed of 20 places in 76 ms
[2020-06-03 05:37:11] [INFO ] Deduced a trap composed of 56 places in 69 ms
[2020-06-03 05:37:11] [INFO ] Deduced a trap composed of 38 places in 63 ms
[2020-06-03 05:37:11] [INFO ] Deduced a trap composed of 20 places in 41 ms
[2020-06-03 05:37:11] [INFO ] Deduced a trap composed of 41 places in 42 ms
[2020-06-03 05:37:11] [INFO ] Deduced a trap composed of 35 places in 41 ms
[2020-06-03 05:37:11] [INFO ] Deduced a trap composed of 38 places in 68 ms
[2020-06-03 05:37:12] [INFO ] Deduced a trap composed of 19 places in 42 ms
[2020-06-03 05:37:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 622 ms
[2020-06-03 05:37:12] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:37:13] [INFO ] Added : 301 causal constraints over 61 iterations in 1690 ms. Result :sat
[2020-06-03 05:37:13] [INFO ] Deduced a trap composed of 51 places in 133 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 56 places in 127 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 9 places in 118 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 27 places in 85 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 49 places in 99 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 59 places in 72 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 56 places in 96 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 56 places in 65 ms
[2020-06-03 05:37:14] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2020-06-03 05:37:15] [INFO ] Deduced a trap composed of 78 places in 111 ms
[2020-06-03 05:37:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1443 ms
[2020-06-03 05:37:15] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 05:37:15] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:15] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2020-06-03 05:37:15] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 05:37:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:15] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2020-06-03 05:37:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:15] [INFO ] Deduced a trap composed of 20 places in 51 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 56 places in 70 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 38 places in 62 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 35 places in 48 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 38 places in 46 ms
[2020-06-03 05:37:16] [INFO ] Deduced a trap composed of 21 places in 35 ms
[2020-06-03 05:37:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 554 ms
[2020-06-03 05:37:16] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 25 ms.
[2020-06-03 05:37:18] [INFO ] Added : 304 causal constraints over 61 iterations in 1681 ms. Result :sat
[2020-06-03 05:37:18] [INFO ] Deduced a trap composed of 21 places in 102 ms
[2020-06-03 05:37:18] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2020-06-03 05:37:18] [INFO ] Deduced a trap composed of 57 places in 92 ms
[2020-06-03 05:37:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2020-06-03 05:37:18] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2020-06-03 05:37:18] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 05:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:18] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2020-06-03 05:37:18] [INFO ] [Real]Added 66 Read/Feed constraints in 28 ms returned sat
[2020-06-03 05:37:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:37:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:19] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2020-06-03 05:37:19] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 40 places in 144 ms
[2020-06-03 05:37:19] [INFO ] Deduced a trap composed of 40 places in 111 ms
[2020-06-03 05:37:20] [INFO ] Deduced a trap composed of 21 places in 61 ms
[2020-06-03 05:37:20] [INFO ] Deduced a trap composed of 35 places in 48 ms
[2020-06-03 05:37:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 724 ms
[2020-06-03 05:37:20] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-06-03 05:37:21] [INFO ] Added : 304 causal constraints over 61 iterations in 1116 ms. Result :sat
[2020-06-03 05:37:21] [INFO ] Deduced a trap composed of 21 places in 98 ms
[2020-06-03 05:37:21] [INFO ] Deduced a trap composed of 34 places in 113 ms
[2020-06-03 05:37:21] [INFO ] Deduced a trap composed of 58 places in 92 ms
[2020-06-03 05:37:21] [INFO ] Deduced a trap composed of 41 places in 130 ms
[2020-06-03 05:37:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 600 ms
[2020-06-03 05:37:21] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:37:21] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:22] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2020-06-03 05:37:22] [INFO ] [Real]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-06-03 05:37:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 63 ms returned sat
[2020-06-03 05:37:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 15 ms returned sat
[2020-06-03 05:37:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:22] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2020-06-03 05:37:22] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-06-03 05:37:22] [INFO ] Deduced a trap composed of 93 places in 96 ms
[2020-06-03 05:37:22] [INFO ] Deduced a trap composed of 53 places in 92 ms
[2020-06-03 05:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2020-06-03 05:37:23] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 14 ms.
[2020-06-03 05:37:24] [INFO ] Added : 304 causal constraints over 61 iterations in 1196 ms. Result :sat
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 16 places in 91 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 17 places in 95 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 30 places in 71 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 46 places in 52 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 9 places in 61 ms
[2020-06-03 05:37:24] [INFO ] Deduced a trap composed of 20 places in 72 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 30 places in 108 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 9 places in 95 ms
[2020-06-03 05:37:25] [INFO ] Deduced a trap composed of 27 places in 67 ms
[2020-06-03 05:37:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1201 ms
[2020-06-03 05:37:25] [INFO ] [Real]Absence check using 11 positive place invariants in 49 ms returned sat
[2020-06-03 05:37:25] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:25] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-03 05:37:25] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:37:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:37:25] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:26] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-06-03 05:37:26] [INFO ] [Nat]Added 66 Read/Feed constraints in 32 ms returned sat
[2020-06-03 05:37:26] [INFO ] Deduced a trap composed of 93 places in 100 ms
[2020-06-03 05:37:26] [INFO ] Deduced a trap composed of 53 places in 72 ms
[2020-06-03 05:37:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2020-06-03 05:37:26] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:37:27] [INFO ] Added : 304 causal constraints over 61 iterations in 1253 ms. Result :sat
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 16 places in 90 ms
[2020-06-03 05:37:27] [INFO ] Deduced a trap composed of 17 places in 99 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 42 places in 62 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 34 places in 58 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 9 places in 49 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2020-06-03 05:37:28] [INFO ] Deduced a trap composed of 41 places in 77 ms
[2020-06-03 05:37:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 887 ms
[2020-06-03 05:37:28] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:28] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 05:37:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:29] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-06-03 05:37:29] [INFO ] [Nat]Added 66 Read/Feed constraints in 31 ms returned sat
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 100 places in 119 ms
[2020-06-03 05:37:29] [INFO ] Deduced a trap composed of 53 places in 108 ms
[2020-06-03 05:37:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 422 ms
[2020-06-03 05:37:29] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 23 ms.
[2020-06-03 05:37:30] [INFO ] Added : 270 causal constraints over 54 iterations in 1347 ms. Result :sat
[2020-06-03 05:37:31] [INFO ] Deduced a trap composed of 16 places in 101 ms
[2020-06-03 05:37:31] [INFO ] Deduced a trap composed of 35 places in 79 ms
[2020-06-03 05:37:31] [INFO ] Deduced a trap composed of 34 places in 83 ms
[2020-06-03 05:37:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2020-06-03 05:37:31] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:37:31] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:31] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2020-06-03 05:37:31] [INFO ] [Real]Added 66 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:37:31] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 24 ms.
[2020-06-03 05:37:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:37:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 05:37:31] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 05:37:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:37:32] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2020-06-03 05:37:32] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 16 places in 150 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 17 places in 99 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 20 places in 86 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 35 places in 91 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 20 places in 90 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 34 places in 78 ms
[2020-06-03 05:37:32] [INFO ] Deduced a trap composed of 54 places in 90 ms
[2020-06-03 05:37:33] [INFO ] Deduced a trap composed of 57 places in 95 ms
[2020-06-03 05:37:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 920 ms
[2020-06-03 05:37:33] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 25 ms.
[2020-06-03 05:37:34] [INFO ] Added : 304 causal constraints over 61 iterations in 1627 ms. Result :sat
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 36 places in 70 ms
[2020-06-03 05:37:34] [INFO ] Deduced a trap composed of 57 places in 102 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 59 places in 58 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 49 places in 72 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 50 places in 87 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 41 places in 49 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 73 places in 73 ms
[2020-06-03 05:37:35] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2020-06-03 05:37:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 900 ms
[2020-06-03 05:37:35] [INFO ] Flatten gal took : 116 ms
[2020-06-03 05:37:35] [INFO ] Flatten gal took : 29 ms
[2020-06-03 05:37:35] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 34 ms.
[2020-06-03 05:37:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Peterson-COL-3 @ 3570 seconds

FORMULA Peterson-COL-3-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Peterson-COL-3-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Peterson-COL-3-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3279
rslt: Output for CTLFireability @ Peterson-COL-3

{
"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",
"--safe",
"--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 05:37:36 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 75,
"adisj": 63,
"aneg": 0,
"comp": 268,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 268,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "((((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37))) AND ((((p26 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p47 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p43 <= 0)) AND ((p25 <= 0) OR (p39 <= 0)) AND ((p31 <= 0) OR (p46 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p29 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p44 <= 0)) AND ((p33 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p38 <= 0))) OR (((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p26 <= 0)) AND ((p16 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p35 <= 0)) AND ((p12 <= 0) OR (p27 <= 0)) AND ((p16 <= 0) OR (p30 <= 0)) AND ((p20 <= 0) OR (p34 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p29 <= 0)) AND ((p20 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p25 <= 0)) AND ((p16 <= 0) OR (p28 <= 0)) AND ((p20 <= 0) OR (p32 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p23 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p33 <= 0)) AND ((p23 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p33 <= 0)) AND ((p17 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p34 <= 0)) AND ((p17 <= 0) OR (p33 <= 0)) AND ((p18 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p29 <= 0)) AND ((p18 <= 0) OR (p24 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p18 <= 0) OR (p27 <= 0)) AND ((p22 <= 0) OR (p31 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)) AND ((p22 <= 0) OR (p30 <= 0)))) AND ((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107) OR ((1 <= p4) AND (1 <= p193)) OR ((1 <= p6) AND (1 <= p166)) OR ((1 <= p8) AND (1 <= p189)) OR ((1 <= p6) AND (1 <= p163)) OR ((1 <= p10) AND (1 <= p162)) OR ((1 <= p6) AND (1 <= p160)) OR ((1 <= p4) AND (1 <= p181)) OR ((1 <= p10) AND (1 <= p168)) OR ((1 <= p6) AND (1 <= p179)) OR ((1 <= p4) AND (1 <= p184)) OR ((1 <= p10) AND (1 <= p165)) OR ((1 <= p4) AND (1 <= p187)) OR ((1 <= p10) AND (1 <= p174)) OR ((1 <= p8) AND (1 <= p192)) OR ((1 <= p4) AND (1 <= p190)) OR ((1 <= p10) AND (1 <= p171)) OR ((1 <= p8) AND (1 <= p195)) OR ((1 <= p4) AND (1 <= p169)) OR ((1 <= p10) AND (1 <= p180)) OR ((1 <= p8) AND (1 <= p161)) OR ((1 <= p6) AND (1 <= p191)) OR ((1 <= p4) AND (1 <= p172)) OR ((1 <= p10) AND (1 <= p177)) OR ((1 <= p8) AND (1 <= p164)) OR ((1 <= p6) AND (1 <= p188)) OR ((1 <= p4) AND (1 <= p175)) OR ((1 <= p10) AND (1 <= p186)) OR ((1 <= p6) AND (1 <= p185)) OR ((1 <= p4) AND (1 <= p178)) OR ((1 <= p10) AND (1 <= p183)) OR ((1 <= p6) AND (1 <= p182)) OR ((1 <= p8) AND (1 <= p173)) OR ((1 <= p8) AND (1 <= p176)) OR ((1 <= p8) AND (1 <= p167)) OR ((1 <= p8) AND (1 <= p170)) OR ((1 <= p6) AND (1 <= p194))))",
"processed_size": 4303,
"rewrites": 647
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"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": "E (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p49 <= 0) AND (p48 <= 0) AND (p51 <= 0) AND (p50 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p57 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p61 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR ((1 <= p9) AND (1 <= p110)) OR ((1 <= p11) AND (1 <= p111)) OR ((1 <= p5) AND (1 <= p108)) OR ((1 <= p7) AND (1 <= p109)))))",
"processed_size": 856,
"rewrites": 648
},
"result":
{
"edges": 59,
"markings": 59,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 144
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "AG(EX(EF(((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))",
"processed_size": 729,
"rewrites": 650
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 17580487,
"markings": 3407946,
"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": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AG((AG((((1 <= p9) AND (1 <= p110)) OR ((1 <= p11) AND (1 <= p111)) OR ((1 <= p5) AND (1 <= p108)) OR ((1 <= p7) AND (1 <= p109)))) OR EX(((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)))))",
"processed_size": 333,
"rewrites": 650
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 46216,
"markings": 10961,
"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": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239))))",
"processed_size": 197,
"rewrites": 648
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 5,
"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": "A (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p49 <= 0) AND (p48 <= 0) AND (p51 <= 0) AND (p50 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p57 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p61 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR (((p9 <= 0) OR (p110 <= 0)) AND ((p11 <= 0) OR (p111 <= 0)) AND ((p5 <= 0) OR (p108 <= 0)) AND ((p7 <= 0) OR (p109 <= 0))))))",
"processed_size": 858,
"rewrites": 649
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p3 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0))))",
"processed_size": 312,
"rewrites": 651
},
"result":
{
"edges": 12547626,
"markings": 3217071,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 76,
"problems": 28
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 347
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "(((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p39 <= 0)) AND ((p27 <= 0) OR (p42 <= 0)) AND ((p32 <= 0) OR (p47 <= 0)) AND ((p33 <= 0) OR (p38 <= 0)) AND ((p28 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p47 <= 0)) AND ((p29 <= 0) OR (p46 <= 0)) AND ((p29 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p43 <= 0)) AND ((p24 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p33 <= 0) OR (p44 <= 0)) AND ((p29 <= 0) OR (p37 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p45 <= 0)) AND ((p25 <= 0) OR (p45 <= 0)) AND ((p30 <= 0) OR (p46 <= 0)) AND ((p25 <= 0) OR (p42 <= 0)) AND ((p33 <= 0) OR (p47 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p38 <= 0)) AND ((p34 <= 0) OR (p41 <= 0)) AND ((p30 <= 0) OR (p37 <= 0)))",
"processed_size": 1149,
"rewrites": 651
},
"result":
{
"edges": 12821959,
"markings": 3407946,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": null,
"problems": null
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p193 <= 0)) AND ((p6 <= 0) OR (p166 <= 0)) AND ((p8 <= 0) OR (p189 <= 0)) AND ((p6 <= 0) OR (p163 <= 0)) AND ((p10 <= 0) OR (p162 <= 0)) AND ((p6 <= 0) OR (p160 <= 0)) AND ((p4 <= 0) OR (p181 <= 0)) AND ((p10 <= 0) OR (p168 <= 0)) AND ((p6 <= 0) OR (p179 <= 0)) AND ((p4 <= 0) OR (p184 <= 0)) AND ((p10 <= 0) OR (p165 <= 0)) AND ((p4 <= 0) OR (p187 <= 0)) AND ((p10 <= 0) OR (p174 <= 0)) AND ((p8 <= 0) OR (p192 <= 0)) AND ((p4 <= 0) OR (p190 <= 0)) AND ((p10 <= 0) OR (p171 <= 0)) AND ((p8 <= 0) OR (p195 <= 0)) AND ((p4 <= 0) OR (p169 <= 0)) AND ((p10 <= 0) OR (p180 <= 0)) AND ((p8 <= 0) OR (p161 <= 0)) AND ((p6 <= 0) OR (p191 <= 0)) AND ((p4 <= 0) OR (p172 <= 0)) AND ((p10 <= 0) OR (p177 <= 0)) AND ((p8 <= 0) OR (p164 <= 0)) AND ((p6 <= 0) OR (p188 <= 0)) AND ((p4 <= 0) OR (p175 <= 0)) AND ((p10 <= 0) OR (p186 <= 0)) AND ((p6 <= 0) OR (p185 <= 0)) AND ((p4 <= 0) OR (p178 <= 0)) AND ((p10 <= 0) OR (p183 <= 0)) AND ((p6 <= 0) OR (p182 <= 0)) AND ((p8 <= 0) OR (p173 <= 0)) AND ((p8 <= 0) OR (p176 <= 0)) AND ((p8 <= 0) OR (p167 <= 0)) AND ((p8 <= 0) OR (p170 <= 0)) AND ((p6 <= 0) OR (p194 <= 0)))",
"processed_size": 1158,
"rewrites": 651
},
"result":
{
"edges": 13491264,
"markings": 3404351,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": null,
"problems": null
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 1,
"aneg": 1,
"comp": 108,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 108,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "((p130 <= 0) AND (p131 <= 0) AND (p128 <= 0) AND (p134 <= 0) AND (p135 <= 0) AND (p132 <= 0) AND (p139 <= 0) AND (p136 <= 0) AND (p137 <= 0) AND (p143 <= 0) AND (p140 <= 0) AND (p141 <= 0) AND (p147 <= 0) AND (p144 <= 0) AND (p145 <= 0) AND (p150 <= 0) AND (p148 <= 0) AND (p149 <= 0) AND (p154 <= 0) AND (p152 <= 0) AND (p153 <= 0) AND (p158 <= 0) AND (p156 <= 0) AND (p157 <= 0) AND (p114 <= 0) AND (p115 <= 0) AND (p113 <= 0) AND (p118 <= 0) AND (p119 <= 0) AND (p117 <= 0) AND (p122 <= 0) AND (p123 <= 0) AND (p121 <= 0) AND (p126 <= 0) AND (p127 <= 0) AND (p124 <= 0) AND ((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p39 <= 0)) AND ((p27 <= 0) OR (p42 <= 0)) AND ((p32 <= 0) OR (p47 <= 0)) AND ((p33 <= 0) OR (p38 <= 0)) AND ((p28 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p47 <= 0)) AND ((p29 <= 0) OR (p46 <= 0)) AND ((p29 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p43 <= 0)) AND ((p24 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p33 <= 0) OR (p44 <= 0)) AND ((p29 <= 0) OR (p37 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p45 <= 0)) AND ((p25 <= 0) OR (p45 <= 0)) AND ((p30 <= 0) OR (p46 <= 0)) AND ((p25 <= 0) OR (p42 <= 0)) AND ((p33 <= 0) OR (p47 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p38 <= 0)) AND ((p34 <= 0) OR (p41 <= 0)) AND ((p30 <= 0) OR (p37 <= 0)))",
"processed_size": 1725,
"rewrites": 650
},
"result":
{
"edges": 574,
"markings": 312,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 204
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 108,
"problems": 72
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 60,
"adisj": 2,
"aneg": 1,
"comp": 120,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "EF((AG((((p26 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p47 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p43 <= 0)) AND ((p25 <= 0) OR (p39 <= 0)) AND ((p31 <= 0) OR (p46 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p29 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p44 <= 0)) AND ((p33 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p38 <= 0)))) AND (((1 <= p15) AND (1 <= p26)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p21) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p35)) OR ((1 <= p12) AND (1 <= p27)) OR ((1 <= p16) AND (1 <= p30)) OR ((1 <= p20) AND (1 <= p34)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p29)) OR ((1 <= p20) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p28)) OR ((1 <= p20) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p33)) OR ((1 <= p23) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p17) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p34)) OR ((1 <= p17) AND (1 <= p33)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p29)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p18) AND (1 <= p27)) OR ((1 <= p22) AND (1 <= p31)) OR ((1 <= p18) AND (1 <= p26)) OR ((1 <= p22) AND (1 <= p30)))))",
"processed_size": 1929,
"rewrites": 649
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 19488947,
"markings": 3407946,
"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": 559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 2,
"aneg": 2,
"comp": 80,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "AG((AG((((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p39 <= 0)) AND ((p27 <= 0) OR (p42 <= 0)) AND ((p32 <= 0) OR (p47 <= 0)) AND ((p33 <= 0) OR (p38 <= 0)) AND ((p28 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p47 <= 0)) AND ((p29 <= 0) OR (p46 <= 0)) AND ((p29 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p43 <= 0)) AND ((p24 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p33 <= 0) OR (p44 <= 0)) AND ((p29 <= 0) OR (p37 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p45 <= 0)) AND ((p25 <= 0) OR (p45 <= 0)) AND ((p30 <= 0) OR (p46 <= 0)) AND ((p25 <= 0) OR (p42 <= 0)) AND ((p33 <= 0) OR (p47 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p38 <= 0)) AND ((p34 <= 0) OR (p41 <= 0)) AND ((p30 <= 0) OR (p37 <= 0)))) OR EF(((p97 <= 0) AND (p96 <= 0) AND (p99 <= 0) AND (p100 <= 0) AND (p103 <= 0) AND (p102 <= 0) AND (p106 <= 0) AND (p105 <= 0)))))",
"processed_size": 1289,
"rewrites": 650
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 23906419,
"markings": 3407946,
"produced_by": "CTL model checker",
"value": true
},
"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": 659
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 1,
"comp": 108,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 108,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "A(EG(((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0))) U (AF(((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))",
"processed_size": 1644,
"rewrites": 650
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 687,
"markings": 307,
"produced_by": "CTL model checker",
"value": false
},
"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": 824
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 824
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "((1 <= p198) OR (1 <= p197) OR (1 <= p196) OR (1 <= p202) OR (1 <= p201) OR (1 <= p200) OR (1 <= p206) OR (1 <= p205) OR (1 <= p204) OR (1 <= p210) OR (1 <= p209) OR (1 <= p208) OR (1 <= p214) OR (1 <= p213) OR (1 <= p212) OR (1 <= p218) OR (1 <= p217) OR (1 <= p216) OR (1 <= p222) OR (1 <= p221) OR (1 <= p220) OR (1 <= p226) OR (1 <= p225) OR (1 <= p224) OR (1 <= p232) OR (1 <= p233) OR (1 <= p234) OR (1 <= p228) OR (1 <= p229) OR (1 <= p230) OR (1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p236) OR (1 <= p237) OR (1 <= p238))",
"processed_size": 538,
"rewrites": 716
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1099
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "((p130 <= 0) AND (p131 <= 0) AND (p128 <= 0) AND (p134 <= 0) AND (p135 <= 0) AND (p132 <= 0) AND (p139 <= 0) AND (p136 <= 0) AND (p137 <= 0) AND (p143 <= 0) AND (p140 <= 0) AND (p141 <= 0) AND (p147 <= 0) AND (p144 <= 0) AND (p145 <= 0) AND (p150 <= 0) AND (p148 <= 0) AND (p149 <= 0) AND (p154 <= 0) AND (p152 <= 0) AND (p153 <= 0) AND (p158 <= 0) AND (p156 <= 0) AND (p157 <= 0) AND (p114 <= 0) AND (p115 <= 0) AND (p113 <= 0) AND (p118 <= 0) AND (p119 <= 0) AND (p117 <= 0) AND (p122 <= 0) AND (p123 <= 0) AND (p121 <= 0) AND (p126 <= 0) AND (p127 <= 0) AND (p124 <= 0) AND (p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0))",
"processed_size": 765,
"rewrites": 651
},
"result":
{
"edges": 6398542,
"markings": 2670958,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 48,
"problems": 48
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1093
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107)) AND ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p100) OR (1 <= p103) OR (1 <= p102) OR (1 <= p106) OR (1 <= p105)))",
"processed_size": 189,
"rewrites": 648
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 37,
"adisj": 2,
"aneg": 0,
"comp": 84,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 84,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "(((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239)) AND (((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37))))",
"processed_size": 1345,
"rewrites": 650
},
"result":
{
"edges": 926571,
"markings": 231725,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 108
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1296,
"problems": 432
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1639
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 37,
"adisj": 1,
"aneg": 0,
"comp": 156,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 156,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 124,
"visible_transitions": 0
},
"processed": "A ((((p198 <= 0) AND (p197 <= 0) AND (p196 <= 0) AND (p202 <= 0) AND (p201 <= 0) AND (p200 <= 0) AND (p206 <= 0) AND (p205 <= 0) AND (p204 <= 0) AND (p210 <= 0) AND (p209 <= 0) AND (p208 <= 0) AND (p214 <= 0) AND (p213 <= 0) AND (p212 <= 0) AND (p218 <= 0) AND (p217 <= 0) AND (p216 <= 0) AND (p222 <= 0) AND (p221 <= 0) AND (p220 <= 0) AND (p226 <= 0) AND (p225 <= 0) AND (p224 <= 0) AND (p232 <= 0) AND (p233 <= 0) AND (p234 <= 0) AND (p228 <= 0) AND (p229 <= 0) AND (p230 <= 0) AND (p240 <= 0) AND (p241 <= 0) AND (p242 <= 0) AND (p236 <= 0) AND (p237 <= 0) AND (p238 <= 0)) U ((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62) OR ((1 <= p11) AND (1 <= p165)) OR ((1 <= p9) AND (1 <= p195)) OR ((1 <= p9) AND (1 <= p192)) OR ((1 <= p11) AND (1 <= p168)) OR ((1 <= p11) AND (1 <= p171)) OR ((1 <= p7) AND (1 <= p166)) OR ((1 <= p11) AND (1 <= p174)) OR ((1 <= p5) AND (1 <= p193)) OR ((1 <= p7) AND (1 <= p160)) OR ((1 <= p5) AND (1 <= p190)) OR ((1 <= p7) AND (1 <= p163)) OR ((1 <= p5) AND (1 <= p187)) OR ((1 <= p9) AND (1 <= p189)) OR ((1 <= p5) AND (1 <= p184)) OR ((1 <= p11) AND (1 <= p162)) OR ((1 <= p5) AND (1 <= p181)) OR ((1 <= p9) AND (1 <= p170)) OR ((1 <= p5) AND (1 <= p178)) OR ((1 <= p9) AND (1 <= p167)) OR ((1 <= p5) AND (1 <= p175)) OR ((1 <= p9) AND (1 <= p176)) OR ((1 <= p7) AND (1 <= p191)) OR ((1 <= p5) AND (1 <= p172)) OR ((1 <= p9) AND (1 <= p173)) OR ((1 <= p7) AND (1 <= p194)) OR ((1 <= p5) AND (1 <= p169)) OR ((1 <= p11) AND (1 <= p177)) OR ((1 <= p7) AND (1 <= p185)) OR ((1 <= p11) AND (1 <= p180)) OR ((1 <= p7) AND (1 <= p188)) OR ((1 <= p9) AND (1 <= p164)) OR ((1 <= p11) AND (1 <= p183)) OR ((1 <= p7) AND (1 <= p179)) OR ((1 <= p9) AND (1 <= p161)) OR ((1 <= p11) AND (1 <= p186)) OR ((1 <= p7) AND (1 <= p182)))))",
"processed_size": 2460,
"rewrites": 652
},
"result":
{
"edges": 59,
"markings": 59,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 124
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 36,
"problems": 36
},
"type": "universal_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3279
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))",
"processed_size": 60,
"rewrites": 650
},
"result":
{
"edges": 515,
"markings": 373,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 48,
"aneg": 0,
"comp": 96,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "(((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p26 <= 0)) AND ((p16 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p35 <= 0)) AND ((p12 <= 0) OR (p27 <= 0)) AND ((p16 <= 0) OR (p30 <= 0)) AND ((p20 <= 0) OR (p34 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p29 <= 0)) AND ((p20 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p25 <= 0)) AND ((p16 <= 0) OR (p28 <= 0)) AND ((p20 <= 0) OR (p32 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p23 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p33 <= 0)) AND ((p23 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p33 <= 0)) AND ((p17 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p34 <= 0)) AND ((p17 <= 0) OR (p33 <= 0)) AND ((p18 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p29 <= 0)) AND ((p18 <= 0) OR (p24 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p18 <= 0) OR (p27 <= 0)) AND ((p22 <= 0) OR (p31 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)) AND ((p22 <= 0) OR (p30 <= 0)))",
"processed_size": 1533,
"rewrites": 647
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"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": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))",
"processed_size": 60,
"rewrites": 650
},
"result":
{
"edges": 515,
"markings": 373,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 50,
"adisj": 4,
"aneg": 0,
"comp": 156,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 156,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 72,
"visible_transitions": 0
},
"processed": "AF((EF(((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125))) AND (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)) OR (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p114) OR (1 <= p115) OR (1 <= p113) OR (1 <= p118) OR (1 <= p119) OR (1 <= p117) OR (1 <= p122) OR (1 <= p123) OR (1 <= p121) OR (1 <= p126) OR (1 <= p127) OR (1 <= p124)) AND (((1 <= p15) AND (1 <= p26)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p21) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p35)) OR ((1 <= p12) AND (1 <= p27)) OR ((1 <= p16) AND (1 <= p30)) OR ((1 <= p20) AND (1 <= p34)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p29)) OR ((1 <= p20) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p28)) OR ((1 <= p20) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p33)) OR ((1 <= p23) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p17) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p34)) OR ((1 <= p17) AND (1 <= p33)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p29)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p18) AND (1 <= p27)) OR ((1 <= p22) AND (1 <= p31)) OR ((1 <= p18) AND (1 <= p26)) OR ((1 <= p22) AND (1 <= p30)))))))",
"processed_size": 2513,
"rewrites": 649
},
"net":
{
"conflict_clusters": 163,
"singleton_clusters": 0
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 48,
"aneg": 0,
"comp": 96,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "(((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p26 <= 0)) AND ((p16 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p35 <= 0)) AND ((p12 <= 0) OR (p27 <= 0)) AND ((p16 <= 0) OR (p30 <= 0)) AND ((p20 <= 0) OR (p34 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p29 <= 0)) AND ((p20 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p25 <= 0)) AND ((p16 <= 0) OR (p28 <= 0)) AND ((p20 <= 0) OR (p32 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p23 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p33 <= 0)) AND ((p23 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p33 <= 0)) AND ((p17 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p34 <= 0)) AND ((p17 <= 0) OR (p33 <= 0)) AND ((p18 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p29 <= 0)) AND ((p18 <= 0) OR (p24 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p18 <= 0) OR (p27 <= 0)) AND ((p22 <= 0) OR (p31 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)) AND ((p22 <= 0) OR (p30 <= 0)))",
"processed_size": 1533,
"rewrites": 647
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 371192,
"runtime": 291.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((E(G(*)) U (A(F(**)) AND **))) : E(F(A(G(**)))) : E(F((A(G(*)) AND **))) : E(F(A(G(**)))) : A(F(**)) : E(F(A(G(**)))) : A(G(**)) : (A(X(**)) OR (E(G(**)) OR **)) : (E(G(E(F(**)))) OR (A(G(**)) AND (** AND **))) : (E(F(A(G(**)))) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))))))))))))))))))))) : A((** U **)) : E(F(**)) : (A(F((E(F(**)) AND **))) AND (E(G(E(F(**)))) AND (A(G(**)) OR **))) : A(G((A(G(*)) OR E(F(*))))) : A(G(E(X(E(F(**)))))) : A(G((A(G(**)) OR E(X(**)))))"
},
"net":
{
"arcs": 1016,
"conflict_clusters": 163,
"places": 244,
"places_significant": 229,
"singleton_clusters": 0,
"transitions": 332
},
"result":
{
"preliminary_value": "no no no no yes no no yes yes no no yes yes yes yes no ",
"value": "no no no no yes no no yes yes no no yes yes yes yes 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: 576/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 244
lola: finding significant places
lola: 244 places, 332 transitions, 229 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: A ((NOT(A (F (((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125))))) U (A (F (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))) AND ((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62))))) : E (F (A (G (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p3) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8)))))))) : E (F ((NOT(E (F ((((1 <= p26) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p47)) OR ((1 <= p24) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p43)) OR ((1 <= p25) AND (1 <= p39)) OR ((1 <= p31) AND (1 <= p46)) OR ((1 <= p27) AND (1 <= p45)) OR ((1 <= p29) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p44)) OR ((1 <= p33) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p38)))))) AND (((1 <= p15) AND (1 <= p26)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p21) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p35)) OR ((1 <= p12) AND (1 <= p27)) OR ((1 <= p16) AND (1 <= p30)) OR ((1 <= p20) AND (1 <= p34)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p29)) OR ((1 <= p20) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p28)) OR ((1 <= p20) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p33)) OR ((1 <= p23) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p17) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p34)) OR ((1 <= p17) AND (1 <= p33)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p29)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p18) AND (1 <= p27)) OR ((1 <= p22) AND (1 <= p31)) OR ((1 <= p18) AND (1 <= p26)) OR ((1 <= p22) AND (1 <= p30)))))) : E (F (A (G ((((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37))))))) : A (F (A (((((1 <= p198) OR (1 <= p197) OR (1 <= p196) OR (1 <= p202) OR (1 <= p201) OR (1 <= p200) OR (1 <= p206) OR (1 <= p205) OR (1 <= p204) OR (1 <= p210) OR (1 <= p209) OR (1 <= p208) OR (1 <= p214) OR (1 <= p213) OR (1 <= p212) OR (1 <= p218) OR (1 <= p217) OR (1 <= p216) OR (1 <= p222) OR (1 <= p221) OR (1 <= p220) OR (1 <= p226) OR (1 <= p225) OR (1 <= p224) OR (1 <= p232) OR (1 <= p233) OR (1 <= p234) OR (1 <= p228) OR (1 <= p229) OR (1 <= p230) OR (1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p236) OR (1 <= p237) OR (1 <= p238)) AND (((1 <= p15) AND (1 <= p26)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p21) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p35)) OR ((1 <= p12) AND (1 <= p27)) OR ((1 <= p16) AND (1 <= p30)) OR ((1 <= p20) AND (1 <= p34)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p29)) OR ((1 <= p20) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p28)) OR ((1 <= p20) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p33)) OR ((1 <= p23) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p17) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p34)) OR ((1 <= p17) AND (1 <= p33)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p29)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p18) AND (1 <= p27)) OR ((1 <= p22) AND (1 <= p31)) OR ((1 <= p18) AND (1 <= p26)) OR ((1 <= p22) AND (1 <= p30)))) U ((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p114) OR (1 <= p115) OR (1 <= p113) OR (1 <= p118) OR (1 <= p119) OR (1 <= p117) OR (1 <= p122) OR (1 <= p123) OR (1 <= p121) OR (1 <= p126) OR (1 <= p127) OR (1 <= p124) OR ((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37))))))) : E (F (A (G ((((1 <= p4) AND (1 <= p193)) OR ((1 <= p6) AND (1 <= p166)) OR ((1 <= p8) AND (1 <= p189)) OR ((1 <= p6) AND (1 <= p163)) OR ((1 <= p10) AND (1 <= p162)) OR ((1 <= p6) AND (1 <= p160)) OR ((1 <= p4) AND (1 <= p181)) OR ((1 <= p10) AND (1 <= p168)) OR ((1 <= p6) AND (1 <= p179)) OR ((1 <= p4) AND (1 <= p184)) OR ((1 <= p10) AND (1 <= p165)) OR ((1 <= p4) AND (1 <= p187)) OR ((1 <= p10) AND (1 <= p174)) OR ((1 <= p8) AND (1 <= p192)) OR ((1 <= p4) AND (1 <= p190)) OR ((1 <= p10) AND (1 <= p171)) OR ((1 <= p8) AND (1 <= p195)) OR ((1 <= p4) AND (1 <= p169)) OR ((1 <= p10) AND (1 <= p180)) OR ((1 <= p8) AND (1 <= p161)) OR ((1 <= p6) AND (1 <= p191)) OR ((1 <= p4) AND (1 <= p172)) OR ((1 <= p10) AND (1 <= p177)) OR ((1 <= p8) AND (1 <= p164)) OR ((1 <= p6) AND (1 <= p188)) OR ((1 <= p4) AND (1 <= p175)) OR ((1 <= p10) AND (1 <= p186)) OR ((1 <= p6) AND (1 <= p185)) OR ((1 <= p4) AND (1 <= p178)) OR ((1 <= p10) AND (1 <= p183)) OR ((1 <= p6) AND (1 <= p182)) OR ((1 <= p8) AND (1 <= p173)) OR ((1 <= p8) AND (1 <= p176)) OR ((1 <= p8) AND (1 <= p167)) OR ((1 <= p8) AND (1 <= p170)) OR ((1 <= p6) AND (1 <= p194))))))) : A (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p49 <= 0) AND (p48 <= 0) AND (p51 <= 0) AND (p50 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p57 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p61 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR (((p9 <= 0) OR (p110 <= 0)) AND ((p11 <= 0) OR (p111 <= 0)) AND ((p5 <= 0) OR (p108 <= 0)) AND ((p7 <= 0) OR (p109 <= 0)))))) : ((A (X (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p114) OR (1 <= p115) OR (1 <= p113) OR (1 <= p118) OR (1 <= p119) OR (1 <= p117) OR (1 <= p122) OR (1 <= p123) OR (1 <= p121) OR (1 <= p126) OR (1 <= p127) OR (1 <= p124)))) OR E (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p91 <= 0) AND (p90 <= 0) AND (p93 <= 0) AND (p92 <= 0) AND (p95 <= 0) AND (p94 <= 0) AND (p49 <= 0) AND (p48 <= 0) AND (p51 <= 0) AND (p50 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p55 <= 0) AND (p54 <= 0) AND (p57 <= 0) AND (p56 <= 0) AND (p59 <= 0) AND (p58 <= 0) AND (p61 <= 0) AND (p60 <= 0) AND (p63 <= 0) AND (p62 <= 0)) OR ((1 <= p9) AND (1 <= p110)) OR ((1 <= p11) AND (1 <= p111)) OR ((1 <= p5) AND (1 <= p108)) OR ((1 <= p7) AND (1 <= p109)))))) OR ((((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37))) AND ((((p26 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p47 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p43 <= 0)) AND ((p25 <= 0) OR (p39 <= 0)) AND ((p31 <= 0) OR (p46 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p29 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p44 <= 0)) AND ((p33 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p38 <= 0))) OR (((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p26 <= 0)) AND ((p16 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p35 <= 0)) AND ((p12 <= 0) OR (p27 <= 0)) AND ((p16 <= 0) OR (p30 <= 0)) AND ((p20 <= 0) OR (p34 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p29 <= 0)) AND ((p20 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p25 <= 0)) AND ((p16 <= 0) OR (p28 <= 0)) AND ((p20 <= 0) OR (p32 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p23 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p33 <= 0)) AND ((p23 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p33 <= 0)) AND ((p17 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p34 <= 0)) AND ((p17 <= 0) OR (p33 <= 0)) AND ((p18 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p29 <= 0)) AND ((p18 <= 0) OR (p24 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p18 <= 0) OR (p27 <= 0)) AND ((p22 <= 0) OR (p31 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)) AND ((p22 <= 0) OR (p30 <= 0)))) AND ((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107) OR ((1 <= p4) AND (1 <= p193)) OR ((1 <= p6) AND (1 <= p166)) OR ((1 <= p8) AND (1 <= p189)) OR ((1 <= p6) AND (1 <= p163)) OR ((1 <= p10) AND (1 <= p162)) OR ((1 <= p6) AND (1 <= p160)) OR ((1 <= p4) AND (1 <= p181)) OR ((1 <= p10) AND (1 <= p168)) OR ((1 <= p6) AND (1 <= p179)) OR ((1 <= p4) AND (1 <= p184)) OR ((1 <= p10) AND (1 <= p165)) OR ((1 <= p4) AND (1 <= p187)) OR ((1 <= p10) AND (1 <= p174)) OR ((1 <= p8) AND (1 <= p192)) OR ((1 <= p4) AND (1 <= p190)) OR ((1 <= p10) AND (1 <= p171)) OR ((1 <= p8) AND (1 <= p195)) OR ((1 <= p4) AND (1 <= p169)) OR ((1 <= p10) AND (1 <= p180)) OR ((1 <= p8) AND (1 <= p161)) OR ((1 <= p6) AND (1 <= p191)) OR ((1 <= p4) AND (1 <= p172)) OR ((1 <= p10) AND (1 <= p177)) OR ((1 <= p8) AND (1 <= p164)) OR ((1 <= p6) AND (1 <= p188)) OR ((1 <= p4) AND (1 <= p175)) OR ((1 <= p10) AND (1 <= p186)) OR ((1 <= p6) AND (1 <= p185)) OR ((1 <= p4) AND (1 <= p178)) OR ((1 <= p10) AND (1 <= p183)) OR ((1 <= p6) AND (1 <= p182)) OR ((1 <= p8) AND (1 <= p173)) OR ((1 <= p8) AND (1 <= p176)) OR ((1 <= p8) AND (1 <= p167)) OR ((1 <= p8) AND (1 <= p170)) OR ((1 <= p6) AND (1 <= p194))))) : (E (G (E (F ((((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239)) AND (((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37)))))))) OR ((A (G ((((1 <= p15) AND (1 <= p26)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p21) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p35)) OR ((1 <= p12) AND (1 <= p27)) OR ((1 <= p16) AND (1 <= p30)) OR ((1 <= p20) AND (1 <= p34)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p29)) OR ((1 <= p20) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p28)) OR ((1 <= p20) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p33)) OR ((1 <= p23) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p17) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p34)) OR ((1 <= p17) AND (1 <= p33)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p29)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p18) AND (1 <= p27)) OR ((1 <= p22) AND (1 <= p31)) OR ((1 <= p18) AND (1 <= p26)) OR ((1 <= p22) AND (1 <= p30))))) AND ((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))) AND ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p100) OR (1 <= p103) OR (1 <= p102) OR (1 <= p106) OR (1 <= p105)))) : ((((((((((((((((((((((((((((((((((((E (F (A (G (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p114) OR (1 <= p115) OR (1 <= p113) OR (1 <= p118) OR (1 <= p119) OR (1 <= p117) OR (1 <= p122) OR (1 <= p123) OR (1 <= p121) OR (1 <= p126) OR (1 <= p127) OR (1 <= p124) OR (1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125)))))) OR (1 <= p198)) OR (1 <= p197)) OR (1 <= p196)) OR (1 <= p202)) OR (1 <= p201)) OR (1 <= p200)) OR (1 <= p206)) OR (1 <= p205)) OR (1 <= p204)) OR (1 <= p210)) OR (1 <= p209)) OR (1 <= p208)) OR (1 <= p214)) OR (1 <= p213)) OR (1 <= p212)) OR (1 <= p218)) OR (1 <= p217)) OR (1 <= p216)) OR (1 <= p222)) OR (1 <= p221)) OR (1 <= p220)) OR (1 <= p226)) OR (1 <= p225)) OR (1 <= p224)) OR (1 <= p232)) OR (1 <= p233)) OR (1 <= p234)) OR (1 <= p228)) OR (1 <= p229)) OR (1 <= p230)) OR (1 <= p240)) OR (1 <= p241)) OR (1 <= p242)) OR (1 <= p236)) OR (1 <= p237)) OR (1 <= p238)) : A ((((p198 <= 0) AND (p197 <= 0) AND (p196 <= 0) AND (p202 <= 0) AND (p201 <= 0) AND (p200 <= 0) AND (p206 <= 0) AND (p205 <= 0) AND (p204 <= 0) AND (p210 <= 0) AND (p209 <= 0) AND (p208 <= 0) AND (p214 <= 0) AND (p213 <= 0) AND (p212 <= 0) AND (p218 <= 0) AND (p217 <= 0) AND (p216 <= 0) AND (p222 <= 0) AND (p221 <= 0) AND (p220 <= 0) AND (p226 <= 0) AND (p225 <= 0) AND (p224 <= 0) AND (p232 <= 0) AND (p233 <= 0) AND (p234 <= 0) AND (p228 <= 0) AND (p229 <= 0) AND (p230 <= 0) AND (p240 <= 0) AND (p241 <= 0) AND (p242 <= 0) AND (p236 <= 0) AND (p237 <= 0) AND (p238 <= 0)) U ((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62) OR ((1 <= p11) AND (1 <= p165)) OR ((1 <= p9) AND (1 <= p195)) OR ((1 <= p9) AND (1 <= p192)) OR ((1 <= p11) AND (1 <= p168)) OR ((1 <= p11) AND (1 <= p171)) OR ((1 <= p7) AND (1 <= p166)) OR ((1 <= p11) AND (1 <= p174)) OR ((1 <= p5) AND (1 <= p193)) OR ((1 <= p7) AND (1 <= p160)) OR ((1 <= p5) AND (1 <= p190)) OR ((1 <= p7) AND (1 <= p163)) OR ((1 <= p5) AND (1 <= p187)) OR ((1 <= p9) AND (1 <= p189)) OR ((1 <= p5) AND (1 <= p184)) OR ((1 <= p11) AND (1 <= p162)) OR ((1 <= p5) AND (1 <= p181)) OR ((1 <= p9) AND (1 <= p170)) OR ((1 <= p5) AND (1 <= p178)) OR ((1 <= p9) AND (1 <= p167)) OR ((1 <= p5) AND (1 <= p175)) OR ((1 <= p9) AND (1 <= p176)) OR ((1 <= p7) AND (1 <= p191)) OR ((1 <= p5) AND (1 <= p172)) OR ((1 <= p9) AND (1 <= p173)) OR ((1 <= p7) AND (1 <= p194)) OR ((1 <= p5) AND (1 <= p169)) OR ((1 <= p11) AND (1 <= p177)) OR ((1 <= p7) AND (1 <= p185)) OR ((1 <= p11) AND (1 <= p180)) OR ((1 <= p7) AND (1 <= p188)) OR ((1 <= p9) AND (1 <= p164)) OR ((1 <= p11) AND (1 <= p183)) OR ((1 <= p7) AND (1 <= p179)) OR ((1 <= p9) AND (1 <= p161)) OR ((1 <= p11) AND (1 <= p186)) OR ((1 <= p7) AND (1 <= p182))))) : E (F (((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239)))) : ((A (F ((E (F (((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125)))) AND (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)) OR (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p114) OR (1 <= p115) OR (1 <= p113) OR (1 <= p118) OR (1 <= p119) OR (1 <= p117) OR (1 <= p122) OR (1 <= p123) OR (1 <= p121) OR (1 <= p126) OR (1 <= p127) OR (1 <= p124)) AND (((1 <= p15) AND (1 <= p26)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p15) AND (1 <= p27)) OR ((1 <= p21) AND (1 <= p27)) OR ((1 <= p15) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p28)) OR ((1 <= p21) AND (1 <= p24)) OR ((1 <= p19) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p21) AND (1 <= p26)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p31)) OR ((1 <= p12) AND (1 <= p26)) OR ((1 <= p16) AND (1 <= p31)) OR ((1 <= p20) AND (1 <= p35)) OR ((1 <= p12) AND (1 <= p27)) OR ((1 <= p16) AND (1 <= p30)) OR ((1 <= p20) AND (1 <= p34)) OR ((1 <= p12) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p29)) OR ((1 <= p20) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p25)) OR ((1 <= p16) AND (1 <= p28)) OR ((1 <= p20) AND (1 <= p32)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p23) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p33)) OR ((1 <= p23) AND (1 <= p35)) OR ((1 <= p13) AND (1 <= p28)) OR ((1 <= p13) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p34)) OR ((1 <= p23) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p35)) OR ((1 <= p14) AND (1 <= p33)) OR ((1 <= p17) AND (1 <= p32)) OR ((1 <= p14) AND (1 <= p32)) OR ((1 <= p17) AND (1 <= p34)) OR ((1 <= p17) AND (1 <= p33)) OR ((1 <= p18) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p29)) OR ((1 <= p18) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p28)) OR ((1 <= p18) AND (1 <= p27)) OR ((1 <= p22) AND (1 <= p31)) OR ((1 <= p18) AND (1 <= p26)) OR ((1 <= p22) AND (1 <= p30)))))))) AND E (G (E (F (((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))))))) AND (A (G (((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125) OR (1 <= p198) OR (1 <= p197) OR (1 <= p196) OR (1 <= p202) OR (1 <= p201) OR (1 <= p200) OR (1 <= p206) OR (1 <= p205) OR (1 <= p204) OR (1 <= p210) OR (1 <= p209) OR (1 <= p208) OR (1 <= p214) OR (1 <= p213) OR (1 <= p212) OR (1 <= p218) OR (1 <= p217) OR (1 <= p216) OR (1 <= p222) OR (1 <= p221) OR (1 <= p220) OR (1 <= p226) OR (1 <= p225) OR (1 <= p224) OR (1 <= p232) OR (1 <= p233) OR (1 <= p234) OR (1 <= p228) OR (1 <= p229) OR (1 <= p230) OR (1 <= p240) OR (1 <= p241) OR (1 <= p242) OR (1 <= p236) OR (1 <= p237) OR (1 <= p238)))) OR (((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR (p26 <= 0)) AND ((p16 <= 0) OR (p31 <= 0)) AND ((p20 <= 0) OR (p35 <= 0)) AND ((p12 <= 0) OR (p27 <= 0)) AND ((p16 <= 0) OR (p30 <= 0)) AND ((p20 <= 0) OR (p34 <= 0)) AND ((p12 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p29 <= 0)) AND ((p20 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p25 <= 0)) AND ((p16 <= 0) OR (p28 <= 0)) AND ((p20 <= 0) OR (p32 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p23 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p33 <= 0)) AND ((p23 <= 0) OR (p35 <= 0)) AND ((p13 <= 0) OR (p28 <= 0)) AND ((p13 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p34 <= 0)) AND ((p23 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p35 <= 0)) AND ((p14 <= 0) OR (p33 <= 0)) AND ((p17 <= 0) OR (p32 <= 0)) AND ((p14 <= 0) OR (p32 <= 0)) AND ((p17 <= 0) OR (p34 <= 0)) AND ((p17 <= 0) OR (p33 <= 0)) AND ((p18 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p29 <= 0)) AND ((p18 <= 0) OR (p24 <= 0)) AND ((p22 <= 0) OR (p28 <= 0)) AND ((p18 <= 0) OR (p27 <= 0)) AND ((p22 <= 0) OR (p31 <= 0)) AND ((p18 <= 0) OR (p26 <= 0)) AND ((p22 <= 0) OR (p30 <= 0))))) : A (G ((NOT(E (F ((((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37)))))) OR NOT(A (G (((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p100) OR (1 <= p103) OR (1 <= p102) OR (1 <= p106) OR (1 <= p105)))))))) : A (G (E (F (E (X (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)))))))) : A (G ((A (G ((((1 <= p9) AND (1 <= p110)) OR ((1 <= p11) AND (1 <= p111)) OR ((1 <= p5) AND (1 <= p108)) OR ((1 <= p7) AND (1 <= p109))))) OR E (X (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)))))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: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: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: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: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: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: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: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: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: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: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: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: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: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:326
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p1... (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: ((((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AN... (shortened)
lola: processed formula length: 4303
lola: 647 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 268 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
lola: processed formula length: 856
lola: 648 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: (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)) AND ((p9 <= 0) OR (p110 <= 0)) AND ((p11 <= 0) OR (p111 <= 0)) AND ((p5 <= 0) OR (p108 <= 0)) AND ((p7 <= 0) OR (p109 <= 0)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 59 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (E (F (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(EF(((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR ... (shortened)
lola: processed formula length: 729
lola: 650 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: 394777 markings, 2031488 edges, 78955 markings/sec, 0 secs
lola: 781459 markings, 4023667 edges, 77336 markings/sec, 5 secs
lola: 1173270 markings, 6046018 edges, 78362 markings/sec, 10 secs
lola: 1539427 markings, 7927367 edges, 73231 markings/sec, 15 secs
lola: 1894266 markings, 9760012 edges, 70968 markings/sec, 20 secs
lola: 2266198 markings, 11674834 edges, 74386 markings/sec, 25 secs
lola: 2624882 markings, 13525943 edges, 71737 markings/sec, 30 secs
lola: 2974198 markings, 15329391 edges, 69863 markings/sec, 35 secs
lola: 3328212 markings, 17168355 edges, 70803 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3407946 markings, 17580487 edges
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((((1 <= p9) AND (1 <= p110)) OR ((1 <= p11) AND (1 <= p111)) OR ((1 <= p5) AND (1 <= p108)) OR ((1 <= p7) AND (1 <= p109))))) OR E (X (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AG((((1 <= p9) AND (1 <= p110)) OR ((1 <= p11) AND (1 <= p111)) OR ((1 <= p5) AND (1 <= p108)) OR ((1 <= p7) AND (1 <= p109)))) OR EX(((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)))))
lola: processed formula length: 333
lola: 650 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: 10961 markings, 46216 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239))))
lola: processed formula length: 197
lola: 648 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p65 <= 0) AND (p64 <= 0) AND (p67 <= 0) AND (p66 <= 0) AND (p69 <= 0) AND (p68 <= 0) AND (p71 <= 0) AND (p70 <= 0) AND (p73 <= 0) AND (p72 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p77 <= 0) AND (p76 <= 0) AND (p79 <= 0) AND (p78 <= 0) AND (p81 <= 0) AND (p80 <= 0) AND (p83 <= 0) AND (p82 <= 0) AND (p85 <= 0) AND (p84 <= 0) AND (p87 <= 0) AND (p86 <= 0) AND (p89 <= 0) AND (p88 <= 0) AND (p... (shortened)
lola: processed formula length: 858
lola: 649 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
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: (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1 <= p76) OR (1 <= p79) OR (1 <= p78) OR (1 <= p81) OR (1 <= p80) OR (1 <= p83) OR (1 <= p82) OR (1 <= p85) OR (1 <= p84) OR (1 <= p87) OR (1 <= p86) OR (1 <= p89) OR (1 <= p88) OR (1 <= p91) OR (1 <= p90) OR (1 <= p93) OR (1 <= p92) OR (1 <= p95) OR (1 <= p94) OR (1 <= p49) OR (1 <= p48) OR (1 <= p51) OR (1 <= p50) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54) OR (1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58) OR (1 <= p61) OR (1 <= p60) OR (1 <= p63) OR (1 <= p62)) AND (((1 <= p9) AND (1 <= p110)) OR ((1 <= p11) AND (1 <= p111)) OR ((1 <= p5) AND (1 <= p108)) OR ((1 <= p7) AND (1 <= p109))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 35 markings, 34 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 576 literals and 192 conjunctive subformulas
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p3) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p3 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0))))
lola: processed formula length: 312
lola: 651 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:700
lola: state equation task get result rewrite finished id 0
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 0
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: formula 0: ((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p3) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p8))))
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished id 0
lola: formula 1: ((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125) OR (((p0 <= 0) OR (p4 <= 0)) AND ((p3 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p8 <= 0))))
lola: state equation: Generated DNF with 56 literals and 4 conjunctive subformulas
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 76 literals and 28 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 513463 markings, 2007254 edges, 102693 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1001761 markings, 3912908 edges, 97660 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1466402 markings, 5720313 edges, 92928 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 1922692 markings, 7495401 edges, 91258 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 2375974 markings, 9261901 edges, 90656 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 2840017 markings, 11070733 edges, 92809 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3217071 markings, 12547626 edges
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR ... (shortened)
lola: processed formula length: 1149
lola: 651 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 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: (((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p39 <= 0)) AND ((p27 <= 0) OR (p42 <= 0)) AND ((p32 <= 0) OR (p47 <= 0)) AND ((p33 <= 0) OR (p38 <= 0)) AND ((p28 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p47 <= 0)) AND ((p29 <= 0) OR (p46 <= 0)) AND ((p29 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p43 <= 0)) AND ((p24 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p33 <= 0) OR (p44 <= 0)) AND ((p29 <= 0) OR (p37 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p45 <= 0)) AND ((p25 <= 0) OR (p45 <= 0)) AND ((p30 <= 0) OR (p46 <= 0)) AND ((p25 <= 0) OR (p42 <= 0)) AND ((p33 <= 0) OR (p47 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p38 <= 0)) AND ((p34 <= 0) OR (p41 <= 0)) AND ((p30 <= 0) OR (p37 <= 0)))
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 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || sara not yet started (preprocessing) || 544994 markings, 2033742 edges, 108999 markings/sec, 0 secs
lola: state equation task get result unparse finished id 1
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara is running 5 secs || sara not yet started (preprocessing) || 1048278 markings, 3938416 edges, 100657 markings/sec, 5 secs
lola: sara is running 10 secs || sara not yet started (preprocessing) || 1528789 markings, 5734296 edges, 96102 markings/sec, 10 secs
lola: sara is running 15 secs || sara not yet started (preprocessing) || 2007552 markings, 7533714 edges, 95753 markings/sec, 15 secs
lola: sara is running 20 secs || sara not yet started (preprocessing) || 2488823 markings, 9341166 edges, 96254 markings/sec, 20 secs
lola: sara is running 25 secs || sara not yet started (preprocessing) || 2982035 markings, 11188673 edges, 98642 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3407946 markings, 12821959 edges
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p4) AND (1 <= p193)) OR ((1 <= p6) AND (1 <= p166)) OR ((1 <= p8) AND (1 <= p189)) OR ((1 <= p6) AND (1 <= p163)) OR ((1 <= p10) AND (1 <= p162)) OR ((1 <= p6) AND (1 <= p160)) OR ((1 <= p4) AND (1 <= p181)) OR ((1 <= p10) AND (1 <= p168)) OR ((1 <= p6) AND (1 <= p179)) OR ((1 <= p4) AND (1 <= p184)) OR ((1 <= p10) AND (1 <= p165)) OR ((1 <= p4) AND (1 <= p187)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p193 <= 0)) AND ((p6 <= 0) OR (p166 <= 0)) AND ((p8 <= 0) OR (p189 <= 0)) AND ((p6 <= 0) OR (p163 <= 0)) AND ((p10 <= 0) OR (p162 <= 0)) AND ((p6 <= 0) OR (p160 <= 0)) AND ((p4 <= 0) OR (p181 <= 0)) AND ((p10 <= 0) OR (p168 <= 0)) AND ((p6 <= 0) OR (p179 <= 0)) AND ((p4 <= 0) OR (p184 <= 0)) AND ((p10 <= 0) OR (p165 <= 0)) AND ((p4 <= 0) OR (p187 <= 0)) AND ((p10 <= 0) ... (shortened)
lola: processed formula length: 1158
lola: 651 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:700
lola: state equation task get result rewrite finished id 0
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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((1 <= p4) AND (1 <= p193)) OR ((1 <= p6) AND (1 <= p166)) OR ((1 <= p8) AND (1 <= p189)) OR ((1 <= p6) AND (1 <= p163)) OR ((1 <= p10) AND (1 <= p162)) OR ((1 <= p6) AND (1 <= p160)) OR ((1 <= p4) AND (1 <= p181)) OR ((1 <= p10) AND (1 <= p168)) OR ((1 <= p6) AND (1 <= p179)) OR ((1 <= p4) AND (1 <= p184)) OR ((1 <= p10) AND (1 <= p165)) OR ((1 <= p4) AND (1 <= p187)) OR ((1 <= p10) AND (1 <= p174)) OR ((1 <= p8) AND (1 <= p192)) OR ((1 <= p4) AND (1 <= p190)) OR ((1 <= p10) AND (1 <= p171)) OR ((1 <= p8) AND (1 <= p195)) OR ((1 <= p4) AND (1 <= p169)) OR ((1 <= p10) AND (1 <= p180)) OR ((1 <= p8) AND (1 <= p161)) OR ((1 <= p6) AND (1 <= p191)) OR ((1 <= p4) AND (1 <= p172)) OR ((1 <= p10) AND (1 <= p177)) OR ((1 <= p8) AND (1 <= p164)) OR ((1 <= p6) AND (1 <= p188)) OR ((1 <= p4) AND (1 <= p175)) OR ((1 <= p10) AND (1 <= p186)) OR ((1 <= p6) AND (1 <= p185)) OR ((1 <= p4) AND (1 <= p178)) OR ((1 <= p10) AND (1 <= p183)) OR ((1 <= p6) AND (1 <= p182)) OR ((1 <= p8) AND (1 <= p173)) OR ((1 <= p8) AND (1 <= p176)) OR ((1 <= p8) AND (1 <= p167)) OR ((1 <= p8) AND (1 <= p170)) OR ((1 <= p6) AND (1 <= p194)))
lola: formula 1: (((p4 <= 0) OR (p193 <= 0)) AND ((p6 <= 0) OR (p166 <= 0)) AND ((p8 <= 0) OR (p189 <= 0)) AND ((p6 <= 0) OR (p163 <= 0)) AND ((p10 <= 0) OR (p162 <= 0)) AND ((p6 <= 0) OR (p160 <= 0)) AND ((p4 <= 0) OR (p181 <= 0)) AND ((p10 <= 0) OR (p168 <= 0)) AND ((p6 <= 0) OR (p179 <= 0)) AND ((p4 <= 0) OR (p184 <= 0)) AND ((p10 <= 0) OR (p165 <= 0)) AND ((p4 <= 0) OR (p187 <= 0)) AND ((p10 <= 0) OR (p174 <= 0)) AND ((p8 <= 0) OR (p192 <= 0)) AND ((p4 <= 0) OR (p190 <= 0)) AND ((p10 <= 0) OR (p171 <= 0)) AND ((p8 <= 0) OR (p195 <= 0)) AND ((p4 <= 0) OR (p169 <= 0)) AND ((p10 <= 0) OR (p180 <= 0)) AND ((p8 <= 0) OR (p161 <= 0)) AND ((p6 <= 0) OR (p191 <= 0)) AND ((p4 <= 0) OR (p172 <= 0)) AND ((p10 <= 0) OR (p177 <= 0)) AND ((p8 <= 0) OR (p164 <= 0)) AND ((p6 <= 0) OR (p188 <= 0)) AND ((p4 <= 0) OR (p175 <= 0)) AND ((p10 <= 0) OR (p186 <= 0)) AND ((p6 <= 0) OR (p185 <= 0)) AND ((p4 <= 0) OR (p178 <= 0)) AND ((p10 <= 0) OR (p183 <= 0)) AND ((p6 <= 0) OR (p182 <= 0)) AND ((p8 <= 0) OR (p173 <= 0)) AND ((p8 <= 0) OR (p176 <= 0)) AND ((p8 <= 0) OR (p167 <= 0)) AND ((p8 <= 0) OR (p170 <= 0)) AND ((p6 <= 0) OR (p194 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 72 literals and 36 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || sara not yet started (preprocessing) || 528162 markings, 2095918 edges, 105632 markings/sec, 0 secs
lola: state equation task get result unparse finished id 1
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara is running 5 secs || sara not yet started (preprocessing) || 1051543 markings, 4169978 edges, 104676 markings/sec, 5 secs
lola: sara is running 10 secs || sara not yet started (preprocessing) || 1561087 markings, 6190098 edges, 101909 markings/sec, 10 secs
lola: sara is running 15 secs || sara not yet started (preprocessing) || 2036082 markings, 8072171 edges, 94999 markings/sec, 15 secs
sara: warning, failure of lp_solve (at job 5183)
lola: sara is running 20 secs || sara not yet started (preprocessing) || 2507908 markings, 9941771 edges, 94365 markings/sec, 20 secs
lola: sara is running 25 secs || sara not yet started (preprocessing) || 2998063 markings, 11883142 edges, 98031 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 3404351 markings, 13491264 edges
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p11... (shortened)
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: ((p130 <= 0) AND (p131 <= 0) AND (p128 <= 0) AND (p134 <= 0) AND (p135 <= 0) AND (p132 <= 0) AND (p139 <= 0) AND (p136 <= 0) AND (p137 <= 0) AND (p143 <= 0) AND (p140 <= 0) AND (p141 <= 0) AND (p147 <= 0) AND (p144 <= 0) AND (p145 <= 0) AND (p150 <= 0) AND (p148 <= 0) AND (p149 <= 0) AND (p154 <= 0) AND (p152 <= 0) AND (p153 <= 0) AND (p158 <= 0) AND (p156 <= 0) AND (p157 <= 0) AND (p114 <= 0) AND... (shortened)
lola: processed formula length: 1725
lola: 650 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 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p114) OR (1 <= p115) OR (1 <= p113) OR (1 <= p118) OR (1 <= p119) OR (1 <= p117) OR (1 <= p122) OR (1 <= p123) OR (1 <= p121) OR (1 <= p126) OR (1 <= p127) OR (1 <= p124) OR ((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 108 literals and 72 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 312 markings, 574 edges
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((((p26 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p47 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p43 <= 0)) AND ((p25 <= 0) OR (p39 <= 0)) AND ((p31 <= 0) OR (p46 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p29 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p44 <= 0)) AND ((p33 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p38 <= 0))))) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG((((p26 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p47 <= 0)) AND ((p24 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p43 <= 0)) AND ((p25 <= 0) OR (p39 <= 0)) AND ((p31 <= 0) OR (p46 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p29 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p44 <= 0)) AND ((p33 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p38 <= 0)))) AND (((1 <... (shortened)
lola: processed formula length: 1929
lola: 649 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: 397554 markings, 2254856 edges, 79511 markings/sec, 0 secs
lola: 743608 markings, 4235075 edges, 69211 markings/sec, 5 secs
lola: 1096344 markings, 6248423 edges, 70547 markings/sec, 10 secs
lola: 1432420 markings, 8175791 edges, 67215 markings/sec, 15 secs
lola: 1778209 markings, 10156044 edges, 69158 markings/sec, 20 secs
lola: 2127340 markings, 12158141 edges, 69826 markings/sec, 25 secs
lola: 2476956 markings, 14155185 edges, 69923 markings/sec, 30 secs
lola: 2820446 markings, 16122666 edges, 68698 markings/sec, 35 secs
lola: 3172939 markings, 18140873 edges, 70499 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3407946 markings, 19488947 edges
lola: ========================================
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AG((((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((p24 <=... (shortened)
lola: processed formula length: 1289
lola: 650 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: 315064 markings, 2213305 edges, 63013 markings/sec, 0 secs
lola: 620299 markings, 4349170 edges, 61047 markings/sec, 5 secs
lola: 914586 markings, 6418133 edges, 58857 markings/sec, 10 secs
lola: 1202895 markings, 8433640 edges, 57662 markings/sec, 15 secs
lola: 1490925 markings, 10448573 edges, 57606 markings/sec, 20 secs
lola: 1775973 markings, 12454127 edges, 57010 markings/sec, 25 secs
lola: 2057458 markings, 14423605 edges, 56297 markings/sec, 30 secs
lola: 2335703 markings, 16375561 edges, 55649 markings/sec, 35 secs
lola: 2616097 markings, 18341010 edges, 56079 markings/sec, 40 secs
lola: 2891483 markings, 20272967 edges, 55077 markings/sec, 45 secs
lola: 3173738 markings, 22261110 edges, 56451 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3407946 markings, 23906419 edges
lola: ========================================
lola: subprocess 11 will run for 659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)))) U (A (F (((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG(((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0))) U (AF(((1 <= p65) OR (1 <= p64) OR (1 <= p67) OR (1 <= p66) OR (1 <= p69) OR (1 <= p68) OR (1 <= p71) OR (1 <= p70) OR (1 <= p73) OR (1 <= p72) OR (1 <= p75) OR (1 <= p74) OR (1 <= p77) OR (1... (shortened)
lola: processed formula length: 1644
lola: 650 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 307 markings, 687 edges
lola: ========================================
lola: subprocess 12 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p198) OR ((1 <= p197) OR ((1 <= p196) OR ((1 <= p202) OR ((1 <= p201) OR ((1 <= p200) OR ((1 <= p206) OR ((1 <= p205) OR ((1 <= p204) OR ((1 <= p210) OR ((1 <= p209) OR ((1 <= p208) OR ((1 <= p214) OR ((1 <= p213) OR ((1 <= p212) OR ((1 <= p218) OR ((1 <= p217) OR ((1 <= p216) OR ((1 <= p222) OR ((1 <= p221) OR ((1 <= p220) OR ((1 <= p226) OR ((1 <= p225) OR ((1 <= p224) OR ((1 <= p232) OR ... (shortened)
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: 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: 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: 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: 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: 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: 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 <= p198) OR (1 <= p197) OR (1 <= p196) OR (1 <= p202) OR (1 <= p201) OR (1 <= p200) OR (1 <= p206) OR (1 <= p205) OR (1 <= p204) OR (1 <= p210) OR (1 <= p209) OR (1 <= p208) OR (1 <= p214) OR (1 <= p213) OR (1 <= p212) OR (1 <= p218) OR (1 <= p217) OR (1 <= p216) OR (1 <= p222) OR (1 <= p221) OR (1 <= p220) OR (1 <= p226) OR (1 <= p225) OR (1 <= p224) OR (1 <= p232) OR (1 <= p233) OR (1 <= p23... (shortened)
lola: processed formula length: 538
lola: 716 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 36 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 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p130 <= 0) AND (p131 <= 0) AND (p128 <= 0) AND (p134 <= 0) AND (p135 <= 0) AND (p132 <= 0) AND (p139 <= 0) AND (p136 <= 0) AND (p137 <= 0) AND (p143 <= 0) AND (p140 <= 0) AND (p141 <= 0) AND (p147 <= 0) AND (p144 <= 0) AND (p145 <= 0) AND (p150 <= 0) AND (p148 <= 0) AND (p149 <= 0) AND (p154 <= 0) AND (p152 <= 0) AND (p153 <= 0) AND (p158 <= 0) AND (p156 <= 0) AND (p157 <= 0) AND (p114 <= 0) AND... (shortened)
lola: processed formula length: 765
lola: 651 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 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: ((p130 <= 0) AND (p131 <= 0) AND (p128 <= 0) AND (p134 <= 0) AND (p135 <= 0) AND (p132 <= 0) AND (p139 <= 0) AND (p136 <= 0) AND (p137 <= 0) AND (p143 <= 0) AND (p140 <= 0) AND (p141 <= 0) AND (p147 <= 0) AND (p144 <= 0) AND (p145 <= 0) AND (p150 <= 0) AND (p148 <= 0) AND (p149 <= 0) AND (p154 <= 0) AND (p152 <= 0) AND (p153 <= 0) AND (p158 <= 0) AND (p156 <= 0) AND (p157 <= 0) AND (p114 <= 0) AND (p115 <= 0) AND (p113 <= 0) AND (p118 <= 0) AND (p119 <= 0) AND (p117 <= 0) AND (p122 <= 0) AND (p123 <= 0) AND (p121 <= 0) AND (p126 <= 0) AND (p127 <= 0) AND (p124 <= 0) AND (p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 48 literals and 1 conjunctive subformulas
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 <= p130) OR (1 <= p131) OR (1 <= p128) OR (1 <= p134) OR (1 <= p135) OR (1 <= p132) OR (1 <= p139) OR (1 <= p136) OR (1 <= p137) OR (1 <= p143) OR (1 <= p140) OR (1 <= p141) OR (1 <= p147) OR (1 <= p144) OR (1 <= p145) OR (1 <= p150) OR (1 <= p148) OR (1 <= p149) OR (1 <= p154) OR (1 <= p152) OR (1 <= p153) OR (1 <= p158) OR (1 <= p156) OR (1 <= p157) OR (1 <= p114) OR (1 <= p115) OR (1 <= p113) OR (1 <= p118) OR (1 <= p119) OR (1 <= p117) OR (1 <= p122) OR (1 <= p123) OR (1 <= p121) OR (1 <= p126) OR (1 <= p127) OR (1 <= p124) OR (1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 48 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 889519 markings, 2105024 edges, 177904 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1719101 markings, 4073293 edges, 165916 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2540817 markings, 6083795 edges, 164343 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 2670958 markings, 6398542 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239)) AND (((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107)) AND ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p100) OR (1 <= p103) OR (1 <= p102) OR (1 <= p106) OR (1 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107)) AND ((1 <= p97) OR (1 <= p96) OR (1 <= p99) OR (1 <= p100) OR (1 <= p103) OR (1 <= p102) OR (1 <= p106) OR (1 <= p105)))
lola: processed formula length: 189
lola: 648 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 12 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 1640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239)) AND (((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239)) AND (((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) ... (shortened)
lola: processed formula length: 1345
lola: 650 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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: (((p199 <= 0) AND (p215 <= 0) AND (p235 <= 0) AND (p203 <= 0) AND (p219 <= 0) AND (p231 <= 0) AND (p223 <= 0) AND (p207 <= 0) AND (p243 <= 0) AND (p211 <= 0) AND (p227 <= 0) AND (p239 <= 0)) OR (((p31 <= 0) OR (p43 <= 0)) AND ((p26 <= 0) OR (p45 <= 0)) AND ((p26 <= 0) OR (p39 <= 0)) AND ((p35 <= 0) OR (p38 <= 0)) AND ((p25 <= 0) OR (p36 <= 0)) AND ((p35 <= 0) OR (p44 <= 0)) AND ((p31 <= 0) OR (p40 <= 0)) AND ((p31 <= 0) OR (p37 <= 0)) AND ((p35 <= 0) OR (p41 <= 0)) AND ((p27 <= 0) OR (p39 <= 0)) AND ((p32 <= 0) OR (p41 <= 0)) AND ((p32 <= 0) OR (p44 <= 0)) AND ((p24 <= 0) OR (p39 <= 0)) AND ((p27 <= 0) OR (p42 <= 0)) AND ((p32 <= 0) OR (p47 <= 0)) AND ((p33 <= 0) OR (p38 <= 0)) AND ((p28 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p47 <= 0)) AND ((p29 <= 0) OR (p46 <= 0)) AND ((p29 <= 0) OR (p43 <= 0)) AND ((p28 <= 0) OR (p43 <= 0)) AND ((p24 <= 0) OR (p42 <= 0)) AND ((p28 <= 0) OR (p46 <= 0)) AND ((p33 <= 0) OR (p44 <= 0)) AND ((p29 <= 0) OR (p37 <= 0)) AND ((p27 <= 0) OR (p36 <= 0)) AND ((p24 <= 0) OR (p45 <= 0)) AND ((p25 <= 0) OR (p45 <= 0)) AND ((p30 <= 0) OR (p46 <= 0)) AND ((p25 <= 0) OR (p42 <= 0)) AND ((p33 <= 0) OR (p47 <= 0)) AND ((p26 <= 0) OR (p36 <= 0)) AND ((p30 <= 0) OR (p40 <= 0)) AND ((p34 <= 0) OR (p38 <= 0)) AND ((p34 <= 0) OR (p41 <= 0)) AND ((p30 <= 0) OR (p37 <= 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: formula 1: (((1 <= p199) OR (1 <= p215) OR (1 <= p235) OR (1 <= p203) OR (1 <= p219) OR (1 <= p231) OR (1 <= p223) OR (1 <= p207) OR (1 <= p243) OR (1 <= p211) OR (1 <= p227) OR (1 <= p239)) AND (((1 <= p31) AND (1 <= p43)) OR ((1 <= p26) AND (1 <= p45)) OR ((1 <= p26) AND (1 <= p39)) OR ((1 <= p35) AND (1 <= p38)) OR ((1 <= p25) AND (1 <= p36)) OR ((1 <= p35) AND (1 <= p44)) OR ((1 <= p31) AND (1 <= p40)) OR ((1 <= p31) AND (1 <= p37)) OR ((1 <= p35) AND (1 <= p41)) OR ((1 <= p27) AND (1 <= p39)) OR ((1 <= p32) AND (1 <= p41)) OR ((1 <= p32) AND (1 <= p44)) OR ((1 <= p24) AND (1 <= p39)) OR ((1 <= p27) AND (1 <= p42)) OR ((1 <= p32) AND (1 <= p47)) OR ((1 <= p33) AND (1 <= p38)) OR ((1 <= p28) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p47)) OR ((1 <= p29) AND (1 <= p46)) OR ((1 <= p29) AND (1 <= p43)) OR ((1 <= p28) AND (1 <= p43)) OR ((1 <= p24) AND (1 <= p42)) OR ((1 <= p28) AND (1 <= p46)) OR ((1 <= p33) AND (1 <= p44)) OR ((1 <= p29) AND (1 <= p37)) OR ((1 <= p27) AND (1 <= p36)) OR ((1 <= p24) AND (1 <= p45)) OR ((1 <= p25) AND (1 <= p45)) OR ((1 <= p30) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p42)) OR ((1 <= p33) AND (1 <= p47)) OR ((1 <= p26) AND (1 <= p36)) OR ((1 <= p30) AND (1 <= p40)) OR ((1 <= p34) AND (1 <= p38)) OR ((1 <= p34) AND (1 <= p41)) OR ((1 <= p30) AND (1 <= p37))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1296 literals and 432 conjunctive subformulas
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
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 231725 markings, 926571 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p198 <= 0) AND (p197 <= 0) AND (p196 <= 0) AND (p202 <= 0) AND (p201 <= 0) AND (p200 <= 0) AND (p206 <= 0) AND (p205 <= 0) AND (p204 <= 0) AND (p210 <= 0) AND (p209 <= 0) AND (p208 <= 0) AND (p214 <= 0) AND (p213 <= 0) AND (p212 <= 0) AND (p218 <= 0) AND (p217 <= 0) AND (p216 <= 0) AND (p222 <= 0) AND (p221 <= 0) AND (p220 <= 0) AND (p226 <= 0) AND (p225 <= 0) AND (p224 <= 0) AND (p232 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((p198 <= 0) AND (p197 <= 0) AND (p196 <= 0) AND (p202 <= 0) AND (p201 <= 0) AND (p200 <= 0) AND (p206 <= 0) AND (p205 <= 0) AND (p204 <= 0) AND (p210 <= 0) AND (p209 <= 0) AND (p208 <= 0) AND (p214 <= 0) AND (p213 <= 0) AND (p212 <= 0) AND (p218 <= 0) AND (p217 <= 0) AND (p216 <= 0) AND (p222 <= 0) AND (p221 <= 0) AND (p220 <= 0) AND (p226 <= 0) AND (p225 <= 0) AND (p224 <= 0) AND (p232 <= 0)... (shortened)
lola: processed formula length: 2460
lola: 652 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl 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: ((p198 <= 0) AND (p197 <= 0) AND (p196 <= 0) AND (p202 <= 0) AND (p201 <= 0) AND (p200 <= 0) AND (p206 <= 0) AND (p205 <= 0) AND (p204 <= 0) AND (p210 <= 0) AND (p209 <= 0) AND (p208 <= 0) AND (p214 <= 0) AND (p213 <= 0) AND (p212 <= 0) AND (p218 <= 0) AND (p217 <= 0) AND (p216 <= 0) AND (p222 <= 0) AND (p221 <= 0) AND (p220 <= 0) AND (p226 <= 0) AND (p225 <= 0) AND (p224 <= 0) AND (p232 <= 0) AND (p233 <= 0) AND (p234 <= 0) AND (p228 <= 0) AND (p229 <= 0) AND (p230 <= 0) AND (p240 <= 0) AND (p241 <= 0) AND (p242 <= 0) AND (p236 <= 0) AND (p237 <= 0) AND (p238 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 36 literals and 1 conjunctive subformulas
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 59 markings, 59 edges
lola: ========================================
lola: subprocess 15 will run for 3279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((E (F (((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125)))) AND (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))
lola: processed formula length: 60
lola: 650 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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: 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: 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 1
lola: state equation task get result unparse finished++ id 0
lola: formula 1: ((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))
lola: state equation task get result unparse finished id 1
lola: formula 0: ((p98 <= 0) AND (p101 <= 0) AND (p104 <= 0) AND (p107 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 373 markings, 515 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR ... (shortened)
lola: processed formula length: 1533
lola: 647 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 96 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F ((E (F (((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125)))) AND (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))
lola: processed formula length: 60
lola: 650 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--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 1
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: 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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p98) OR (1 <= p101) OR (1 <= p104) OR (1 <= p107))
lola: formula 0: ((p98 <= 0) AND (p101 <= 0) AND (p104 <= 0) AND (p107 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 373 markings, 515 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((E (F (((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125)))) AND (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF(((1 <= p146) OR (1 <= p112) OR (1 <= p129) OR (1 <= p151) OR (1 <= p116) OR (1 <= p133) OR (1 <= p138) OR (1 <= p155) OR (1 <= p120) OR (1 <= p142) OR (1 <= p159) OR (1 <= p125))) AND (((p146 <= 0) AND (p112 <= 0) AND (p129 <= 0) AND (p151 <= 0) AND (p116 <= 0) AND (p133 <= 0) AND (p138 <= 0) AND (p155 <= 0) AND (p120 <= 0) AND (p142 <= 0) AND (p159 <= 0) AND (p125 <= 0)) OR (((... (shortened)
lola: processed formula length: 2513
lola: 649 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 17 markings, 17 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p15 <= 0) OR (p26 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p15 <= 0) OR (p27 <= 0)) AND ((p21 <= 0) OR (p27 <= 0)) AND ((p15 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p28 <= 0)) AND ((p21 <= 0) OR (p24 <= 0)) AND ((p19 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p21 <= 0) OR (p26 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p31 <= 0)) AND ((p12 <= 0) OR ... (shortened)
lola: processed formula length: 1533
lola: 647 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 96 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes no no yes yes yes yes no
lola:
preliminary result: no no no no yes no no yes yes no no yes yes yes yes no
lola: memory consumption: 371192 KB
lola: time consumption: 291 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 8022752 kB
After kill :
MemTotal: 16427332 kB
MemFree: 8021476 kB

--------------------
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="Peterson-COL-3"
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 Peterson-COL-3, 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 r174-csrt-158987853500668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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