Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r322-tall-162132128200282.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is UtilityControlRoom-PT-Z2T4N04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128200282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 57K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 274K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 303K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 8.4K May 12 04:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K May 12 04:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 47K May 12 08:13 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 UtilityControlRoom-PT-Z2T4N04-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N04-15

=== Now, execution of the tool begins

BK_START 1621452445158

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:27:27] [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]
[2021-05-19 19:27:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:27:27] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-19 19:27:27] [INFO ] Transformed 72 places.
[2021-05-19 19:27:27] [INFO ] Transformed 108 transitions.
[2021-05-19 19:27:27] [INFO ] Parsed PT model containing 72 places and 108 transitions in 115 ms.
[2021-05-19 19:27:27] [INFO ] Reduced 4 identical enabling conditions.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 313 ms. (steps per millisecond=319 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 92 rows 72 cols
[2021-05-19 19:27:27] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-19 19:27:27] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2021-05-19 19:27:27] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-19 19:27:28] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-19 19:27:28] [INFO ] Flatten gal took : 36 ms
FORMULA UtilityControlRoom-PT-Z2T4N04-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N04-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:27:28] [INFO ] Flatten gal took : 18 ms
[2021-05-19 19:27:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2021-05-19 19:27:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ UtilityControlRoom-PT-Z2T4N04 @ 3570 seconds

FORMULA UtilityControlRoom-PT-Z2T4N04-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ UtilityControlRoom-PT-Z2T4N04

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 16,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p50 <= 0)))",
"processed_size": 725,
"rewrites": 229
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G (((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p36 <= 0) AND (p37 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)))",
"processed_size": 241,
"rewrites": 200
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 8,
"adisj": 2,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "X (X ((X (F (((1 <= p49) OR (1 <= p48) OR (1 <= p47) OR (1 <= p46)))) AND G ((((p41 <= 0) OR (p61 <= 0)) AND ((p39 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p63 <= 0)) AND ((p40 <= 0) OR (p61 <= 0)) AND ((p45 <= 0) OR (p63 <= 0)) AND ((p43 <= 0) OR (p62 <= 0)) AND ((p42 <= 0) OR (p62 <= 0)) AND ((p38 <= 0) OR (p60 <= 0)))))))",
"processed_size": 337,
"rewrites": 200
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15)))",
"processed_size": 121,
"rewrites": 200
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58))))",
"processed_size": 65,
"rewrites": 200
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 49,
"adisj": 4,
"aneg": 1,
"comp": 148,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 148,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X ((G ((((((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p50 <= 0))) OR (((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p50 <= 0)))) AND (p53 <= 0) AND (p52 <= 0) AND (p55 <= 0) AND (p54 <= 0))) AND (((1 <= p0) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))))",
"processed_size": 2259,
"rewrites": 200
},
"result":
{
"edges": 11,
"markings": 11,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((X ((1 <= p57)) AND (1 <= p57)))",
"processed_size": 35,
"rewrites": 200
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p52))",
"processed_size": 14,
"rewrites": 200
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "(X ((p52 <= 0)) R (p52 <= 0))",
"processed_size": 29,
"rewrites": 200
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((p44 <= 0) OR (p63 <= 0)) U ((1 <= p44) AND (1 <= p63))))",
"processed_size": 63,
"rewrites": 200
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (F ((1 <= p49))))",
"processed_size": 22,
"rewrites": 200
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"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": "G (F ((X (X ((1 <= p3))) OR F (G (((1 <= p1) AND (1 <= p7) AND (1 <= p50)))))))",
"processed_size": 79,
"rewrites": 200
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 4,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": "X (X ((X (X (G (((1 <= p21) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)))))) U (1 <= p22))))",
"processed_size": 93,
"rewrites": 200
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 1,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p10 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p8 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p50 <= 0)))))",
"processed_size": 733,
"rewrites": 200
},
"result":
{
"edges": 54,
"markings": 54,
"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": "fairness",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p56 <= 0)",
"processed_size": 10,
"rewrites": 202
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 106336,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(*) AND (X(*) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))))))) : X(X((X(F(**)) AND G(*)))) : X(G((F(**) AND (X(F(*)) OR **)))) : G(F(*)) : (F(G(**)) AND (X(**) OR G(**))) : X((G(*) AND **)) : X((X(**) AND **)) : (X(F((F(**) AND (** AND **)))) U G(**)) : ((X(*) R *) OR G(**)) : X((** U **)) : X(X(F(**))) : (G(((F(**) AND (** AND (** AND **))) OR (F((F(**) AND (** AND (** AND **)))) AND F(G((F(**) AND (** OR **))))))) AND F(**)) : G(F((X(X(**)) OR F(G(**))))) : X(X((X(X(G(**))) U **)))"
},
"net":
{
"arcs": 276,
"conflict_clusters": 42,
"places": 72,
"places_significant": 61,
"singleton_clusters": 0,
"transitions": 92
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no no no ",
"value": "no no no no no no no no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 164/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2304
lola: finding significant places
lola: 72 places, 92 transitions, 61 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: (((((((((((((((((NOT(((F ((((1 <= p0) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))) OR F (X ((((1 <= p0) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))))) U F (((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))) AND NOT(X (((1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p36) OR (1 <= p37) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31))))) AND ((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0))) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0))) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0))) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0))) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p13 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p8 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p10 <= 0) OR (p50 <= 0))) AND ((p0 <= 0) OR (p10 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p12 <= 0) OR (p50 <= 0))) AND ((p1 <= 0) OR (p7 <= 0) OR (p50 <= 0))) AND ((p0 <= 0) OR (p8 <= 0) OR (p50 <= 0))) AND ((p0 <= 0) OR (p12 <= 0) OR (p50 <= 0))) : X (NOT(X ((G (X (NOT(F (((1 <= p49) OR (1 <= p48) OR (1 <= p47) OR (1 <= p46)))))) OR F ((((1 <= p41) AND (1 <= p61)) OR ((1 <= p39) AND (1 <= p60)) OR ((1 <= p44) AND (1 <= p63)) OR ((1 <= p40) AND (1 <= p61)) OR ((1 <= p45) AND (1 <= p63)) OR ((1 <= p43) AND (1 <= p62)) OR ((1 <= p42) AND (1 <= p62)) OR ((1 <= p38) AND (1 <= p60)))))))) : X (G ((X ((F ((((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))) U NOT(G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15)))))) U (((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))))) : NOT(F (G ((((1 <= p0) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))))) : (F (G (((1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58)))) AND (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15))) OR G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15))))) : (NOT(X (F ((F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p20 <= 0) AND (p21 <= 0) AND (p14 <= 0) AND (p15 <= 0))) U (((((1 <= p0) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50))) AND (((1 <= p0) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))) OR (1 <= p53) OR (1 <= p52) OR (1 <= p55) OR (1 <= p54)))))) AND X ((((1 <= p0) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50))))) : X ((X (((1 <= 0) U (1 <= p57))) AND (1 <= p57))) : (X (F (((F (((1 <= p42) AND (1 <= p62))) AND (1 <= p42)) AND (1 <= p62)))) U G ((1 <= p47))) : (NOT((X ((1 <= p52)) U (1 <= p52))) OR G ((1 <= p52))) : X ((((p44 <= 0) OR (p63 <= 0)) U ((1 <= p44) AND (1 <= p63)))) : ((1 <= 0) U X (F (X (F ((1 <= p49)))))) : (G ((F (G (((1 <= p56) U (1 <= p36)))) U (((F (((1 <= p1) AND (1 <= p11) AND (1 <= p50))) AND (1 <= p1)) AND (1 <= p11)) AND (1 <= p50)))) AND F ((1 <= p56))) : G (NOT(G ((NOT(X (X ((1 <= p3)))) AND NOT(F (G (((1 <= p1) AND (1 <= p7) AND (1 <= p50))))))))) : X ((X (X (G (X (G (((1 <= p21) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)))))))) U X ((1 <= p22))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p36 <= 0) AND (p37 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0))) AND (X (((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p36 <= 0) AND (p37 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND (((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND (((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND (((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND (((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND (((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND (((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND (((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND (((p1 <= 0) OR (p13 <= 0) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p50 <... (shortened)
lola: processed formula length: 725
lola: 229 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 48 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p36 <= 0) AND (p37 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p32 <= 0) AND (p33 <= 0) AND (p34 <= 0) AND (p35 <= 0) AND (p36 <= 0) AND (p37 <= 0) AND (p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0) AND (p31 <= 0)))
lola: processed formula length: 241
lola: 200 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: 41 markings, 41 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F (((1 <= p49) OR (1 <= p48) OR (1 <= p47) OR (1 <= p46)))) AND G ((((p41 <= 0) OR (p61 <= 0)) AND ((p39 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p63 <= 0)) AND ((p40 <= 0) OR (p61 <= 0)) AND ((p45 <= 0) OR (p63 <= 0)) AND ((p43 <= 0) OR (p62 <= 0)) AND ((p42 <= 0) OR (p62 <= 0)) AND ((p38 <= 0) OR (p60 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F (((1 <= p49) OR (1 <= p48) OR (1 <= p47) OR (1 <= p46)))) AND G ((((p41 <= 0) OR (p61 <= 0)) AND ((p39 <= 0) OR (p60 <= 0)) AND ((p44 <= 0) OR (p63 <= 0)) AND ((p40 <= 0) OR (p61 <= 0)) AND ((p45 <= 0) OR (p63 <= 0)) AND ((p43 <= 0) OR (p62 <= 0)) AND ((p42 <= 0) OR (p62 <= 0)) AND ((p38 <= 0) OR (p60 <= 0)))))))
lola: processed formula length: 337
lola: 200 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))) AND (X (F (((p16 <= 0) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((1 <= p1) AND (1 <= p9) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p10) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p7) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p8) AND (1 <= p50)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p50)))) AND (X (F (((p16 <= 0) AND ... (shortened)
lola: processed formula length: 872
lola: 200 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: 693 markings, 886 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58)))) AND (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15))) OR G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p20) OR (1 <= p21) OR (1 <= p14) OR (1 <= p15)))
lola: processed formula length: 121
lola: 200 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p57) OR (1 <= p56) OR (1 <= p59) OR (1 <= p58))))
lola: processed formula length: 65
lola: 200 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: 10 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) O... (shortened)
lola: processed formula length: 2259
lola: 200 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((1 <= p57)) AND (1 <= p57)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((1 <= p57)) AND (1 <= p57)))
lola: processed formula length: 35
lola: 200 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F (((1 <= p42) AND (1 <= p62))) AND ((1 <= p42) AND (1 <= p62))))) U G ((1 <= p47)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((F (((1 <= p42) AND (1 <= p62))) AND ((1 <= p42) AND (1 <= p62))))) U G ((1 <= p47)))
lola: processed formula length: 92
lola: 200 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p52 <= 0)) R (p52 <= 0)) OR G ((1 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p52))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p52))
lola: processed formula length: 14
lola: 200 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p52 <= 0)) R (p52 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p52 <= 0)) R (p52 <= 0))
lola: processed formula length: 29
lola: 200 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p44 <= 0) OR (p63 <= 0)) U ((1 <= p44) AND (1 <= p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p44 <= 0) OR (p63 <= 0)) U ((1 <= p44) AND (1 <= p63))))
lola: processed formula length: 63
lola: 200 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((1 <= p49))))
lola: processed formula length: 22
lola: 200 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X ((1 <= p3))) OR F (G (((1 <= p1) AND (1 <= p7) AND (1 <= p50)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X ((1 <= p3))) OR F (G (((1 <= p1) AND (1 <= p7) AND (1 <= p50)))))))
lola: processed formula length: 79
lola: 200 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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X (G (((1 <= p21) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)))))) U (1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X (G (((1 <= p21) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p50)))))) U (1 <= p22))))
lola: processed formula length: 93
lola: 200 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p0 <= 0) OR (p7 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p9 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p13 <= 0) OR (p50 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p50 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR ... (shortened)
lola: processed formula length: 733
lola: 200 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: 54 markings, 54 edges
lola: ========================================
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((F (((1 <= p1) AND (1 <= p11) AND (1 <= p50))) AND ((1 <= p1) AND ((1 <= p11) AND (1 <= p50)))) OR (F ((F (((1 <= p1) AND (1 <= p11) AND (1 <= p50))) AND ((1 <= p1) AND ((1 <= p11) AND (1 <= p50))))) AND F (G ((F ((1 <= p36)) AND ((1 <= p56) OR (1 <= p36)))))))) AND F ((1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p56))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p56 <= 0)
lola: processed formula length: 10
lola: 202 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 26 markings, 26 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 yes no no no no no
lola:
preliminary result: no no no no no no no no yes no no no no no
lola: memory consumption: 106336 KB
lola: time consumption: 3 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="UtilityControlRoom-PT-Z2T4N04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is UtilityControlRoom-PT-Z2T4N04, 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 r322-tall-162132128200282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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