Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987939200556.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 SharedMemory-PT-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939200556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 171K 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 SharedMemory-PT-000010-CTLFireability-00
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-01
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-02
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-03
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-04
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-05
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-06
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-07
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-08
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-09
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-10
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-11
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-12
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-13
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-14
FORMULA_NAME SharedMemory-PT-000010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591251494422

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:18:18] [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-04 06:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:18:18] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2020-06-04 06:18:18] [INFO ] Transformed 131 places.
[2020-06-04 06:18:18] [INFO ] Transformed 210 transitions.
[2020-06-04 06:18:18] [INFO ] Found NUPN structural information;
[2020-06-04 06:18:18] [INFO ] Parsed PT model containing 131 places and 210 transitions in 136 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 74 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 374 ms. (steps per millisecond=267 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 210 rows 131 cols
[2020-06-04 06:18:18] [INFO ] Computed 21 place invariants in 9 ms
[2020-06-04 06:18:18] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 06:18:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 06:18:19] [INFO ] Flatten gal took : 108 ms
[2020-06-04 06:18:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 06:18:19] [INFO ] Flatten gal took : 35 ms
FORMULA SharedMemory-PT-000010-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 06:18:19] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 33 ms.
[2020-06-04 06:18:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SharedMemory-PT-000010 @ 3570 seconds

FORMULA SharedMemory-PT-000010-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000010-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3514
rslt: Output for CTLFireability @ SharedMemory-PT-000010

{
"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": "Thu Jun 4 06:18:19 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 20,
"adisj": 2,
"aneg": 0,
"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": 10,
"visible_transitions": 0
},
"processed": "AG(E((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))) U (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)))))",
"processed_size": 364,
"rewrites": 53
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 251,
"markings": 69,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 10,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EF(AX((((p115 <= 0)) AND ((p101 <= 0)) AND ((p116 <= 0)) AND ((p103 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p104 <= 0)) AND ((p107 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))))",
"processed_size": 185,
"rewrites": 53
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 547,
"markings": 209,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 2,
"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": 10,
"visible_transitions": 0
},
"processed": "((((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0))) OR (((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0))))",
"processed_size": 361,
"rewrites": 53
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 31,
"adisj": 3,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "E((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))) U AX(((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119))) AND (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))))))",
"processed_size": 699,
"rewrites": 53
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "CTL model checker",
"value": true
},
"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": 323
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(EG(EX((((1 <= p85) AND (1 <= p94) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p124))))) OR E(AG(((1 <= p30))) U ((1 <= p60))))",
"processed_size": 141,
"rewrites": 55
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))))",
"processed_size": 185,
"rewrites": 53
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p43))",
"processed_size": 12,
"rewrites": 54
},
"result":
{
"edges": 3063987,
"markings": 1299078,
"produced_by": "tscc_search",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p85) AND (1 <= p88) AND (1 <= p113) AND (1 <= p94) AND (1 <= p123))",
"processed_size": 74,
"rewrites": 55
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 92
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((1 <= p85) AND (1 <= p95) AND (1 <= p109) AND (1 <= p88) AND (1 <= p120))",
"processed_size": 74,
"rewrites": 55
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 92
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 101,
"adisj": 2,
"aneg": 1,
"comp": 100,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "((((p1 <= 0)) AND ((p64 <= 0)) AND ((p3 <= 0)) AND ((p66 <= 0)) AND ((p5 <= 0)) AND ((p68 <= 0)) AND ((p7 <= 0)) AND ((p70 <= 0)) AND ((p9 <= 0)) AND ((p72 <= 0)) AND ((p11 <= 0)) AND ((p74 <= 0)) AND ((p13 <= 0)) AND ((p76 <= 0)) AND ((p15 <= 0)) AND ((p78 <= 0)) AND ((p17 <= 0)) AND ((p80 <= 0)) AND ((p19 <= 0)) AND ((p82 <= 0)) AND ((p21 <= 0)) AND ((p84 <= 0)) AND ((p23 <= 0)) AND ((p86 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p90 <= 0)) AND ((p29 <= 0)) AND ((p92 <= 0)) AND ((p31 <= 0)) AND ((p33 <= 0)) AND ((p35 <= 0)) AND ((p37 <= 0)) AND ((p39 <= 0)) AND ((p41 <= 0)) AND ((p43 <= 0)) AND ((p45 <= 0)) AND ((p47 <= 0)) AND ((p49 <= 0)) AND ((p51 <= 0)) AND ((p53 <= 0)) AND ((p55 <= 0)) AND ((p57 <= 0)) AND ((p59 <= 0)) AND ((p61 <= 0)) AND ((p63 <= 0)) AND ((p0 <= 0)) AND ((p65 <= 0)) AND ((p2 <= 0)) AND ((p67 <= 0)) AND ((p4 <= 0)) AND ((p69 <= 0)) AND ((p6 <= 0)) AND ((p71 <= 0)) AND ((p8 <= 0)) AND ((p73 <= 0)) AND ((p10 <= 0)) AND ((p75 <= 0)) AND ((p12 <= 0)) AND ((p77 <= 0)) AND ((p14 <= 0)) AND ((p79 <= 0)) AND ((p16 <= 0)) AND ((p81 <= 0)) AND ((p18 <= 0)) AND ((p83 <= 0)) AND ((p20 <= 0)) AND ((p22 <= 0)) AND ((p24 <= 0)) AND ((p89 <= 0)) AND ((p26 <= 0)) AND ((p91 <= 0)) AND ((p28 <= 0)) AND ((p30 <= 0)) AND ((p32 <= 0)) AND ((p34 <= 0)) AND ((p36 <= 0)) AND ((p38 <= 0)) AND ((p40 <= 0)) AND ((p42 <= 0)) AND ((p44 <= 0)) AND ((p46 <= 0)) AND ((p48 <= 0)) AND ((p50 <= 0)) AND ((p52 <= 0)) AND ((p54 <= 0)) AND ((p56 <= 0)) AND ((p58 <= 0)) AND ((p60 <= 0)) AND ((p62 <= 0))) OR (((p115 <= 0)) AND ((p101 <= 0)) AND ((p116 <= 0)) AND ((p103 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p104 <= 0)) AND ((p107 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0))))",
"processed_size": 1701,
"rewrites": 55
},
"result":
{
"edges": 7768530,
"markings": 1830519,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1800,
"problems": 900
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 884
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AG(E(((p37 <= 0)) U ((p30 <= 0))))",
"processed_size": 34,
"rewrites": 53
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 21337017,
"markings": 1830519,
"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": 1171
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 182,
"adisj": 103,
"aneg": 0,
"comp": 460,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 460,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 121,
"visible_transitions": 0
},
"processed": "E(((((p85 <= 0) OR (p97 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p123 <= 0))) OR (((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))) U A((((1 <= p1)) OR ((1 <= p64)) OR ((1 <= p3)) OR ((1 <= p66)) OR ((1 <= p5)) OR ((1 <= p68)) OR ((1 <= p7)) OR ((1 <= p70)) OR ((1 <= p9)) OR ((1 <= p72)) OR ((1 <= p11)) OR ((1 <= p74)) OR ((1 <= p13)) OR ((1 <= p76)) OR ((1 <= p15)) OR ((1 <= p78)) OR ((1 <= p17)) OR ((1 <= p80)) OR ((1 <= p19)) OR ((1 <= p82)) OR ((1 <= p21)) OR ((1 <= p84)) OR ((1 <= p23)) OR ((1 <= p86)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p90)) OR ((1 <= p29)) OR ((1 <= p92)) OR ((1 <= p31)) OR ((1 <= p33)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p39)) OR ((1 <= p41)) OR ((1 <= p43)) OR ((1 <= p45)) OR ((1 <= p47)) OR ((1 <= p49)) OR ((1 <= p51)) OR ((1 <= p53)) OR ((1 <= p55)) OR ((1 <= p57)) OR ((1 <= p59)) OR ((1 <= p61)) OR ((1 <= p63)) OR ((1 <= p0)) OR ((1 <= p65)) OR ((1 <= p2)) OR ((1 <= p67)) OR ((1 <= p4)) OR ((1 <= p69)) OR ((1 <= p6)) OR ((1 <= p71)) OR ((1 <= p8)) OR ((1 <= p73)) OR ((1 <= p10)) OR ((1 <= p75)) OR ((1 <= p12)) OR ((1 <= p77)) OR ((1 <= p14)) OR ((1 <= p79)) OR ((1 <= p16)) OR ((1 <= p81)) OR ((1 <= p18)) OR ((1 <= p83)) OR ((1 <= p20)) OR ((1 <= p22)) OR ((1 <= p24)) OR ((1 <= p89)) OR ((1 <= p26)) OR ((1 <= p91)) OR ((1 <= p28)) OR ((1 <= p30)) OR ((1 <= p32)) OR ((1 <= p34)) OR ((1 <= p36)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p42)) OR ((1 <= p44)) OR ((1 <= p46)) OR ((1 <= p48)) OR ((1 <= p50)) OR ((1 <= p52)) OR ((1 <= p54)) OR ((1 <= p56)) OR ((1 <= p58)) OR ((1 <= p60)) OR ((1 <= p62))) U (((1 <= p1)) OR ((1 <= p64)) OR ((1 <= p3)) OR ((1 <= p66)) OR ((1 <= p5)) OR ((1 <= p68)) OR ((1 <= p7)) OR ((1 <= p70)) OR ((1 <= p9)) OR ((1 <= p72)) OR ((1 <= p11)) OR ((1 <= p74)) OR ((1 <= p13)) OR ((1 <= p76)) OR ((1 <= p15)) OR ((1 <= p78)) OR ((1 <= p17)) OR ((1 <= p80)) OR ((1 <= p19)) OR ((1 <= p82)) OR ((1 <= p21)) OR ((1 <= p84)) OR ((1 <= p23)) OR ((1 <= p86)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p90)) OR ((1 <= p29)) OR ((1 <= p92)) OR ((1 <= p31)) OR ((1 <= p33)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p39)) OR ((1 <= p41)) OR ((1 <= p43)) OR ((1 <= p45)) OR ((1 <= p47)) OR ((1 <= p49)) OR ((1 <= p51)) OR ((1 <= p53)) OR ((1 <= p55)) OR ((1 <= p57)) OR ((1 <= p59)) OR ((1 <= p61)) OR ((1 <= p63)) OR ((1 <= p0)) OR ((1 <= p65)) OR ((1 <= p2)) OR ((1 <= p67)) OR ((1 <= p4)) OR ((1 <= p69)) OR ((1 <= p6)) OR ((1 <= p71)) OR ((1 <= p8)) OR ((1 <= p73)) OR ((1 <= p10)) OR ((1 <= p75)) OR ((1 <= p12)) OR ((1 <= p77)) OR ((1 <= p14)) OR ((1 <= p79)) OR ((1 <= p16)) OR ((1 <= p81)) OR ((1 <= p18)) OR ((1 <= p83)) OR ((1 <= p20)) OR ((1 <= p22)) OR ((1 <= p24)) OR ((1 <= p89)) OR ((1 <= p26)) OR ((1 <= p91)) OR ((1 <= p28)) OR ((1 <= p30)) OR ((1 <= p32)) OR ((1 <= p34)) OR ((1 <= p36)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p42)) OR ((1 <= p44)) OR ((1 <= p46)) OR ((1 <= p48)) OR ((1 <= p50)) OR ((1 <= p52)) OR ((1 <= p54)) OR ((1 <= p56)) OR ((1 <= p58)) OR ((1 <= p60)) OR ((1 <= p62)))))",
"processed_size": 7556,
"rewrites": 53
},
"net":
{
"conflict_clusters": 101,
"singleton_clusters": 0
},
"result":
{
"edges": 7291,
"markings": 2088,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1757
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 100,
"adisj": 1,
"aneg": 0,
"comp": 280,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 280,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p123)))))",
"processed_size": 4514,
"rewrites": 53
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3514
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))",
"processed_size": 168,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"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": "A (G ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119)))))",
"processed_size": 336,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))))",
"processed_size": 185,
"rewrites": 53
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))",
"processed_size": 168,
"rewrites": 68
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"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": "A (G ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119)))))",
"processed_size": 336,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 475708,
"runtime": 56.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(G(E((** U **)))) OR E(F(A(X(**))))) : ((A(G(**)) OR (A(G(**)) AND A(F(A(G(**)))))) AND (A(G(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))) : A(G(**)) : E(X(E(F(*)))) : E((** U A((** U **)))) : (** AND A(G(**))) : E((** U A(X(**)))) : E(F(A(G(**)))) : (E(F(E(G(**)))) OR E(F((A(X(**)) AND **)))) : A(G(E(F(**)))) : A(G(A(F(**)))) : A(G(A(F(**)))) : A(G(E((** U **)))) : (E(G(E(X(**)))) OR E((A(G(**)) U **)))"
},
"net":
{
"arcs": 800,
"conflict_clusters": 101,
"places": 131,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 210
},
"result":
{
"preliminary_value": "yes no no yes yes no yes no yes yes no no yes yes ",
"value": "yes no no yes yes no yes no yes yes no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 341/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 131
lola: finding significant places
lola: 131 places, 210 transitions, 110 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: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p127 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: (A (G (E (((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))) U (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))))))) OR E (F (A (X ((((p115 <= 0)) AND ((p101 <= 0)) AND ((p116 <= 0)) AND ((p103 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p104 <= 0)) AND ((p107 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))))))) : (A ((A (G ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119))))) U A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))))))) AND ((((((((((A (G (((((p96 <= 0) OR (p127 <= 0)) AND ((p100 <= 0) OR (p117 <= 0)) AND ((p97 <= 0) OR (p126 <= 0)) AND ((p99 <= 0) OR (p118 <= 0)) AND ((p98 <= 0) OR (p125 <= 0)) AND ((p93 <= 0) OR (p130 <= 0)) AND ((p94 <= 0) OR (p129 <= 0)) AND ((p95 <= 0) OR (p128 <= 0)) AND ((p88 <= 0) OR (p120 <= 0)) AND ((p87 <= 0) OR (p119 <= 0))) OR (((p1 <= 0)) AND ((p64 <= 0)) AND ((p3 <= 0)) AND ((p66 <= 0)) AND ((p5 <= 0)) AND ((p68 <= 0)) AND ((p7 <= 0)) AND ((p70 <= 0)) AND ((p9 <= 0)) AND ((p72 <= 0)) AND ((p11 <= 0)) AND ((p74 <= 0)) AND ((p13 <= 0)) AND ((p76 <= 0)) AND ((p15 <= 0)) AND ((p78 <= 0)) AND ((p17 <= 0)) AND ((p80 <= 0)) AND ((p19 <= 0)) AND ((p82 <= 0)) AND ((p21 <= 0)) AND ((p84 <= 0)) AND ((p23 <= 0)) AND ((p86 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p90 <= 0)) AND ((p29 <= 0)) AND ((p92 <= 0)) AND ((p31 <= 0)) AND ((p33 <= 0)) AND ((p35 <= 0)) AND ((p37 <= 0)) AND ((p39 <= 0)) AND ((p41 <= 0)) AND ((p43 <= 0)) AND ((p45 <= 0)) AND ((p47 <= 0)) AND ((p49 <= 0)) AND ((p51 <= 0)) AND ((p53 <= 0)) AND ((p55 <= 0)) AND ((p57 <= 0)) AND ((p59 <= 0)) AND ((p61 <= 0)) AND ((p63 <= 0)) AND ((p0 <= 0)) AND ((p65 <= 0)) AND ((p2 <= 0)) AND ((p67 <= 0)) AND ((p4 <= 0)) AND ((p69 <= 0)) AND ((p6 <= 0)) AND ((p71 <= 0)) AND ((p8 <= 0)) AND ((p73 <= 0)) AND ((p10 <= 0)) AND ((p75 <= 0)) AND ((p12 <= 0)) AND ((p77 <= 0)) AND ((p14 <= 0)) AND ((p79 <= 0)) AND ((p16 <= 0)) AND ((p81 <= 0)) AND ((p18 <= 0)) AND ((p83 <= 0)) AND ((p20 <= 0)) AND ((p22 <= 0)) AND ((p24 <= 0)) AND ((p89 <= 0)) AND ((p26 <= 0)) AND ((p91 <= 0)) AND ((p28 <= 0)) AND ((p30 <= 0)) AND ((p32 <= 0)) AND ((p34 <= 0)) AND ((p36 <= 0)) AND ((p38 <= 0)) AND ((p40 <= 0)) AND ((p42 <= 0)) AND ((p44 <= 0)) AND ((p46 <= 0)) AND ((p48 <= 0)) AND ((p50 <= 0)) AND ((p52 <= 0)) AND ((p54 <= 0)) AND ((p56 <= 0)) AND ((p58 <= 0)) AND ((p60 <= 0)) AND ((p62 <= 0)))))) OR ((1 <= p115))) OR ((1 <= p101))) OR ((1 <= p103))) OR ((1 <= p116))) OR ((1 <= p102))) OR ((1 <= p106))) OR ((1 <= p107))) OR ((1 <= p104))) OR ((1 <= p105))) OR ((1 <= p108)))) : A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))))) : E (F (NOT(A (X (((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))) AND (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))))))))) : E ((((((p85 <= 0) OR (p97 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p94 <= 0) OR (p123 <= 0)) AND ((p85 <= 0) OR (p99 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p95 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p114 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p110 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p112 <= 0)) AND ((p85 <= 0) OR (p96 <= 0) OR (p122 <= 0)) AND ((p85 <= 0) OR (p100 <= 0) OR (p123 <= 0))) OR (((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))) U A (((((1 <= p1)) OR ((1 <= p64)) OR ((1 <= p3)) OR ((1 <= p66)) OR ((1 <= p5)) OR ((1 <= p68)) OR ((1 <= p7)) OR ((1 <= p70)) OR ((1 <= p9)) OR ((1 <= p72)) OR ((1 <= p11)) OR ((1 <= p74)) OR ((1 <= p13)) OR ((1 <= p76)) OR ((1 <= p15)) OR ((1 <= p78)) OR ((1 <= p17)) OR ((1 <= p80)) OR ((1 <= p19)) OR ((1 <= p82)) OR ((1 <= p21)) OR ((1 <= p84)) OR ((1 <= p23)) OR ((1 <= p86)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p90)) OR ((1 <= p29)) OR ((1 <= p92)) OR ((1 <= p31)) OR ((1 <= p33)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p39)) OR ((1 <= p41)) OR ((1 <= p43)) OR ((1 <= p45)) OR ((1 <= p47)) OR ((1 <= p49)) OR ((1 <= p51)) OR ((1 <= p53)) OR ((1 <= p55)) OR ((1 <= p57)) OR ((1 <= p59)) OR ((1 <= p61)) OR ((1 <= p63)) OR ((1 <= p0)) OR ((1 <= p65)) OR ((1 <= p2)) OR ((1 <= p67)) OR ((1 <= p4)) OR ((1 <= p69)) OR ((1 <= p6)) OR ((1 <= p71)) OR ((1 <= p8)) OR ((1 <= p73)) OR ((1 <= p10)) OR ((1 <= p75)) OR ((1 <= p12)) OR ((1 <= p77)) OR ((1 <= p14)) OR ((1 <= p79)) OR ((1 <= p16)) OR ((1 <= p81)) OR ((1 <= p18)) OR ((1 <= p83)) OR ((1 <= p20)) OR ((1 <= p22)) OR ((1 <= p24)) OR ((1 <= p89)) OR ((1 <= p26)) OR ((1 <= p91)) OR ((1 <= p28)) OR ((1 <= p30)) OR ((1 <= p32)) OR ((1 <= p34)) OR ((1 <= p36)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p42)) OR ((1 <= p44)) OR ((1 <= p46)) OR ((1 <= p48)) OR ((1 <= p50)) OR ((1 <= p52)) OR ((1 <= p54)) OR ((1 <= p56)) OR ((1 <= p58)) OR ((1 <= p60)) OR ((1 <= p62))) U (((1 <= p1)) OR ((1 <= p64)) OR ((1 <= p3)) OR ((1 <= p66)) OR ((1 <= p5)) OR ((1 <= p68)) OR ((1 <= p7)) OR ((1 <= p70)) OR ((1 <= p9)) OR ((1 <= p72)) OR ((1 <= p11)) OR ((1 <= p74)) OR ((1 <= p13)) OR ((1 <= p76)) OR ((1 <= p15)) OR ((1 <= p78)) OR ((1 <= p17)) OR ((1 <= p80)) OR ((1 <= p19)) OR ((1 <= p82)) OR ((1 <= p21)) OR ((1 <= p84)) OR ((1 <= p23)) OR ((1 <= p86)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p90)) OR ((1 <= p29)) OR ((1 <= p92)) OR ((1 <= p31)) OR ((1 <= p33)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p39)) OR ((1 <= p41)) OR ((1 <= p43)) OR ((1 <= p45)) OR ((1 <= p47)) OR ((1 <= p49)) OR ((1 <= p51)) OR ((1 <= p53)) OR ((1 <= p55)) OR ((1 <= p57)) OR ((1 <= p59)) OR ((1 <= p61)) OR ((1 <= p63)) OR ((1 <= p0)) OR ((1 <= p65)) OR ((1 <= p2)) OR ((1 <= p67)) OR ((1 <= p4)) OR ((1 <= p69)) OR ((1 <= p6)) OR ((1 <= p71)) OR ((1 <= p8)) OR ((1 <= p73)) OR ((1 <= p10)) OR ((1 <= p75)) OR ((1 <= p12)) OR ((1 <= p77)) OR ((1 <= p14)) OR ((1 <= p79)) OR ((1 <= p16)) OR ((1 <= p81)) OR ((1 <= p18)) OR ((1 <= p83)) OR ((1 <= p20)) OR ((1 <= p22)) OR ((1 <= p24)) OR ((1 <= p89)) OR ((1 <= p26)) OR ((1 <= p91)) OR ((1 <= p28)) OR ((1 <= p30)) OR ((1 <= p32)) OR ((1 <= p34)) OR ((1 <= p36)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p42)) OR ((1 <= p44)) OR ((1 <= p46)) OR ((1 <= p48)) OR ((1 <= p50)) OR ((1 <= p52)) OR ((1 <= p54)) OR ((1 <= p56)) OR ((1 <= p58)) OR ((1 <= p60)) OR ((1 <= p62))))))) : ((((p1 <= 0)) AND ((p64 <= 0)) AND ((p3 <= 0)) AND ((p66 <= 0)) AND ((p5 <= 0)) AND ((p68 <= 0)) AND ((p7 <= 0)) AND ((p70 <= 0)) AND ((p9 <= 0)) AND ((p72 <= 0)) AND ((p11 <= 0)) AND ((p74 <= 0)) AND ((p13 <= 0)) AND ((p76 <= 0)) AND ((p15 <= 0)) AND ((p78 <= 0)) AND ((p17 <= 0)) AND ((p80 <= 0)) AND ((p19 <= 0)) AND ((p82 <= 0)) AND ((p21 <= 0)) AND ((p84 <= 0)) AND ((p23 <= 0)) AND ((p86 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p90 <= 0)) AND ((p29 <= 0)) AND ((p92 <= 0)) AND ((p31 <= 0)) AND ((p33 <= 0)) AND ((p35 <= 0)) AND ((p37 <= 0)) AND ((p39 <= 0)) AND ((p41 <= 0)) AND ((p43 <= 0)) AND ((p45 <= 0)) AND ((p47 <= 0)) AND ((p49 <= 0)) AND ((p51 <= 0)) AND ((p53 <= 0)) AND ((p55 <= 0)) AND ((p57 <= 0)) AND ((p59 <= 0)) AND ((p61 <= 0)) AND ((p63 <= 0)) AND ((p0 <= 0)) AND ((p65 <= 0)) AND ((p2 <= 0)) AND ((p67 <= 0)) AND ((p4 <= 0)) AND ((p69 <= 0)) AND ((p6 <= 0)) AND ((p71 <= 0)) AND ((p8 <= 0)) AND ((p73 <= 0)) AND ((p10 <= 0)) AND ((p75 <= 0)) AND ((p12 <= 0)) AND ((p77 <= 0)) AND ((p14 <= 0)) AND ((p79 <= 0)) AND ((p16 <= 0)) AND ((p81 <= 0)) AND ((p18 <= 0)) AND ((p83 <= 0)) AND ((p20 <= 0)) AND ((p22 <= 0)) AND ((p24 <= 0)) AND ((p89 <= 0)) AND ((p26 <= 0)) AND ((p91 <= 0)) AND ((p28 <= 0)) AND ((p30 <= 0)) AND ((p32 <= 0)) AND ((p34 <= 0)) AND ((p36 <= 0)) AND ((p38 <= 0)) AND ((p40 <= 0)) AND ((p42 <= 0)) AND ((p44 <= 0)) AND ((p46 <= 0)) AND ((p48 <= 0)) AND ((p50 <= 0)) AND ((p52 <= 0)) AND ((p54 <= 0)) AND ((p56 <= 0)) AND ((p58 <= 0)) AND ((p60 <= 0)) AND ((p62 <= 0))) AND A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p94) AND (1 <= p123)) OR ((1 <= p85) AND (1 <= p99) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p113)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p95) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p114)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p110)) OR ((1 <= p85) AND (1 <= p87) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p112)) OR ((1 <= p85) AND (1 <= p96) AND (1 <= p122)) OR ((1 <= p85) AND (1 <= p100) AND (1 <= p123)))))) : E (((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))) U A (X (((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119))) AND (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)))))))) : E (F (A (G (((((1 <= p1)) OR ((1 <= p64)) OR ((1 <= p3)) OR ((1 <= p66)) OR ((1 <= p5)) OR ((1 <= p68)) OR ((1 <= p7)) OR ((1 <= p70)) OR ((1 <= p9)) OR ((1 <= p72)) OR ((1 <= p11)) OR ((1 <= p74)) OR ((1 <= p13)) OR ((1 <= p76)) OR ((1 <= p15)) OR ((1 <= p78)) OR ((1 <= p17)) OR ((1 <= p80)) OR ((1 <= p19)) OR ((1 <= p82)) OR ((1 <= p21)) OR ((1 <= p84)) OR ((1 <= p23)) OR ((1 <= p86)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p90)) OR ((1 <= p29)) OR ((1 <= p92)) OR ((1 <= p31)) OR ((1 <= p33)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p39)) OR ((1 <= p41)) OR ((1 <= p43)) OR ((1 <= p45)) OR ((1 <= p47)) OR ((1 <= p49)) OR ((1 <= p51)) OR ((1 <= p53)) OR ((1 <= p55)) OR ((1 <= p57)) OR ((1 <= p59)) OR ((1 <= p61)) OR ((1 <= p63)) OR ((1 <= p0)) OR ((1 <= p65)) OR ((1 <= p2)) OR ((1 <= p67)) OR ((1 <= p4)) OR ((1 <= p69)) OR ((1 <= p6)) OR ((1 <= p71)) OR ((1 <= p8)) OR ((1 <= p73)) OR ((1 <= p10)) OR ((1 <= p75)) OR ((1 <= p12)) OR ((1 <= p77)) OR ((1 <= p14)) OR ((1 <= p79)) OR ((1 <= p16)) OR ((1 <= p81)) OR ((1 <= p18)) OR ((1 <= p83)) OR ((1 <= p20)) OR ((1 <= p22)) OR ((1 <= p24)) OR ((1 <= p89)) OR ((1 <= p26)) OR ((1 <= p91)) OR ((1 <= p28)) OR ((1 <= p30)) OR ((1 <= p32)) OR ((1 <= p34)) OR ((1 <= p36)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p42)) OR ((1 <= p44)) OR ((1 <= p46)) OR ((1 <= p48)) OR ((1 <= p50)) OR ((1 <= p52)) OR ((1 <= p54)) OR ((1 <= p56)) OR ((1 <= p58)) OR ((1 <= p60)) OR ((1 <= p62))) AND (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)))))))) : E (F ((E (G ((((1 <= p8)) OR ((1 <= p27))))) OR (A (X (((1 <= p61)))) AND ((1 <= p16)))))) : A (G (E (F (((1 <= p43)))))) : A (G (A (F (((p85 <= 0) OR (p95 <= 0) OR (p109 <= 0) OR (p88 <= 0) OR (p120 <= 0)))))) : A (G (A (F (((p85 <= 0) OR (p88 <= 0) OR (p113 <= 0) OR (p94 <= 0) OR (p123 <= 0)))))) : A (G (E ((((p37 <= 0)) U ((p30 <= 0)))))) : (E (G (E (X ((((1 <= p85) AND (1 <= p94) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p124))))))) OR E ((A (G (((1 <= p30)))) U ((1 <= p60)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))) U (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))))))) OR E (F (A (X ((((p115 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))) U (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))) U (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)))))
lola: processed formula length: 364
lola: 53 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: 69 markings, 251 edges
lola: ========================================
lola: subprocess 1 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((((p115 <= 0)) AND ((p101 <= 0)) AND ((p116 <= 0)) AND ((p103 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p104 <= 0)) AND ((p107 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AX((((p115 <= 0)) AND ((p101 <= 0)) AND ((p116 <= 0)) AND ((p103 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p104 <= 0)) AND ((p107 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))))
lola: processed formula length: 185
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 209 markings, 547 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0))) OR (((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0))) OR (((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0))))
lola: processed formula length: 361
lola: 53 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))) U A (X (((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))) U AX(((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AN... (shortened)
lola: processed formula length: 699
lola: 53 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((((1 <= p8)) OR ((1 <= p27))))))) OR E (F ((A (X (((1 <= p61)))) AND ((1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((((1 <= p8)) OR ((1 <= p27)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (((1 <= p8)) OR ((1 <= p27)))
lola: processed formula length: 30
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 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 <= p8)) OR ((1 <= p27)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 13 markings, 13 edges
lola: state equation: write sara problem file to CTLFireability-3-1.sara
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: (((p8 <= 0)) AND ((p27 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
sara: try reading problem file CTLFireability-3-0.sara.
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((((1 <= p85) AND (1 <= p94) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p124))))))) OR E ((A (G (((1 <= p30)))) U ((1 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: (EG(EX((((1 <= p85) AND (1 <= p94) AND (1 <= p124)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p124))))) OR E(AG(((1 <= p30))) U ((1 <= p60))))
lola: processed formula length: 141
lola: 55 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: ========================================
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))))
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 ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))))
lola: processed formula length: 185
lola: 53 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: (((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p43))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p43))
lola: processed formula length: 12
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p43 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p43))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
lola: state equation: write sara problem file to CTLFireability-6-1.sara
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 461879 markings, 957693 edges, 92376 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 877469 markings, 1929494 edges, 83118 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 1285988 markings, 3011707 edges, 81704 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 1299078 markings, 3063987 edges
lola: ========================================
lola: subprocess 7 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p85 <= 0) OR (p88 <= 0) OR (p113 <= 0) OR (p94 <= 0) OR (p123 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p85) AND (1 <= p88) AND (1 <= p113) AND (1 <= p94) AND (1 <= p123))
lola: processed formula length: 74
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p85 <= 0) OR (p88 <= 0) OR (p113 <= 0) OR (p94 <= 0) OR (p123 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 5 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p85) AND (1 <= p88) AND (1 <= p113) AND (1 <= p94) AND (1 <= p123))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 12 markings, 12 edges
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.
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: ========================================
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLFireability-7-1.sara.

