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-158987939200546.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-000005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939200546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 5.6K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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 5.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 83K 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-000005-00
FORMULA_NAME SharedMemory-PT-000005-01
FORMULA_NAME SharedMemory-PT-000005-02
FORMULA_NAME SharedMemory-PT-000005-03
FORMULA_NAME SharedMemory-PT-000005-04
FORMULA_NAME SharedMemory-PT-000005-05
FORMULA_NAME SharedMemory-PT-000005-06
FORMULA_NAME SharedMemory-PT-000005-07
FORMULA_NAME SharedMemory-PT-000005-08
FORMULA_NAME SharedMemory-PT-000005-09
FORMULA_NAME SharedMemory-PT-000005-10
FORMULA_NAME SharedMemory-PT-000005-11
FORMULA_NAME SharedMemory-PT-000005-12
FORMULA_NAME SharedMemory-PT-000005-13
FORMULA_NAME SharedMemory-PT-000005-14
FORMULA_NAME SharedMemory-PT-000005-15

=== Now, execution of the tool begins

BK_START 1591251419998

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 06:17:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 06:17:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:17:03] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-06-04 06:17:03] [INFO ] Transformed 41 places.
[2020-06-04 06:17:03] [INFO ] Transformed 55 transitions.
[2020-06-04 06:17:03] [INFO ] Found NUPN structural information;
[2020-06-04 06:17:03] [INFO ] Parsed PT model containing 41 places and 55 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 362 steps, including 0 resets, run visited all 68 properties in 13 ms. (steps per millisecond=27 )
[2020-06-04 06:17:03] [INFO ] Flatten gal took : 26 ms
[2020-06-04 06:17:03] [INFO ] Applying decomposition
[2020-06-04 06:17:03] [INFO ] Flatten gal took : 9 ms
[2020-06-04 06:17:03] [INFO ] Decomposing Gal with order
[2020-06-04 06:17:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 06:17:03] [INFO ] Removed a total of 60 redundant transitions.
[2020-06-04 06:17:03] [INFO ] Flatten gal took : 35 ms
[2020-06-04 06:17:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-06-04 06:17:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2020-06-04 06:17:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SharedMemory-PT-000005 @ 3570 seconds

FORMULA SharedMemory-PT-000005-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000005-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000005-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SharedMemory-PT-000005-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000005-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000005-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SharedMemory-PT-000005-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000005-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000005-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SharedMemory-PT-000005-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-PT-000005-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ SharedMemory-PT-000005

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 4,
"U": 0,
"X": 1,
"aconj": 15,
"adisj": 43,
"aneg": 0,
"comp": 135,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 135,
"taut": 0,
"tconj": 41,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((F ((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31)))) AND (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p35 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p35 <= 0)) AND (((p19 <= 0) OR (p21 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p21 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p21 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p35 <= 0)) AND ((p19 <= 0) OR (p21 <= 0) OR (p35 <= 0)))))))))))))))))))))))) AND G (((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31))) OR X (G ((F ((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31)))) AND (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p35 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p35 <= 0)) AND (((p19 <= 0) OR (p21 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p24 <= 0) OR (p29 <= 0)) AND (((p19 <= 0) OR (p21 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p21 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p23 <= 0) OR (p35 <= 0)) AND ((p19 <= 0) OR (p21 <= 0) OR (p35 <= 0)))))))))))))))))))))))))))))",
"processed_size": 2255,
"rewrites": 482
},
"result":
{
"edges": 147,
"markings": 75,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 33
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 1,
"aconj": 41,
"adisj": 27,
"aneg": 0,
"comp": 65,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 65,
"taut": 0,
"tconj": 20,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "(F ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) U (X ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((p0 <= 0)) AND (((p1 <= 0)) AND (((p2 <= 0)) AND (((p3 <= 0)) AND (((p4 <= 0)) AND (((p5 <= 0)) AND (((p6 <= 0)) AND (((p7 <= 0)) AND (((p8 <= 0)) AND (((p9 <= 0)) AND (((p10 <= 0)) AND (((p11 <= 0)) AND (((p12 <= 0)) AND (((p13 <= 0)) AND (((p14 <= 0)) AND (((p15 <= 0)) AND (((p16 <= 0)) AND (((p17 <= 0)) AND (((p18 <= 0)) AND ((p20 <= 0))))))))))))))))))))))) U (((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))))",
"processed_size": 1128,
"rewrites": 482
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 46
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 21,
"aneg": 2,
"comp": 80,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "F ((F ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) OR (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p22 <= 0) OR (p33 <= 0)) AND ((p19 <= 0) OR (p26 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p26 <= 0) OR (p35 <= 0)) AND ((p19 <= 0) OR (p22 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p22 <= 0) OR (p35 <= 0)) AND ((p19 <= 0) OR (p21 <= 0) OR (p29 <= 0)) AND ((p19 <= 0) OR (p24 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p26 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p26 <= 0) OR (p29 <= 0)) AND ((p19 <= 0) OR (p24 <= 0) OR (p33 <= 0)) AND ((p19 <= 0) OR (p23 <= 0) OR (p29 <= 0)) AND ((p19 <= 0) OR (p24 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p24 <= 0) OR (p29 <= 0)) AND ((p19 <= 0) OR (p21 <= 0) OR (p36 <= 0)) AND ((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) OR (p23 <= 0) OR (p33 <= 0)) AND ((p19 <= 0) OR (p21 <= 0) OR (p33 <= 0)) AND ((p19 <= 0) OR (p23 <= 0) OR (p35 <= 0)) AND ((p19 <= 0) OR (p21 <= 0) OR (p35 <= 0)))))",
"processed_size": 1278,
"rewrites": 482
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 40,
"adisj": 2,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20))))))",
"processed_size": 673,
"rewrites": 482
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 25,
"adisj": 2,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "F (G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40))))))",
"processed_size": 503,
"rewrites": 482
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 30,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "X (((X ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) OR (((p0 <= 0)) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p16 <= 0)) AND ((p17 <= 0)) AND ((p18 <= 0)) AND ((p20 <= 0)))) U (((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))))",
"processed_size": 510,
"rewrites": 482
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p1)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33)))",
"processed_size": 59,
"rewrites": 483
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"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": "X (X (G ((((p4 <= 0)) R ((1 <= p20))))))",
"processed_size": 40,
"rewrites": 482
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((((1 <= p27)) OR ((1 <= p7))))))",
"processed_size": 42,
"rewrites": 482
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"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": "F (G ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))))",
"processed_size": 90,
"rewrites": 482
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 15,
"adisj": 3,
"aneg": 2,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((F ((G ((((p21 <= 0) OR (p39 <= 0)) AND ((p22 <= 0) OR (p34 <= 0)) AND ((p26 <= 0) OR (p38 <= 0)) AND ((p23 <= 0) OR (p37 <= 0)) AND ((p24 <= 0) OR (p40 <= 0)))) OR (((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0))))) AND (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40))))))",
"processed_size": 425,
"rewrites": 482
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 75,
"adisj": 4,
"aneg": 0,
"comp": 170,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 170,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "G ((((((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40))) U (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p35)))) OR (G (F ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20))))) AND F ((((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p35)))))))",
"processed_size": 2712,
"rewrites": 482
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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 <= p24) AND (1 <= p40))",
"processed_size": 27,
"rewrites": 482
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p24) AND (1 <= p40)) OR (G (F (((1 <= p6)))) AND F (((1 <= p24) AND (1 <= p40)))))))",
"processed_size": 98,
"rewrites": 482
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 196648,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((F(G((F(**) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))))))))))))) AND G((** OR X(G((F(**) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))))))))))))))))) : G(((** U **) OR (G(F(**)) AND F(**)))) : F(G(*)) : (F(**) U (X((G(**) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))))))))))) U **)) : (F((F(*) OR *)) AND X(G((G(**) AND **)))) : (X(X(F(**))) AND F(G((G(**) AND **)))) : X(((X(**) OR **) U **)) : F(G((F((G(*) OR *)) AND **))) : X((G(*) OR F(*))) : ((G(*) R X(F(**))) AND G(*)) : (X(X(((F(**) U **) OR **))) OR (** OR **)) : (** OR (G(F((** OR (G(F(**)) AND F(**))))) AND F(**))) : (X(X((F(**) AND **))) U (X(**) AND **)) : X(X(G((* R *)))) : (F(G(*)) OR (G((X(**) AND (G(*) OR (** OR (** OR **))))) AND F(G(*)))) : X(X(G(**)))"
},
"net":
{
"arcs": 200,
"conflict_clusters": 26,
"places": 41,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 55
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no no no no no ",
"value": "no no no no no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 96/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 41
lola: finding significant places
lola: 41 places, 55 transitions, 30 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 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: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: X (G (F (X (X (G (((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31))) U G (X (((((((((((((((((((((F ((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31)))) AND ((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0))) AND ((p19 <= 0) OR (p22 <= 0) OR (p33 <= 0))) AND ((p19 <= 0) OR (p26 <= 0) OR (p36 <= 0))) AND ((p19 <= 0) OR (p26 <= 0) OR (p35 <= 0))) AND ((p19 <= 0) OR (p22 <= 0) OR (p36 <= 0))) AND ((p19 <= 0) OR (p22 <= 0) OR (p35 <= 0))) AND ((p19 <= 0) OR (p21 <= 0) OR (p29 <= 0))) AND ((p19 <= 0) OR (p24 <= 0) OR (p36 <= 0))) AND ((p19 <= 0) OR (p26 <= 0) OR (p30 <= 0))) AND ((p19 <= 0) OR (p26 <= 0) OR (p29 <= 0))) AND ((p19 <= 0) OR (p24 <= 0) OR (p33 <= 0))) AND ((p19 <= 0) OR (p23 <= 0) OR (p29 <= 0))) AND ((p19 <= 0) OR (p24 <= 0) OR (p30 <= 0))) AND ((p19 <= 0) OR (p24 <= 0) OR (p29 <= 0))) AND ((p19 <= 0) OR (p21 <= 0) OR (p36 <= 0))) AND ((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0))) AND ((p19 <= 0) OR (p23 <= 0) OR (p33 <= 0))) AND ((p19 <= 0) OR (p21 <= 0) OR (p33 <= 0))) AND ((p19 <= 0) OR (p23 <= 0) OR (p35 <= 0))) AND ((p19 <= 0) OR (p21 <= 0) OR (p35 <= 0)))))))))))) : G ((G (F (G (F ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20))))))) U ((((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40))) U (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p35)))))) : F (NOT(G (((X (((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0))) OR (((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0))))) AND (((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31)))) U F ((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31)))))))) : (F ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) U (X (((((((((((((((((((((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND ((p0 <= 0))) AND ((p1 <= 0))) AND ((p2 <= 0))) AND ((p3 <= 0))) AND ((p4 <= 0))) AND ((p5 <= 0))) AND ((p6 <= 0))) AND ((p7 <= 0))) AND ((p8 <= 0))) AND ((p9 <= 0))) AND ((p10 <= 0))) AND ((p11 <= 0))) AND ((p12 <= 0))) AND ((p13 <= 0))) AND ((p14 <= 0))) AND ((p15 <= 0))) AND ((p16 <= 0))) AND ((p17 <= 0))) AND ((p18 <= 0))) AND ((p20 <= 0)))) U (((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20))))) : (NOT(G ((G ((((p0 <= 0)) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p16 <= 0)) AND ((p17 <= 0)) AND ((p18 <= 0)) AND ((p20 <= 0)))) AND (((1 <= p19) AND (1 <= p22) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p26) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p29)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p36)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p33)) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p35)) OR ((1 <= p19) AND (1 <= p21) AND (1 <= p35)))))) AND NOT(X (NOT(G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20))))))))) : (X (X (F ((((p0 <= 0)) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p16 <= 0)) AND ((p17 <= 0)) AND ((p18 <= 0)) AND ((p20 <= 0)))))) AND F (X (X (G (X ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)))))))))) : X (((X ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) OR (((p0 <= 0)) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p16 <= 0)) AND ((p17 <= 0)) AND ((p18 <= 0)) AND ((p20 <= 0)))) U (((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0))))) : F ((F (G (NOT(X (G ((F ((((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)))) AND (((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31))))))))) AND G ((((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)))))) : (X (NOT(F (((1 <= p31))))) OR X (NOT(G (((1 <= p27)))))) : (NOT((F (((1 <= p8))) U NOT(X (F (((1 <= p31) AND (((1 <= p12)) OR ((1 <= p31))))))))) AND NOT(F (((1 <= p8))))) : ((X (X (((F (((1 <= p1))) U ((1 <= p19) AND (1 <= p24) AND (1 <= p33))) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29))))) OR ((1 <= p1))) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33))) : (G (F ((G (F (X (F (X ((X (((1 <= p19) AND (1 <= p21) AND (1 <= p33))) U ((1 <= p6)))))))) U ((1 <= p24) AND (1 <= p40))))) U ((1 <= p24) AND (1 <= p40))) : (X (X ((F ((((1 <= p26) AND (1 <= p38)) OR ((1 <= p28)))) AND ((1 <= p28))))) U (X (((1 <= p19) AND (1 <= p23) AND (1 <= p33))) AND ((1 <= p28)))) : G (X (G (NOT(X ((((1 <= p4)) U ((p20 <= 0)))))))) : (G ((X (((1 <= p24) AND (1 <= p40))) AND (((NOT(F (((1 <= p32)))) OR ((p19 <= 0))) OR ((p23 <= 0))) OR ((p30 <= 0))))) U G (F (NOT(F (((1 <= p19) AND (1 <= p23) AND (1 <= p30))))))) : X (G (X (G ((((1 <= p27)) OR ((1 <= p7)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((F ((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31)))) AND (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p35 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p35 <= 0)) AND (((p19 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((F ((((1 <= p32)) OR ((1 <= p25)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p31)))) AND (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p33 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p26 <= 0) OR (p35 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p36 <= 0)) AND (((p19 <= 0) OR (p22 <= 0) OR (p35 <= 0)) AND (((p19 ... (shortened)
lola: processed formula length: 2255
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 33 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 48
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 75 markings, 147 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) U (X ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) U (X ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <... (shortened)
lola: processed formula length: 1128
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 46 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) OR (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) OR (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) OR (((p19 <= 0) OR (p22 <= 0) OR (p30 <= 0)) AND ((p19 <= 0) O... (shortened)
lola: processed formula length: 1278
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p... (shortened)
lola: processed formula length: 673
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((((p0 <= 0)) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p16 <= 0)) AND ((p17 <= 0)) AND ((p18 <= 0)) AND ((p20 <= 0)))))) AND F (G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((((1 <= p0)) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p16)) OR ((1 <= p17)) OR ((1 <= p18)) OR ((1 <= p20)))) AND (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p3... (shortened)
lola: processed formula length: 503
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) OR (((p0 <= 0)) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p16 <= 0)) AND ((p17 <= 0)) AND ((p18 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))) OR (((p0 <= 0)) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p16 <= 0)) AND ((p17 <= 0)) AND ((p18 <=... (shortened)
lola: processed formula length: 510
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p31 <= 0))) OR F (((p27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p31 <= 0))) OR F (((p27 <= 0)))))
lola: processed formula length: 42
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p8 <= 0))) R X (F (((1 <= p31) AND (((1 <= p12)) OR ((1 <= p31))))))) AND G (((p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p8 <= 0)))
lola: processed formula length: 15
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 176 markings, 296 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((F (((1 <= p1))) U ((1 <= p19) AND (1 <= p24) AND (1 <= p33))) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29))))) OR (((1 <= p1)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p1)) OR ((1 <= p19) AND (1 <= p24) AND (1 <= p33)))
lola: processed formula length: 59
lola: 483 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((F (((1 <= p1))) U ((1 <= p19) AND (1 <= p24) AND (1 <= p33))) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((F (((1 <= p1))) U ((1 <= p19) AND (1 <= p24) AND (1 <= p33))) OR ((1 <= p19) AND (1 <= p23) AND (1 <= p29)))))
lola: processed formula length: 118
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((F ((((1 <= p26) AND (1 <= p38)) OR ((1 <= p28)))) AND ((1 <= p28))))) U (X (((1 <= p19) AND (1 <= p23) AND (1 <= p33))) AND ((1 <= p28))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((F ((((1 <= p26) AND (1 <= p38)) OR ((1 <= p28)))) AND ((1 <= p28))))) U (X (((1 <= p19) AND (1 <= p23) AND (1 <= p33))) AND ((1 <= p28))))
lola: processed formula length: 147
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p4 <= 0)) R ((1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p4 <= 0)) R ((1 <= p20))))))
lola: processed formula length: 40
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0)))) OR (G ((X (((1 <= p24) AND (1 <= p40))) AND (G (((p32 <= 0))) OR (((p19 <= 0)) OR (((p23 <= 0)) OR ((p30 <= 0))))))) AND F (G (((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p19 <= 0) OR (p23 <= 0) OR (p30 <= 0))))
lola: processed formula length: 50
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 50
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 31 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p27)) OR ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p27)) OR ((1 <= p7))))))
lola: processed formula length: 42
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0)))))
lola: processed formula length: 90
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 53
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G ((((p21 <= 0) OR (p39 <= 0)) AND ((p22 <= 0) OR (p34 <= 0)) AND ((p26 <= 0) OR (p38 <= 0)) AND ((p23 <= 0) OR (p37 <= 0)) AND ((p24 <= 0) OR (p40 <= 0)))) OR (((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0))))) AND (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G ((((p21 <= 0) OR (p39 <= 0)) AND ((p22 <= 0) OR (p34 <= 0)) AND ((p26 <= 0) OR (p38 <= 0)) AND ((p23 <= 0) OR (p37 <= 0)) AND ((p24 <= 0) OR (p40 <= 0)))) OR (((p32 <= 0)) AND ((p25 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p31 <= 0))))) AND (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <=... (shortened)
lola: processed formula length: 425
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40))) U (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p22) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40))) U (((1 <= p21) AND (1 <= p39)) OR ((1 <= p22) AND (1 <= p34)) OR ((1 <= p26) AND (1 <= p38)) OR ((1 <= p23) AND (1 <= p37)) OR ((1 <= p24) AND (1 <= p40)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p30)) OR ((1 <= p19) AND (1 <= p22) ... (shortened)
lola: processed formula length: 2712
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p24) AND (1 <= p40)) OR (G (F ((((1 <= p24) AND (1 <= p40)) OR (G (F (((1 <= p6)))) AND F (((1 <= p24) AND (1 <= p40))))))) AND F (((1 <= p24) AND (1 <= p40)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p24) AND (1 <= p40))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p24) AND (1 <= p40))
lola: processed formula length: 27
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p24) AND (1 <= p40)) OR (G (F (((1 <= p6)))) AND F (((1 <= p24) AND (1 <= p40)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p24) AND (1 <= p40)) OR (G (F (((1 <= p6)))) AND F (((1 <= p24) AND (1 <= p40)))))))
lola: processed formula length: 98
lola: 482 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no no no no
lola: memory consumption: 196648 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SharedMemory-PT-000005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is SharedMemory-PT-000005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987939200546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;