Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177100274.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 CSRepetitions-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177100274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 148K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 556K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 534K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Mar 22 12:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 22 12:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 151K May 5 16:51 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 CSRepetitions-PT-04-00
FORMULA_NAME CSRepetitions-PT-04-01
FORMULA_NAME CSRepetitions-PT-04-02
FORMULA_NAME CSRepetitions-PT-04-03
FORMULA_NAME CSRepetitions-PT-04-04
FORMULA_NAME CSRepetitions-PT-04-05
FORMULA_NAME CSRepetitions-PT-04-06
FORMULA_NAME CSRepetitions-PT-04-07
FORMULA_NAME CSRepetitions-PT-04-08
FORMULA_NAME CSRepetitions-PT-04-09
FORMULA_NAME CSRepetitions-PT-04-10
FORMULA_NAME CSRepetitions-PT-04-11
FORMULA_NAME CSRepetitions-PT-04-12
FORMULA_NAME CSRepetitions-PT-04-13
FORMULA_NAME CSRepetitions-PT-04-14
FORMULA_NAME CSRepetitions-PT-04-15

=== Now, execution of the tool begins

BK_START 1620942078263

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:41:19] [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-13 21:41:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:41:20] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-13 21:41:20] [INFO ] Transformed 117 places.
[2021-05-13 21:41:20] [INFO ] Transformed 176 transitions.
[2021-05-13 21:41:20] [INFO ] Parsed PT model containing 117 places and 176 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 840 steps, including 20 resets, run visited all 44 properties in 10 ms. (steps per millisecond=84 )
[2021-05-13 21:41:20] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 21:41:20] [INFO ] Flatten gal took : 68 ms
FORMULA CSRepetitions-PT-04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 21:41:20] [INFO ] Flatten gal took : 14 ms
[2021-05-13 21:41:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2021-05-13 21:41:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CSRepetitions-PT-04 @ 3570 seconds

FORMULA CSRepetitions-PT-04-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CSRepetitions-PT-04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3563
rslt: Output for LTLFireability @ CSRepetitions-PT-04

{
"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": "Thu May 13 21:41:20 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": 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": "((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))",
"processed_size": 238,
"rewrites": 248
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 80
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 81,
"adisj": 2,
"aneg": 1,
"comp": 160,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 160,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 37,
"visible_transitions": 0
},
"processed": "((((p74 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p74 <= 0)) AND ((p9 <= 0) OR (p21 <= 0)) AND ((p0 <= 0) OR (p25 <= 0)) AND ((p9 <= 0) OR (p80 <= 0)) AND ((p25 <= 0) OR (p32 <= 0)) AND ((p46 <= 0) OR (p97 <= 0)) AND ((p25 <= 0) OR (p75 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p2 <= 0) OR (p100 <= 0)) AND ((p9 <= 0) OR (p58 <= 0)) AND ((p9 <= 0) OR (p68 <= 0)) AND ((p75 <= 0) OR (p97 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p2 <= 0) OR (p106 <= 0)) AND ((p9 <= 0) OR (p107 <= 0)) AND ((p2 <= 0) OR (p14 <= 0)) AND ((p9 <= 0) OR (p109 <= 0)) AND ((p9 <= 0) OR (p46 <= 0)) AND ((p25 <= 0) OR (p58 <= 0)) AND ((p97 <= 0) OR (p106 <= 0)) AND ((p97 <= 0) OR (p100 <= 0)) AND ((p25 <= 0) OR (p68 <= 0)) AND ((p25 <= 0) OR (p109 <= 0)) AND ((p68 <= 0) OR (p97 <= 0)) AND ((p25 <= 0) OR (p46 <= 0)) AND ((p25 <= 0) OR (p107 <= 0)) AND ((p0 <= 0) OR (p97 <= 0)) AND ((p14 <= 0) OR (p25 <= 0)) AND ((p9 <= 0) OR (p32 <= 0)) AND ((p2 <= 0) OR (p75 <= 0)) AND ((p25 <= 0) OR (p29 <= 0)) AND ((p9 <= 0) OR (p75 <= 0)) AND ((p2 <= 0) OR (p46 <= 0)) AND ((p9 <= 0) OR (p14 <= 0)) AND ((p25 <= 0) OR (p88 <= 0)) AND ((p21 <= 0) OR (p97 <= 0)) AND ((p25 <= 0) OR (p100 <= 0)) AND ((p2 <= 0) OR (p58 <= 0)) AND ((p80 <= 0) OR (p97 <= 0)) AND ((p29 <= 0) OR (p97 <= 0)) AND ((p2 <= 0) OR (p32 <= 0)) AND ((p58 <= 0) OR (p97 <= 0)) AND ((p25 <= 0) OR (p74 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p88 <= 0) OR (p97 <= 0)) AND ((p32 <= 0) OR (p97 <= 0)) AND ((p2 <= 0) OR (p109 <= 0)) AND ((p2 <= 0) OR (p107 <= 0)) AND ((p25 <= 0) OR (p80 <= 0)) AND ((p2 <= 0) OR (p80 <= 0)) AND ((p97 <= 0) OR (p107 <= 0)) AND ((p97 <= 0) OR (p109 <= 0)) AND ((p9 <= 0) OR (p106 <= 0)) AND ((p2 <= 0) OR (p21 <= 0)) AND ((p2 <= 0) OR (p88 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p9 <= 0) OR (p29 <= 0)) AND ((p14 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p88 <= 0)) AND ((p2 <= 0) OR (p68 <= 0)) AND ((p25 <= 0) OR (p106 <= 0)) AND ((p9 <= 0) OR (p100 <= 0)) AND ((p2 <= 0) OR (p74 <= 0))) OR (((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 <= 0)) AND ((p28 <= 0) OR (p115 <= 0)) AND ((p13 <= 0) OR (p115 <= 0)) AND ((p45 <= 0) OR (p115 <= 0)) AND ((p18 <= 0) OR (p115 <= 0)) AND ((p50 <= 0) OR (p115 <= 0)) AND ((p55 <= 0) OR (p115 <= 0)) AND ((p108 <= 0) OR (p115 <= 0)) AND ((p48 <= 0) OR (p115 <= 0)) AND ((p42 <= 0) OR (p115 <= 0)) AND ((p63 <= 0) OR (p115 <= 0)) AND ((p82 <= 0) OR (p115 <= 0))))",
"processed_size": 2557,
"rewrites": 248
},
"result":
{
"edges": 524288,
"markings": 65536,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 176
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G ((F (G ((X (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))) AND G (F (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))))))) OR ((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))))",
"processed_size": 751,
"rewrites": 246
},
"result":
{
"edges": 123935,
"markings": 8211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 18,
"aneg": 0,
"comp": 64,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 17,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p0) OR (1 <= p32) OR (1 <= p100) OR (1 <= p68) OR (1 <= p106) OR (1 <= p107) OR (1 <= p75) OR (1 <= p74) OR (1 <= p14) OR (1 <= p46) OR (1 <= p109) OR (1 <= p80) OR (1 <= p21) OR (1 <= p88) OR (1 <= p58) OR (1 <= p29))) AND (X (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))) AND (((p95 <= 0) OR (p115 <= 0)) AND (((p34 <= 0) OR (p115 <= 0)) AND (((p5 <= 0) OR (p115 <= 0)) AND (((p54 <= 0) OR (p115 <= 0)) AND (((p11 <= 0) OR (p115 <= 0)) AND (((p28 <= 0) OR (p115 <= 0)) AND (((p13 <= 0) OR (p115 <= 0)) AND (((p45 <= 0) OR (p115 <= 0)) AND (((p18 <= 0) OR (p115 <= 0)) AND (((p50 <= 0) OR (p115 <= 0)) AND (((p55 <= 0) OR (p115 <= 0)) AND (((p108 <= 0) OR (p115 <= 0)) AND (((p48 <= 0) OR (p115 <= 0)) AND (((p42 <= 0) OR (p115 <= 0)) AND (((p63 <= 0) OR (p115 <= 0)) AND ((p82 <= 0) OR (p115 <= 0))))))))))))))))))))",
"processed_size": 1057,
"rewrites": 246
},
"result":
{
"edges": 524317,
"markings": 311323,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 33,
"adisj": 18,
"aneg": 0,
"comp": 112,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 112,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "X (G ((F ((((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115)))) AND (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0) AND ((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 <= 0)) AND ((p28 <= 0) OR (p115 <= 0)) AND ((p13 <= 0) OR (p115 <= 0)) AND ((p45 <= 0) OR (p115 <= 0)) AND ((p18 <= 0) OR (p115 <= 0)) AND ((p50 <= 0) OR (p115 <= 0)) AND ((p55 <= 0) OR (p115 <= 0)) AND ((p108 <= 0) OR (p115 <= 0)) AND ((p48 <= 0) OR (p115 <= 0)) AND ((p42 <= 0) OR (p115 <= 0)) AND ((p63 <= 0) OR (p115 <= 0)) AND ((p82 <= 0) OR (p115 <= 0))) OR (((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115)))))))",
"processed_size": 1841,
"rewrites": 246
},
"result":
{
"edges": 25,
"markings": 25,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))))",
"processed_size": 246,
"rewrites": 246
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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
},
"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": 16,
"adisj": 1,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "(((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115)))",
"processed_size": 525,
"rewrites": 248
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 160
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 16,
"adisj": 2,
"aneg": 2,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "X ((((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0)) OR (((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 <= 0)) AND ((p28 <= 0) OR (p115 <= 0)) AND ((p13 <= 0) OR (p115 <= 0)) AND ((p45 <= 0) OR (p115 <= 0)) AND ((p18 <= 0) OR (p115 <= 0)) AND ((p50 <= 0) OR (p115 <= 0)) AND ((p55 <= 0) OR (p115 <= 0)) AND ((p108 <= 0) OR (p115 <= 0)) AND ((p48 <= 0) OR (p115 <= 0)) AND ((p42 <= 0) OR (p115 <= 0)) AND ((p63 <= 0) OR (p115 <= 0)) AND ((p82 <= 0) OR (p115 <= 0)))))",
"processed_size": 773,
"rewrites": 246
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"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": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (G ((1 <= p53))) AND (F (((1 <= p50) AND (1 <= p59))) OR X (G ((1 <= p53))))))",
"processed_size": 84,
"rewrites": 246
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((1 <= p34) AND (1 <= p115))))",
"processed_size": 36,
"rewrites": 246
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(F (((X ((p88 <= 0)) AND ((1 <= p55) AND (1 <= p115))) OR ((1 <= p34) AND (1 <= p84)))) U (1 <= p88))",
"processed_size": 101,
"rewrites": 246
},
"result":
{
"edges": 42,
"markings": 41,
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p3) AND (F ((1 <= p3)) OR (1 <= p52))) U X (X (X (F ((1 <= p52))))))",
"processed_size": 76,
"rewrites": 246
},
"result":
{
"edges": 40,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G (((1 <= p48) AND (1 <= p115))))",
"processed_size": 36,
"rewrites": 246
},
"result":
{
"edges": 27,
"markings": 26,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F (((p48 <= 0) OR (p115 <= 0))) AND ((X (((1 <= p63) AND (1 <= p115))) U ((1 <= p63) AND (1 <= p115))) OR ((p48 <= 0) OR (p115 <= 0)))))",
"processed_size": 142,
"rewrites": 246
},
"result":
{
"edges": 319343,
"markings": 60304,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 0,
"aconj": 144,
"adisj": 3,
"aneg": 3,
"comp": 288,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 288,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 81,
"visible_transitions": 0
},
"processed": "G (F ((G ((((p5 <= 0) OR (p24 <= 0)) AND ((p18 <= 0) OR (p62 <= 0)) AND ((p17 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p81 <= 0)) AND ((p13 <= 0) OR (p61 <= 0)) AND ((p63 <= 0) OR (p69 <= 0)) AND ((p1 <= 0) OR (p45 <= 0)) AND ((p18 <= 0) OR (p70 <= 0)) AND ((p60 <= 0) OR (p108 <= 0)) AND ((p63 <= 0) OR (p67 <= 0)) AND ((p41 <= 0) OR (p108 <= 0)) AND ((p5 <= 0) OR (p77 <= 0)) AND ((p35 <= 0) OR (p42 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p37 <= 0) OR (p42 <= 0)) AND ((p23 <= 0) OR (p55 <= 0)) AND ((p95 <= 0) OR (p101 <= 0)) AND ((p42 <= 0) OR (p71 <= 0)) AND ((p50 <= 0) OR (p78 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p55 <= 0) OR (p65 <= 0)) AND ((p49 <= 0) OR (p54 <= 0)) AND ((p19 <= 0) OR (p63 <= 0)) AND ((p33 <= 0) OR (p50 <= 0)) AND ((p55 <= 0) OR (p112 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p48 <= 0) OR (p86 <= 0)) AND ((p18 <= 0) OR (p89 <= 0)) AND ((p22 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p95 <= 0)) AND ((p34 <= 0) OR (p84 <= 0)) AND ((p48 <= 0) OR (p73 <= 0)) AND ((p85 <= 0) OR (p108 <= 0)) AND ((p42 <= 0) OR (p56 <= 0)) AND ((p28 <= 0) OR (p79 <= 0)) AND ((p45 <= 0) OR (p47 <= 0)) AND ((p5 <= 0) OR (p76 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p28 <= 0) OR (p87 <= 0)) AND ((p16 <= 0) OR (p82 <= 0)) AND ((p40 <= 0) OR (p54 <= 0)) AND ((p48 <= 0) OR (p51 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p82 <= 0) OR (p111 <= 0)) AND ((p95 <= 0) OR (p110 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p45 <= 0) OR (p96 <= 0)) AND ((p54 <= 0) OR (p90 <= 0)) AND ((p11 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p28 <= 0)) AND ((p12 <= 0) OR (p82 <= 0)) AND ((p28 <= 0) OR (p103 <= 0)) AND ((p102 <= 0) OR (p108 <= 0)) AND ((p13 <= 0) OR (p93 <= 0)) AND ((p72 <= 0) OR (p95 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p18 <= 0) OR (p43 <= 0)) AND ((p50 <= 0) OR (p59 <= 0)) AND ((p11 <= 0) OR (p66 <= 0)) AND ((p55 <= 0) OR (p105 <= 0)) AND ((p7 <= 0) OR (p63 <= 0)) AND ((p13 <= 0) OR (p38 <= 0)) AND ((p82 <= 0) OR (p83 <= 0)) AND ((p34 <= 0) OR (p104 <= 0)))) AND (F (G ((((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 <= 0)) AND ((p28 <= 0) OR (p115 <= 0)) AND ((p13 <= 0) OR (p115 <= 0)) AND ((p45 <= 0) OR (p115 <= 0)) AND ((p18 <= 0) OR (p115 <= 0)) AND ((p50 <= 0) OR (p115 <= 0)) AND ((p55 <= 0) OR (p115 <= 0)) AND ((p108 <= 0) OR (p115 <= 0)) AND ((p48 <= 0) OR (p115 <= 0)) AND ((p42 <= 0) OR (p115 <= 0)) AND ((p63 <= 0) OR (p115 <= 0)) AND ((p82 <= 0) OR (p115 <= 0))))) OR G ((((p5 <= 0) OR (p24 <= 0)) AND ((p18 <= 0) OR (p62 <= 0)) AND ((p17 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p81 <= 0)) AND ((p13 <= 0) OR (p61 <= 0)) AND ((p63 <= 0) OR (p69 <= 0)) AND ((p1 <= 0) OR (p45 <= 0)) AND ((p18 <= 0) OR (p70 <= 0)) AND ((p60 <= 0) OR (p108 <= 0)) AND ((p63 <= 0) OR (p67 <= 0)) AND ((p41 <= 0) OR (p108 <= 0)) AND ((p5 <= 0) OR (p77 <= 0)) AND ((p35 <= 0) OR (p42 <= 0)) AND ((p26 <= 0) OR (p48 <= 0)) AND ((p37 <= 0) OR (p42 <= 0)) AND ((p23 <= 0) OR (p55 <= 0)) AND ((p95 <= 0) OR (p101 <= 0)) AND ((p42 <= 0) OR (p71 <= 0)) AND ((p50 <= 0) OR (p78 <= 0)) AND ((p11 <= 0) OR (p94 <= 0)) AND ((p55 <= 0) OR (p65 <= 0)) AND ((p49 <= 0) OR (p54 <= 0)) AND ((p19 <= 0) OR (p63 <= 0)) AND ((p33 <= 0) OR (p50 <= 0)) AND ((p55 <= 0) OR (p112 <= 0)) AND ((p6 <= 0) OR (p11 <= 0)) AND ((p48 <= 0) OR (p86 <= 0)) AND ((p18 <= 0) OR (p89 <= 0)) AND ((p22 <= 0) OR (p54 <= 0)) AND ((p30 <= 0) OR (p95 <= 0)) AND ((p34 <= 0) OR (p84 <= 0)) AND ((p48 <= 0) OR (p73 <= 0)) AND ((p85 <= 0) OR (p108 <= 0)) AND ((p42 <= 0) OR (p56 <= 0)) AND ((p28 <= 0) OR (p79 <= 0)) AND ((p45 <= 0) OR (p47 <= 0)) AND ((p5 <= 0) OR (p76 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p28 <= 0) OR (p87 <= 0)) AND ((p16 <= 0) OR (p82 <= 0)) AND ((p40 <= 0) OR (p54 <= 0)) AND ((p48 <= 0) OR (p51 <= 0)) AND ((p27 <= 0) OR (p45 <= 0)) AND ((p82 <= 0) OR (p111 <= 0)) AND ((p95 <= 0) OR (p110 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p45 <= 0) OR (p96 <= 0)) AND ((p54 <= 0) OR (p90 <= 0)) AND ((p11 <= 0) OR (p36 <= 0)) AND ((p20 <= 0) OR (p28 <= 0)) AND ((p12 <= 0) OR (p82 <= 0)) AND ((p28 <= 0) OR (p103 <= 0)) AND ((p102 <= 0) OR (p108 <= 0)) AND ((p13 <= 0) OR (p93 <= 0)) AND ((p72 <= 0) OR (p95 <= 0)) AND ((p5 <= 0) OR (p44 <= 0)) AND ((p18 <= 0) OR (p43 <= 0)) AND ((p50 <= 0) OR (p59 <= 0)) AND ((p11 <= 0) OR (p66 <= 0)) AND ((p55 <= 0) OR (p105 <= 0)) AND ((p7 <= 0) OR (p63 <= 0)) AND ((p13 <= 0) OR (p38 <= 0)) AND ((p82 <= 0) OR (p83 <= 0)) AND ((p34 <= 0) OR (p104 <= 0))))))))",
"processed_size": 4660,
"rewrites": 246
},
"result":
{
"edges": 11293,
"markings": 2072,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"compoundnumber": 11,
"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": 1781
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p34 <= 0) OR (p115 <= 0))",
"processed_size": 28,
"rewrites": 246
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "((p9 <= 0) OR (p88 <= 0))",
"processed_size": 25,
"rewrites": 247
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3563
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))))",
"processed_size": 246,
"rewrites": 246
},
"result":
{
"edges": 22,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 2,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "G (F (((((p0 <= 0) AND (p32 <= 0) AND (p100 <= 0) AND (p68 <= 0) AND (p106 <= 0) AND (p107 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p14 <= 0) AND (p46 <= 0) AND (p109 <= 0) AND (p80 <= 0) AND (p21 <= 0) AND (p88 <= 0) AND (p58 <= 0) AND (p29 <= 0)) R ((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))) OR G (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))))))",
"processed_size": 739,
"rewrites": 246
},
"result":
{
"edges": 628577,
"markings": 130497,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 15,
"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": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "((p9 <= 0) OR (p88 <= 0))",
"processed_size": 25,
"rewrites": 247
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "((p34 <= 0) OR (p115 <= 0))",
"processed_size": 28,
"rewrites": 246
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p57)",
"processed_size": 10,
"rewrites": 248
},
"result":
{
"edges": 30,
"markings": 29,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p57 <= 0))",
"processed_size": 14,
"rewrites": 246
},
"result":
{
"edges": 37,
"markings": 37,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 152264,
"runtime": 7.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G(*)) OR (F(**) AND F(**))) : G((F(G((X(**) AND G(F(**))))) OR **)) : G(F((G(*) AND (F(G(*)) OR G(*))))) : G((F(**) AND (X(**) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))))))))) : X(G((F(**) AND (** OR **)))) : X(G(*)) : (X((* OR *)) AND (F(*) OR X(G((* OR *))))) : (F(((* R *) OR G(**))) AND (F(G(*)) OR G(F(((* R *) OR G(**)))))) : G((X(G(**)) AND (F(**) OR X(G(**))))) : X(G(**)) : (F(((X(**) AND (** AND **)) OR **)) U **) : ((** AND (F(**) OR **)) U X(X(X(F(**))))) : (G((F(**) AND ((X(**) U **) OR **))) OR F(G(**))) : ((G(*) OR (F(*) AND **)) AND (G(*) OR (** OR **)))"
},
"net":
{
"arcs": 624,
"conflict_clusters": 18,
"places": 117,
"places_significant": 97,
"singleton_clusters": 0,
"transitions": 176
},
"result":
{
"preliminary_value": "yes no no no no no no no no no no no no no ",
"value": "yes 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: 293/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3744
lola: finding significant places
lola: 117 places, 176 transitions, 97 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: (G (NOT(X (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))))) OR (F (((((1 <= p74) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p74)) OR ((1 <= p9) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p80)) OR ((1 <= p25) AND (1 <= p32)) OR ((1 <= p46) AND (1 <= p97)) OR ((1 <= p25) AND (1 <= p75)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p100)) OR ((1 <= p9) AND (1 <= p58)) OR ((1 <= p9) AND (1 <= p68)) OR ((1 <= p75) AND (1 <= p97)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p2) AND (1 <= p106)) OR ((1 <= p9) AND (1 <= p107)) OR ((1 <= p2) AND (1 <= p14)) OR ((1 <= p9) AND (1 <= p109)) OR ((1 <= p9) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p58)) OR ((1 <= p97) AND (1 <= p106)) OR ((1 <= p97) AND (1 <= p100)) OR ((1 <= p25) AND (1 <= p68)) OR ((1 <= p25) AND (1 <= p109)) OR ((1 <= p68) AND (1 <= p97)) OR ((1 <= p25) AND (1 <= p46)) OR ((1 <= p25) AND (1 <= p107)) OR ((1 <= p0) AND (1 <= p97)) OR ((1 <= p14) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p32)) OR ((1 <= p2) AND (1 <= p75)) OR ((1 <= p25) AND (1 <= p29)) OR ((1 <= p9) AND (1 <= p75)) OR ((1 <= p2) AND (1 <= p46)) OR ((1 <= p9) AND (1 <= p14)) OR ((1 <= p25) AND (1 <= p88)) OR ((1 <= p21) AND (1 <= p97)) OR ((1 <= p25) AND (1 <= p100)) OR ((1 <= p2) AND (1 <= p58)) OR ((1 <= p80) AND (1 <= p97)) OR ((1 <= p29) AND (1 <= p97)) OR ((1 <= p2) AND (1 <= p32)) OR ((1 <= p58) AND (1 <= p97)) OR ((1 <= p25) AND (1 <= p74)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p88) AND (1 <= p97)) OR ((1 <= p32) AND (1 <= p97)) OR ((1 <= p2) AND (1 <= p109)) OR ((1 <= p2) AND (1 <= p107)) OR ((1 <= p25) AND (1 <= p80)) OR ((1 <= p2) AND (1 <= p80)) OR ((1 <= p97) AND (1 <= p107)) OR ((1 <= p97) AND (1 <= p109)) OR ((1 <= p9) AND (1 <= p106)) OR ((1 <= p2) AND (1 <= p21)) OR ((1 <= p2) AND (1 <= p88)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p9) AND (1 <= p29)) OR ((1 <= p14) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p2) AND (1 <= p68)) OR ((1 <= p25) AND (1 <= p106)) OR ((1 <= p9) AND (1 <= p100)) OR ((1 <= p2) AND (1 <= p74))) AND (((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115))))) AND F (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))))) : G ((G (F (G ((X (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))) AND G (F (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0)))))))) OR ((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0)))) : G (F (X (NOT(G (X ((F (G (F ((((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115)))))) U F ((((1 <= p5) AND (1 <= p24)) OR ((1 <= p18) AND (1 <= p62)) OR ((1 <= p17) AND (1 <= p50)) OR ((1 <= p34) AND (1 <= p81)) OR ((1 <= p13) AND (1 <= p61)) OR ((1 <= p63) AND (1 <= p69)) OR ((1 <= p1) AND (1 <= p45)) OR ((1 <= p18) AND (1 <= p70)) OR ((1 <= p60) AND (1 <= p108)) OR ((1 <= p63) AND (1 <= p67)) OR ((1 <= p41) AND (1 <= p108)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p35) AND (1 <= p42)) OR ((1 <= p26) AND (1 <= p48)) OR ((1 <= p37) AND (1 <= p42)) OR ((1 <= p23) AND (1 <= p55)) OR ((1 <= p95) AND (1 <= p101)) OR ((1 <= p42) AND (1 <= p71)) OR ((1 <= p50) AND (1 <= p78)) OR ((1 <= p11) AND (1 <= p94)) OR ((1 <= p55) AND (1 <= p65)) OR ((1 <= p49) AND (1 <= p54)) OR ((1 <= p19) AND (1 <= p63)) OR ((1 <= p33) AND (1 <= p50)) OR ((1 <= p55) AND (1 <= p112)) OR ((1 <= p6) AND (1 <= p11)) OR ((1 <= p48) AND (1 <= p86)) OR ((1 <= p18) AND (1 <= p89)) OR ((1 <= p22) AND (1 <= p54)) OR ((1 <= p30) AND (1 <= p95)) OR ((1 <= p34) AND (1 <= p84)) OR ((1 <= p48) AND (1 <= p73)) OR ((1 <= p85) AND (1 <= p108)) OR ((1 <= p42) AND (1 <= p56)) OR ((1 <= p28) AND (1 <= p79)) OR ((1 <= p45) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p28) AND (1 <= p87)) OR ((1 <= p16) AND (1 <= p82)) OR ((1 <= p40) AND (1 <= p54)) OR ((1 <= p48) AND (1 <= p51)) OR ((1 <= p27) AND (1 <= p45)) OR ((1 <= p82) AND (1 <= p111)) OR ((1 <= p95) AND (1 <= p110)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p45) AND (1 <= p96)) OR ((1 <= p54) AND (1 <= p90)) OR ((1 <= p11) AND (1 <= p36)) OR ((1 <= p20) AND (1 <= p28)) OR ((1 <= p12) AND (1 <= p82)) OR ((1 <= p28) AND (1 <= p103)) OR ((1 <= p102) AND (1 <= p108)) OR ((1 <= p13) AND (1 <= p93)) OR ((1 <= p72) AND (1 <= p95)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p18) AND (1 <= p43)) OR ((1 <= p50) AND (1 <= p59)) OR ((1 <= p11) AND (1 <= p66)) OR ((1 <= p55) AND (1 <= p105)) OR ((1 <= p7) AND (1 <= p63)) OR ((1 <= p13) AND (1 <= p38)) OR ((1 <= p82) AND (1 <= p83)) OR ((1 <= p34) AND (1 <= p104))))))))))) : G ((((((((((((((((((F (((1 <= p0) OR (1 <= p32) OR (1 <= p100) OR (1 <= p68) OR (1 <= p106) OR (1 <= p107) OR (1 <= p75) OR (1 <= p74) OR (1 <= p14) OR (1 <= p46) OR (1 <= p109) OR (1 <= p80) OR (1 <= p21) OR (1 <= p88) OR (1 <= p58) OR (1 <= p29))) AND X (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31)))) AND ((p95 <= 0) OR (p115 <= 0))) AND ((p34 <= 0) OR (p115 <= 0))) AND ((p5 <= 0) OR (p115 <= 0))) AND ((p54 <= 0) OR (p115 <= 0))) AND ((p11 <= 0) OR (p115 <= 0))) AND ((p28 <= 0) OR (p115 <= 0))) AND ((p13 <= 0) OR (p115 <= 0))) AND ((p45 <= 0) OR (p115 <= 0))) AND ((p18 <= 0) OR (p115 <= 0))) AND ((p50 <= 0) OR (p115 <= 0))) AND ((p55 <= 0) OR (p115 <= 0))) AND ((p108 <= 0) OR (p115 <= 0))) AND ((p48 <= 0) OR (p115 <= 0))) AND ((p42 <= 0) OR (p115 <= 0))) AND ((p63 <= 0) OR (p115 <= 0))) AND ((p82 <= 0) OR (p115 <= 0)))) : G (X ((((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0) AND ((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 <= 0)) AND ((p28 <= 0) OR (p115 <= 0)) AND ((p13 <= 0) OR (p115 <= 0)) AND ((p45 <= 0) OR (p115 <= 0)) AND ((p18 <= 0) OR (p115 <= 0)) AND ((p50 <= 0) OR (p115 <= 0)) AND ((p55 <= 0) OR (p115 <= 0)) AND ((p108 <= 0) OR (p115 <= 0)) AND ((p48 <= 0) OR (p115 <= 0)) AND ((p42 <= 0) OR (p115 <= 0)) AND ((p63 <= 0) OR (p115 <= 0)) AND ((p82 <= 0) OR (p115 <= 0))) U (((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115)))))) : X (NOT(F (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))))) : NOT((G ((((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115)))) U (X (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))) AND X ((((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1 <= p48) AND (1 <= p115)) OR ((1 <= p42) AND (1 <= p115)) OR ((1 <= p63) AND (1 <= p115)) OR ((1 <= p82) AND (1 <= p115))))))) : NOT((G (F (X (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))))) U G (((((1 <= p0) OR (1 <= p32) OR (1 <= p100) OR (1 <= p68) OR (1 <= p106) OR (1 <= p107) OR (1 <= p75) OR (1 <= p74) OR (1 <= p14) OR (1 <= p46) OR (1 <= p109) OR (1 <= p80) OR (1 <= p21) OR (1 <= p88) OR (1 <= p58) OR (1 <= p29)) U ((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31))) AND NOT(G (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31)))))))) : NOT(F ((NOT((((1 <= p5) AND (1 <= p115)) U F (((1 <= p50) AND (1 <= p59))))) U F (NOT(X ((1 <= p53))))))) : G (X (((1 <= p34) AND (1 <= p115)))) : ((F (((X ((p88 <= 0)) AND (1 <= p55)) AND (1 <= p115))) OR F (((1 <= p34) AND (1 <= p84)))) U (1 <= p88)) : (((1 <= p3) AND (F ((1 <= p3)) OR (1 <= p52))) U X (F (X (X ((1 <= p52)))))) : (G (((X (((1 <= p63) AND (1 <= p115))) U ((1 <= p63) AND (1 <= p115))) U ((p48 <= 0) OR (p115 <= 0)))) OR F (G (X (((1 <= p48) AND (1 <= p115)))))) : ((NOT(F ((1 <= p57))) OR (NOT(G ((1 <= p57))) AND ((p34 <= 0) OR (p115 <= 0)))) AND ((NOT(F ((1 <= p57))) OR (p9 <= 0)) OR (p88 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k: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:522
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0)))) OR (F (((((1 <= p74) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p74)) OR ((1 <= p9) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p25)) OR ((1 <= p9) AND (1 ... (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: F (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p53) OR (1 <= p52) OR (1 <= p116) OR (1 <= p57) OR (1 <= p91) OR (1 <= p92) OR (1 <= p31)))
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: ((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))
lola: processed formula length: 238
lola: 248 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p74) AND (1 <= p97)) OR ((1 <= p9) AND (1 <= p74)) OR ((1 <= p9) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p25)) OR ((1 <= p9) AND (1 <= p80)) OR ((1 <= p25) AND (1 <= p32)) OR ((1 <= p46) AND (1 <= p97)) OR ((1 <= p25) AND (1 <= p75)) OR ((1 <= p21) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p100)) OR ((1 <= p9) AND (1 <= p58)) OR ((1 <= p9) AND (1 <= p68)) OR ((1 <= p75) AND (... (shortened)
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: ((((p74 <= 0) OR (p97 <= 0)) AND ((p9 <= 0) OR (p74 <= 0)) AND ((p9 <= 0) OR (p21 <= 0)) AND ((p0 <= 0) OR (p25 <= 0)) AND ((p9 <= 0) OR (p80 <= 0)) AND ((p25 <= 0) OR (p32 <= 0)) AND ((p46 <= 0) OR (p97 <= 0)) AND ((p25 <= 0) OR (p75 <= 0)) AND ((p21 <= 0) OR (p25 <= 0)) AND ((p2 <= 0) OR (p100 <= 0)) AND ((p9 <= 0) OR (p58 <= 0)) AND ((p9 <= 0) OR (p68 <= 0)) AND ((p75 <= 0) OR (p97... (shortened)
lola: processed formula length: 2557
lola: 248 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65536 markings, 524288 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((X (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))) AND G (F (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((X (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))) AND G (F (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND ... (shortened)
lola: processed formula length: 751
lola: 246 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: 8211 markings, 123935 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p0) OR (1 <= p32) OR (1 <= p100) OR (1 <= p68) OR (1 <= p106) OR (1 <= p107) OR (1 <= p75) OR (1 <= p74) OR (1 <= p14) OR (1 <= p46) OR (1 <= p109) OR (1 <= p80) OR (1 <= p21) OR (1 <= p88) OR (1 <= p58) OR (1 <= p29))) AND (X (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p0) OR (1 <= p32) OR (1 <= p100) OR (1 <= p68) OR (1 <= p106) OR (1 <= p107) OR (1 <= p75) OR (1 <= p74) OR (1 <= p14) OR (1 <= p46) OR (1 <= p109) OR (1 <= p80) OR (1 <= p21) OR (1 <= p88) OR (1 <= p58) OR (1 <= p29))) AND (X (((1 <= p64) OR (1 <= p99) OR (1 <= p98) OR (1 <= p3) OR (1 <= p39) OR (1 <= p8) OR (1 <= p15) OR (1 <= p114) OR (1 <= p113) OR (1 <= p... (shortened)
lola: processed formula length: 1057
lola: 246 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: 311323 markings, 524317 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115... (shortened)
lola: processed formula length: 1841
lola: 246 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))))
lola: processed formula length: 246
lola: 246 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0)) OR (((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 <= 0)) AND ((p28 <= 0) OR (p115 <= 0)) AND ((p13 <= 0) OR (p115 <= 0)) AND ((p45 <= 0) OR (p115 <= 0)) AND ((p18 <= 0) OR (p115 <= 0)) AND ((p50 <= 0) OR (p115 <= 0)) AND ((p55 <= 0) OR (p115 <= 0)) AND ((p108 <= 0) OR (p115 <= 0)) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((1 <= p95) AND (1 <= p115)) OR ((1 <= p34) AND (1 <= p115)) OR ((1 <= p5) AND (1 <= p115)) OR ((1 <= p54) AND (1 <= p115)) OR ((1 <= p11) AND (1 <= p115)) OR ((1 <= p28) AND (1 <= p115)) OR ((1 <= p13) AND (1 <= p115)) OR ((1 <= p45) AND (1 <= p115)) OR ((1 <= p18) AND (1 <= p115)) OR ((1 <= p50) AND (1 <= p115)) OR ((1 <= p55) AND (1 <= p115)) OR ((1 <= p108) AND (1 <= p115)) OR ((1... (shortened)
lola: processed formula length: 525
lola: 248 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0)) OR (((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0)) OR (((p95 <= 0) OR (p115 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)) AND ((p5 <= 0) OR (p115 <= 0)) AND ((p54 <= 0) OR (p115 <= 0)) AND ((p11 <= 0) OR (p115 ... (shortened)
lola: processed formula length: 773
lola: 246 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: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((1 <= p53))) AND (F (((1 <= p50) AND (1 <= p59))) OR X (G ((1 <= p53))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((1 <= p53))) AND (F (((1 <= p50) AND (1 <= p59))) OR X (G ((1 <= p53))))))
lola: processed formula length: 84
lola: 246 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p34) AND (1 <= p115))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p34) AND (1 <= p115))))
lola: processed formula length: 36
lola: 246 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((X ((p88 <= 0)) AND ((1 <= p55) AND (1 <= p115))) OR ((1 <= p34) AND (1 <= p84)))) U (1 <= p88))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((X ((p88 <= 0)) AND ((1 <= p55) AND (1 <= p115))) OR ((1 <= p34) AND (1 <= p84)))) U (1 <= p88))
lola: processed formula length: 101
lola: 246 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: 41 markings, 42 edges
lola: ========================================
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (F ((1 <= p3)) OR (1 <= p52))) U X (X (X (F ((1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p3) AND (F ((1 <= p3)) OR (1 <= p52))) U X (X (X (F ((1 <= p52))))))
lola: processed formula length: 76
lola: 246 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 40 markings, 40 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((p48 <= 0) OR (p115 <= 0))) AND ((X (((1 <= p63) AND (1 <= p115))) U ((1 <= p63) AND (1 <= p115))) OR ((p48 <= 0) OR (p115 <= 0))))) OR F (G (((1 <= p48) AND (1 <= p115)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p48) AND (1 <= p115))))
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 <= p48) AND (1 <= p115))))
lola: processed formula length: 36
lola: 246 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: 26 markings, 27 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p48 <= 0) OR (p115 <= 0))) AND ((X (((1 <= p63) AND (1 <= p115))) U ((1 <= p63) AND (1 <= p115))) OR ((p48 <= 0) OR (p115 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p48 <= 0) OR (p115 <= 0))) AND ((X (((1 <= p63) AND (1 <= p115))) U ((1 <= p63) AND (1 <= p115))) OR ((p48 <= 0) OR (p115 <= 0)))))
lola: processed formula length: 142
lola: 246 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: 60304 markings, 319343 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((p5 <= 0) OR (p24 <= 0)) AND ((p18 <= 0) OR (p62 <= 0)) AND ((p17 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p81 <= 0)) AND ((p13 <= 0) OR (p61 <= 0)) AND ((p63 <= 0) OR (p69 <= 0)) AND ((p1 <= 0) OR (p45 <= 0)) AND ((p18 <= 0) OR (p70 <= 0)) AND ((p60 <= 0) OR (p108 <= 0)) AND ((p63 <= 0) OR (p67 <= 0)) AND ((p41 <= 0) OR (p108 <= 0)) AND ((p5 <= 0) OR (p77 <= 0)) AND ((p35 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((p5 <= 0) OR (p24 <= 0)) AND ((p18 <= 0) OR (p62 <= 0)) AND ((p17 <= 0) OR (p50 <= 0)) AND ((p34 <= 0) OR (p81 <= 0)) AND ((p13 <= 0) OR (p61 <= 0)) AND ((p63 <= 0) OR (p69 <= 0)) AND ((p1 <= 0) OR (p45 <= 0)) AND ((p18 <= 0) OR (p70 <= 0)) AND ((p60 <= 0) OR (p108 <= 0)) AND ((p63 <= 0) OR (p67 <= 0)) AND ((p41 <= 0) OR (p108 <= 0)) AND ((p5 <= 0) OR (p77 <= 0)) AND ((p35 ... (shortened)
lola: processed formula length: 4660
lola: 246 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 2072 markings, 11293 edges
lola: ========================================
lola: subprocess 12 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p57 <= 0)) OR (F ((p57 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)))) AND (G ((p57 <= 0)) OR ((p9 <= 0) OR (p88 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p34 <= 0) OR (p115 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p34 <= 0) OR (p115 <= 0))
lola: processed formula length: 28
lola: 246 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p9 <= 0) OR (p88 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p9 <= 0) OR (p88 <= 0))
lola: processed formula length: 25
lola: 247 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p57 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p57 <= 0))
lola: processed formula length: 14
lola: 246 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: 37 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((((p0 <= 0) AND (p32 <= 0) AND (p100 <= 0) AND (p68 <= 0) AND (p106 <= 0) AND (p107 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p14 <= 0) AND (p46 <= 0) AND (p109 <= 0) AND (p80 <= 0) AND (p21 <= 0) AND (p88 <= 0) AND (p58 <= 0) AND (p29 <= 0)) R ((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3563 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 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 (((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AND (p52 <= 0) AND (p116 <= 0) AND (p57 <= 0) AND (p91 <= 0) AND (p92 <= 0) AND (p31 <= 0))))
lola: processed formula length: 246
lola: 246 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: 21 markings, 22 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p0 <= 0) AND (p32 <= 0) AND (p100 <= 0) AND (p68 <= 0) AND (p106 <= 0) AND (p107 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p14 <= 0) AND (p46 <= 0) AND (p109 <= 0) AND (p80 <= 0) AND (p21 <= 0) AND (p88 <= 0) AND (p58 <= 0) AND (p29 <= 0)) R ((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p0 <= 0) AND (p32 <= 0) AND (p100 <= 0) AND (p68 <= 0) AND (p106 <= 0) AND (p107 <= 0) AND (p75 <= 0) AND (p74 <= 0) AND (p14 <= 0) AND (p46 <= 0) AND (p109 <= 0) AND (p80 <= 0) AND (p21 <= 0) AND (p88 <= 0) AND (p58 <= 0) AND (p29 <= 0)) R ((p64 <= 0) AND (p99 <= 0) AND (p98 <= 0) AND (p3 <= 0) AND (p39 <= 0) AND (p8 <= 0) AND (p15 <= 0) AND (p114 <= 0) AND (p113 <= 0) AND (p53 <= 0) AN... (shortened)
lola: processed formula length: 739
lola: 246 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: 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: 130497 markings, 628577 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((G ((p57 <= 0)) OR (F ((p57 <= 0)) AND ((p34 <= 0) OR (p115 <= 0)))) AND (G ((p57 <= 0)) OR ((p9 <= 0) OR (p88 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p9 <= 0) OR (p88 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((p9 <= 0) OR (p88 <= 0))
lola: processed formula length: 25
lola: 247 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p34 <= 0) OR (p115 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p34 <= 0) OR (p115 <= 0))
lola: processed formula length: 28
lola: 246 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((p57 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p57)
lola: processed formula length: 10
lola: 248 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: 29 markings, 30 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p57 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p57 <= 0))
lola: processed formula length: 14
lola: 246 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: 37 markings, 37 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no no no no no no
lola:
preliminary result: yes no no no no no no no no no no no no no
lola: memory consumption: 152264 KB
lola: time consumption: 7 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="CSRepetitions-PT-04"
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 CSRepetitions-PT-04, 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 r037-tajo-162038177100274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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