sara: place or transition ordering is non-deterministic

lola: subprocess 8 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p85 <= 0) OR (p95 <= 0) OR (p109 <= 0) OR (p88 <= 0) OR (p120 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p85) AND (1 <= p95) AND (1 <= p109) AND (1 <= p88) AND (1 <= p120))
lola: processed formula length: 74
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
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: rewrite Frontend/Parser/formula_rewrite.k:700
lola: The predicate does not eventually occur from all states.
lola: 12 markings, 12 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p85) AND (1 <= p95) AND (1 <= p109) AND (1 <= p88) AND (1 <= p120))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((((1 <= p1)) OR ((1 <= p64)) OR ((1 <= p3)) OR ((1 <= p66)) OR ((1 <= p5)) OR ((1 <= p68)) OR ((1 <= p7)) OR ((1 <= p70)) OR ((1 <= p9)) OR ((1 <= p72)) OR ((1 <= p11)) OR ((1 <= p74)) OR ((1 <= p13)) OR ((1 <= p76)) OR ((1 <= p15)) OR ((1 <= p78)) OR ((1 <= p17)) OR ((1 <= p80)) OR ((1 <= p19)) OR ((1 <= p82)) OR ((1 <= p21)) OR ((1 <= p84)) OR ((1 <= p23)) 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: ((((p1 <= 0)) AND ((p64 <= 0)) AND ((p3 <= 0)) AND ((p66 <= 0)) AND ((p5 <= 0)) AND ((p68 <= 0)) AND ((p7 <= 0)) AND ((p70 <= 0)) AND ((p9 <= 0)) AND ((p72 <= 0)) AND ((p11 <= 0)) AND ((p74 <= 0)) AND ((p13 <= 0)) AND ((p76 <= 0)) AND ((p15 <= 0)) AND ((p78 <= 0)) AND ((p17 <= 0)) AND ((p80 <= 0)) AND ((p19 <= 0)) AND ((p82 <= 0)) AND ((p21 <= 0)) AND ((p84 <= 0)) AND ((p23 <= 0)) AND ((p86 <= 0))... (shortened)
lola: processed formula length: 1701
lola: 55 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 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 1
lola: formula 1: ((((p1 <= 0)) AND ((p64 <= 0)) AND ((p3 <= 0)) AND ((p66 <= 0)) AND ((p5 <= 0)) AND ((p68 <= 0)) AND ((p7 <= 0)) AND ((p70 <= 0)) AND ((p9 <= 0)) AND ((p72 <= 0)) AND ((p11 <= 0)) AND ((p74 <= 0)) AND ((p13 <= 0)) AND ((p76 <= 0)) AND ((p15 <= 0)) AND ((p78 <= 0)) AND ((p17 <= 0)) AND ((p80 <= 0)) AND ((p19 <= 0)) AND ((p82 <= 0)) AND ((p21 <= 0)) AND ((p84 <= 0)) AND ((p23 <= 0)) AND ((p86 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p90 <= 0)) AND ((p29 <= 0)) AND ((p92 <= 0)) AND ((p31 <= 0)) AND ((p33 <= 0)) AND ((p35 <= 0)) AND ((p37 <= 0)) AND ((p39 <= 0)) AND ((p41 <= 0)) AND ((p43 <= 0)) AND ((p45 <= 0)) AND ((p47 <= 0)) AND ((p49 <= 0)) AND ((p51 <= 0)) AND ((p53 <= 0)) AND ((p55 <= 0)) AND ((p57 <= 0)) AND ((p59 <= 0)) AND ((p61 <= 0)) AND ((p63 <= 0)) AND ((p0 <= 0)) AND ((p65 <= 0)) AND ((p2 <= 0)) AND ((p67 <= 0)) AND ((p4 <= 0)) AND ((p69 <= 0)) AND ((p6 <= 0)) AND ((p71 <= 0)) AND ((p8 <= 0)) AND ((p73 <= 0)) AND ((p10 <= 0)) AND ((p75 <= 0)) AND ((p12 <= 0)) AND ((p77 <= 0)) AND ((p14 <= 0)) AND ((p79 <= 0)) AND ((p16 <= 0)) AND ((p81 <= 0)) AND ((p18 <= 0)) AND ((p83 <= 0)) AND ((p20 <= 0)) AND ((p22 <= 0)) AND ((p24 <= 0)) AND ((p89 <= 0)) AND ((p26 <= 0)) AND ((p91 <= 0)) AND ((p28 <= 0)) AND ((p30 <= 0)) AND ((p32 <= 0)) AND ((p34 <= 0)) AND ((p36 <= 0)) AND ((p38 <= 0)) AND ((p40 <= 0)) AND ((p42 <= 0)) AND ((p44 <= 0)) AND ((p46 <= 0)) AND ((p48 <= 0)) AND ((p50 <= 0)) AND ((p52 <= 0)) AND ((p54 <= 0)) AND ((p56 <= 0)) AND ((p58 <= 0)) AND ((p60 <= 0)) AND ((p62 <= 0))) OR (((p115 <= 0)) AND ((p101 <= 0)) AND ((p116 <= 0)) AND ((p103 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p104 <= 0)) AND ((p107 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 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 100 literals and 2 conjunctive subformulas
lola: formula 0: ((((1 <= p1)) OR ((1 <= p64)) OR ((1 <= p3)) OR ((1 <= p66)) OR ((1 <= p5)) OR ((1 <= p68)) OR ((1 <= p7)) OR ((1 <= p70)) OR ((1 <= p9)) OR ((1 <= p72)) OR ((1 <= p11)) OR ((1 <= p74)) OR ((1 <= p13)) OR ((1 <= p76)) OR ((1 <= p15)) OR ((1 <= p78)) OR ((1 <= p17)) OR ((1 <= p80)) OR ((1 <= p19)) OR ((1 <= p82)) OR ((1 <= p21)) OR ((1 <= p84)) OR ((1 <= p23)) OR ((1 <= p86)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p90)) OR ((1 <= p29)) OR ((1 <= p92)) OR ((1 <= p31)) OR ((1 <= p33)) OR ((1 <= p35)) OR ((1 <= p37)) OR ((1 <= p39)) OR ((1 <= p41)) OR ((1 <= p43)) OR ((1 <= p45)) OR ((1 <= p47)) OR ((1 <= p49)) OR ((1 <= p51)) OR ((1 <= p53)) OR ((1 <= p55)) OR ((1 <= p57)) OR ((1 <= p59)) OR ((1 <= p61)) OR ((1 <= p63)) OR ((1 <= p0)) OR ((1 <= p65)) OR ((1 <= p2)) OR ((1 <= p67)) OR ((1 <= p4)) OR ((1 <= p69)) OR ((1 <= p6)) OR ((1 <= p71)) OR ((1 <= p8)) OR ((1 <= p73)) OR ((1 <= p10)) OR ((1 <= p75)) OR ((1 <= p12)) OR ((1 <= p77)) OR ((1 <= p14)) OR ((1 <= p79)) OR ((1 <= p16)) OR ((1 <= p81)) OR ((1 <= p18)) OR ((1 <= p83)) OR ((1 <= p20)) OR ((1 <= p22)) OR ((1 <= p24)) OR ((1 <= p89)) OR ((1 <= p26)) OR ((1 <= p91)) OR ((1 <= p28)) OR ((1 <= p30)) OR ((1 <= p32)) OR ((1 <= p34)) OR ((1 <= p36)) OR ((1 <= p38)) OR ((1 <= p40)) OR ((1 <= p42)) OR ((1 <= p44)) OR ((1 <= p46)) OR ((1 <= p48)) OR ((1 <= p50)) OR ((1 <= p52)) OR ((1 <= p54)) OR ((1 <= p56)) OR ((1 <= p58)) OR ((1 <= p60)) OR ((1 <= p62))) AND (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108))))
lola: state equation: write sara problem file to CTLFireability-9-1.sara
lola: state equation: calling and running sara
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1800 literals and 900 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
sara: try reading problem file CTLFireability-9-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
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 || 1168772 markings, 4624193 edges, 233754 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 1830519 markings, 7768530 edges
lola: ========================================
lola: subprocess 10 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E ((((p37 <= 0)) U ((p30 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(E(((p37 <= 0)) U ((p30 <= 0))))
lola: processed formula length: 34
lola: 53 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: 622612 markings, 5131876 edges, 124522 markings/sec, 0 secs
lola: 1093927 markings, 10310793 edges, 94263 markings/sec, 5 secs
lola: 1500211 markings, 14993106 edges, 81257 markings/sec, 10 secs
lola: 1827779 markings, 19331501 edges, 65514 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1830519 markings, 21337017 edges
lola: ========================================
lola: subprocess 11 will run for 1171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((((p85 <= 0) OR (p97 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p111 <= 0)) AND ((p85 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((((p85 <= 0) OR (p97 <= 0) OR (p109 <= 0)) AND ((p85 <= 0) OR (p88 <= 0) OR (p121 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p93 <= 0) OR (p124 <= 0)) AND ((p85 <= 0) OR (p97 <= 0) OR (p113 <= 0)) AND ((p85 <= 0) OR (p87 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) OR (p98 <= 0) OR (p111 <= 0)) AND ((p85 <= 0) ... (shortened)
lola: processed formula length: 7556
lola: 53 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: 2088 markings, 7291 edges
lola: ========================================
lola: subprocess 12 will run for 1757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p1 <= 0)) AND ((p64 <= 0)) AND ((p3 <= 0)) AND ((p66 <= 0)) AND ((p5 <= 0)) AND ((p68 <= 0)) AND ((p7 <= 0)) AND ((p70 <= 0)) AND ((p9 <= 0)) AND ((p72 <= 0)) AND ((p11 <= 0)) AND ((p74 <= 0)) AND ((p13 <= 0)) AND ((p76 <= 0)) AND ((p15 <= 0)) AND ((p78 <= 0)) AND ((p17 <= 0)) AND ((p80 <= 0)) AND ((p19 <= 0)) AND ((p82 <= 0)) AND ((p21 <= 0)) AND ((p84 <= 0)) AND ((p23 <= 0)) AND ((p86 <= 0))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p113)) OR ((1 <= p85) AND (1 <=... (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 ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p116)) OR ((1 <= p103)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p104)) OR ((1 <= p107)) OR ((1 <= p105)) OR ((1 <= p108)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p109)) OR ((1 <= p85) AND (1 <= p88) AND (1 <= p121)) OR ((1 <= p85) AND (1 <= p97) AND (1 <= p111)) OR ((1 <= p85) AND (1 <= p98) AND (1 <= p113)) OR ((1 <= p85) AND (1 <=... (shortened)
lola: processed formula length: 4514
lola: 53 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: state equation task get result unparse finished++ id 0
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 3514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))))) OR (A (G ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p115)) OR (((1 <= p101)) OR (((1 <= p103)) OR (((1 <= p116)) OR (((1 <= p102)) OR (((1 <= p106)) OR (((1 <= p107)) OR (((1 <= p104)) OR (((1 <= p105)) OR ((1 <= p108)))))))))))
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: processed formula: (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))
lola: processed formula length: 168
lola: 68 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 10 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: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119)))))
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 ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119)))))
lola: processed formula length: 336
lola: 53 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
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: (((p96 <= 0) OR (p127 <= 0)) AND ((p100 <= 0) OR (p117 <= 0)) AND ((p97 <= 0) OR (p126 <= 0)) AND ((p99 <= 0) OR (p118 <= 0)) AND ((p98 <= 0) OR (p125 <= 0)) AND ((p93 <= 0) OR (p130 <= 0)) AND ((p94 <= 0) OR (p129 <= 0)) AND ((p95 <= 0) OR (p128 <= 0)) AND ((p88 <= 0) OR (p120 <= 0)) AND ((p87 <= 0) OR (p119 <= 0)))
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108))))) OR (A (G ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))))
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 ((((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))))
lola: processed formula length: 185
lola: 53 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: (((p115 <= 0)) AND ((p101 <= 0)) AND ((p103 <= 0)) AND ((p116 <= 0)) AND ((p102 <= 0)) AND ((p106 <= 0)) AND ((p107 <= 0)) AND ((p104 <= 0)) AND ((p105 <= 0)) AND ((p108 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: ...considering subproblem: (((1 <= p115)) OR (((1 <= p101)) OR (((1 <= p103)) OR (((1 <= p116)) OR (((1 <= p102)) OR (((1 <= p106)) OR (((1 <= p107)) OR (((1 <= p104)) OR (((1 <= p105)) OR ((1 <= p108)))))))))))
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: processed formula: (((1 <= p115)) OR ((1 <= p101)) OR ((1 <= p103)) OR ((1 <= p116)) OR ((1 <= p102)) OR ((1 <= p106)) OR ((1 <= p107)) OR ((1 <= p104)) OR ((1 <= p105)) OR ((1 <= p108)))
lola: processed formula length: 168
lola: 68 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 10 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: ========================================
lola: ...considering subproblem: A (G ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119)))))
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 ((((1 <= p96) AND (1 <= p127)) OR ((1 <= p100) AND (1 <= p117)) OR ((1 <= p97) AND (1 <= p126)) OR ((1 <= p99) AND (1 <= p118)) OR ((1 <= p98) AND (1 <= p125)) OR ((1 <= p93) AND (1 <= p130)) OR ((1 <= p94) AND (1 <= p129)) OR ((1 <= p95) AND (1 <= p128)) OR ((1 <= p88) AND (1 <= p120)) OR ((1 <= p87) AND (1 <= p119)))))
lola: processed formula length: 336
lola: 53 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes no yes no yes yes no no yes yes
lola:
preliminary result: yes no no yes yes no yes no yes yes no no yes yes
lola: memory consumption: 475708 KB
lola: time consumption: 56 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: 15673096 kB
After kill :
MemTotal: 16427332 kB
MemFree: 15673032 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="SharedMemory-PT-000010"
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 SharedMemory-PT-000010, 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 r186-oct2-158987939200556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 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 ;