Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 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 3.2K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 11:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 11:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 11 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 887K 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 RwMutex-PT-r0010w0500-00
FORMULA_NAME RwMutex-PT-r0010w0500-01
FORMULA_NAME RwMutex-PT-r0010w0500-02
FORMULA_NAME RwMutex-PT-r0010w0500-03
FORMULA_NAME RwMutex-PT-r0010w0500-04
FORMULA_NAME RwMutex-PT-r0010w0500-05
FORMULA_NAME RwMutex-PT-r0010w0500-06
FORMULA_NAME RwMutex-PT-r0010w0500-07
FORMULA_NAME RwMutex-PT-r0010w0500-08
FORMULA_NAME RwMutex-PT-r0010w0500-09
FORMULA_NAME RwMutex-PT-r0010w0500-10
FORMULA_NAME RwMutex-PT-r0010w0500-11
FORMULA_NAME RwMutex-PT-r0010w0500-12
FORMULA_NAME RwMutex-PT-r0010w0500-13
FORMULA_NAME RwMutex-PT-r0010w0500-14
FORMULA_NAME RwMutex-PT-r0010w0500-15

=== Now, execution of the tool begins

BK_START 1621034714797

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 23:25:17] [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-14 23:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 23:25:18] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2021-05-14 23:25:18] [INFO ] Transformed 1030 places.
[2021-05-14 23:25:18] [INFO ] Transformed 1020 transitions.
[2021-05-14 23:25:18] [INFO ] Found NUPN structural information;
[2021-05-14 23:25:18] [INFO ] Parsed PT model containing 1030 places and 1020 transitions in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 5140 ms. (steps per millisecond=19 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1020 rows 1030 cols
[2021-05-14 23:25:23] [INFO ] Computed 520 place invariants in 271 ms
[2021-05-14 23:25:24] [INFO ] [Real]Absence check using 520 positive place invariants in 336 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-14 23:25:25] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-14 23:25:25] [INFO ] Flatten gal took : 530 ms
FORMULA RwMutex-PT-r0010w0500-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0500-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 23:25:25] [INFO ] Applying decomposition
[2021-05-14 23:25:25] [INFO ] Flatten gal took : 202 ms
[2021-05-14 23:25:25] [INFO ] Decomposing Gal with order
[2021-05-14 23:25:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 23:25:28] [INFO ] Removed a total of 8990 redundant transitions.
[2021-05-14 23:25:28] [INFO ] Flatten gal took : 2221 ms
[2021-05-14 23:25:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 71 ms.
[2021-05-14 23:25:30] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2021-05-14 23:25:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 70 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r0010w0500 @ 3570 seconds

FORMULA RwMutex-PT-r0010w0500-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0500-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3441
rslt: Output for LTLFireability @ RwMutex-PT-r0010w0500

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 312
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p978))",
"processed_size": 13,
"rewrites": 216
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 344
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((p351 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))",
"processed_size": 173,
"rewrites": 218
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 1020
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 344
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 34,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G (F ((G ((X ((((p129 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) R ((p152 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))) OR ((p16 <= 0)))) OR ((1 <= p285) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))))",
"processed_size": 564,
"rewrites": 216
},
"result":
{
"edges": 42941,
"markings": 3574,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": 1,
"visible_transitions": 0
},
"processed": "G ((G (((p794 <= 0))) OR X (X (((1 <= p794))))))",
"processed_size": 48,
"rewrites": 216
},
"result":
{
"edges": 10824,
"markings": 1321,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 4,
"aconj": 15,
"adisj": 0,
"aneg": 0,
"comp": 55,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 55,
"taut": 0,
"tconj": 12,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (F ((X ((X (((1 <= p450) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR ((G (((1 <= p136) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND X (F (((1 <= p450) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))) OR ((1 <= p54) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))) AND (((1 <= p177)) AND (((1 <= p501)) AND (((1 <= p502)) AND (((1 <= p503)) AND (((1 <= p504)) AND (((1 <= p505)) AND (((1 <= p506)) AND (((1 <= p507)) AND (((1 <= p508)) AND (((1 <= p510)) AND ((1 <= p511)))))))))))))))",
"processed_size": 958,
"rewrites": 216
},
"result":
{
"edges": 28,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 21
},
"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": 491
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 491
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p562 <= 0))",
"processed_size": 13,
"rewrites": 218
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((1 <= p421) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))",
"processed_size": 173,
"rewrites": 216
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 573
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((1 <= p464) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))",
"processed_size": 173,
"rewrites": 218
},
"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": 1020
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G ((((p930 <= 0)) AND ((p268 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))",
"processed_size": 197,
"rewrites": 216
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 33,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(X (((1 <= p258) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (((1 <= p464) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U ((p464 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))",
"processed_size": 533,
"rewrites": 216
},
"result":
{
"edges": 1020,
"markings": 1021,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p528))",
"processed_size": 13,
"rewrites": 216
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(((1 <= p79)) AND ((1 <= p501)) AND ((1 <= p502)) AND ((1 <= p503)) AND ((1 <= p504)) AND ((1 <= p505)) AND ((1 <= p506)) AND ((1 <= p507)) AND ((1 <= p508)) AND ((1 <= p510)) AND ((1 <= p511)))",
"processed_size": 194,
"rewrites": 235
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1147
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (((1 <= p528)))",
"processed_size": 17,
"rewrites": 216
},
"result":
{
"edges": 4,
"markings": 4,
"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": 1720
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p534))))",
"processed_size": 21,
"rewrites": 216
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p1007))) OR X ((G (((1 <= p930))) OR ((1 <= p480) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))",
"processed_size": 228,
"rewrites": 216
},
"result":
{
"edges": 10,
"markings": 8,
"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": 1147
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((F (((1 <= p629))) OR (G (((p629 <= 0))) AND F (((1 <= p629))))) AND ((1 <= p881)))))",
"processed_size": 92,
"rewrites": 216
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1720
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G (((p477 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))",
"processed_size": 181,
"rewrites": 216
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 3441
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p865 <= 0)))",
"processed_size": 17,
"rewrites": 216
},
"result":
{
"edges": 456,
"markings": 230,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 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 <= p8))",
"processed_size": 11,
"rewrites": 218
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p865 <= 0)))",
"processed_size": 17,
"rewrites": 216
},
"result":
{
"edges": 456,
"markings": 230,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 308228,
"runtime": 129.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((X(**) AND **) OR (X(G(**)) AND F(*))) : G(F((G((X((* R *)) OR *)) OR **))) : (G(*) AND ((F(*) OR G(*)) AND F(*))) : G((G(*) OR X(X(**)))) : X(F((X((X(**) OR ((G(**) AND X(F(**))) OR **))) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))) : ((F(**) OR **) AND (X(F(**)) OR F(**))) : F(G(*)) : ((X(**) U (** U **)) OR (G(**) AND F(**))) : (X(G(**)) OR (** OR (X(**) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))) : F((F(**) OR X((G(**) OR **)))) : X(G(((F(**) OR (G(*) AND F(**))) AND **)))"
},
"net":
{
"arcs": 12060,
"conflict_clusters": 511,
"places": 1030,
"places_significant": 510,
"singleton_clusters": 0,
"transitions": 1020
},
"result":
{
"preliminary_value": "no yes no no no no no yes no no no ",
"value": "no yes no no no no no yes 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: 2050/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1030
lola: finding significant places
lola: 1030 places, 1020 transitions, 510 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p1016 <= 1)
lola: LP says that atomic proposition is always true: (p978 <= 1)
lola: LP says that atomic proposition is always true: (p1016 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p760 <= 1)
lola: LP says that atomic proposition is always true: (p865 <= 1)
lola: LP says that atomic proposition is always true: (p760 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p794 <= 1)
lola: LP says that atomic proposition is always true: (p794 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p450 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p562 <= 1)
lola: LP says that atomic proposition is always true: (p421 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p669 <= 1)
lola: LP says that atomic proposition is always true: (p562 <= 1)
lola: LP says that atomic proposition is always true: (p335 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p477 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p477 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p930 <= 1)
lola: LP says that atomic proposition is always true: (p268 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p464 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p464 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p534 <= 1)
lola: LP says that atomic proposition is always true: (p528 <= 1)
lola: LP says that atomic proposition is always true: (p528 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p930 <= 1)
lola: LP says that atomic proposition is always true: (p1007 <= 1)
lola: LP says that atomic proposition is always true: (p930 <= 1)
lola: LP says that atomic proposition is always true: (p480 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p502 <= 1)
lola: LP says that atomic proposition is always true: (p503 <= 1)
lola: LP says that atomic proposition is always true: (p504 <= 1)
lola: LP says that atomic proposition is always true: (p505 <= 1)
lola: LP says that atomic proposition is always true: (p506 <= 1)
lola: LP says that atomic proposition is always true: (p507 <= 1)
lola: LP says that atomic proposition is always true: (p508 <= 1)
lola: LP says that atomic proposition is always true: (p510 <= 1)
lola: LP says that atomic proposition is always true: (p511 <= 1)
lola: LP says that atomic proposition is always true: (p629 <= 1)
lola: LP says that atomic proposition is always true: (p629 <= 1)
lola: LP says that atomic proposition is always true: (p881 <= 1)
lola: ((X (((1 <= p1016))) AND ((1 <= p978))) OR (G (X (((1 <= p1016)))) AND NOT(G (((p351 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))))) : X (G (F ((NOT(F ((X ((((1 <= p129) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U ((1 <= p152) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) AND ((1 <= p16))))) OR ((1 <= p285) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))))) : (NOT((G (((1 <= p8))) U F ((((1 <= p760)) U ((1 <= p865)))))) AND NOT(G (((1 <= p760))))) : G ((NOT(F ((NOT(G (((1 <= p111) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) U ((1 <= p794))))) OR X (X (((1 <= p794)))))) : X (F ((((((((((((X (((G (((1 <= p136) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U X (((1 <= p450) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) OR ((1 <= p54) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))) AND ((1 <= p177))) AND ((1 <= p501))) AND ((1 <= p502))) AND ((1 <= p503))) AND ((1 <= p504))) AND ((1 <= p505))) AND ((1 <= p506))) AND ((1 <= p507))) AND ((1 <= p508))) AND ((1 <= p510))) AND ((1 <= p511))))) : ((F (((1 <= p562))) OR ((1 <= p421) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND (F (X (((1 <= p669)))) OR F (((1 <= p562))))) : F (G (NOT((X ((((((((((((G (((1 <= p335) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR ((p477 <= 0))) OR ((p501 <= 0))) OR ((p502 <= 0))) OR ((p503 <= 0))) OR ((p504 <= 0))) OR ((p505 <= 0))) OR ((p506 <= 0))) OR ((p507 <= 0))) OR ((p508 <= 0))) OR ((p510 <= 0))) OR ((p511 <= 0)))) U G (F (((1 <= p477) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))))))) : (G ((((p930 <= 0)) AND ((p268 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))) U (X (((1 <= p258) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (((1 <= p464) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U ((p464 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))) : ((X (G (((1 <= p534)))) OR ((1 <= p528))) OR (((((((((((X (((1 <= p528))) AND ((1 <= p79))) AND ((1 <= p501))) AND ((1 <= p502))) AND ((1 <= p503))) AND ((1 <= p504))) AND ((1 <= p505))) AND ((1 <= p506))) AND ((1 <= p507))) AND ((1 <= p508))) AND ((1 <= p510))) AND ((1 <= p511)))) : F (((((1 <= p930)) U F (((1 <= p1007)))) OR X ((G (((1 <= p930))) OR ((1 <= p480) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))))) : G (X (G (((NOT(F (((1 <= p629)))) U F (((1 <= p629)))) AND ((1 <= p881))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p1016))) AND ((1 <= p978))) OR (X (G (((1 <= p1016)))) AND F (((1 <= p351) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p978))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p978))
lola: processed formula length: 13
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p351) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)))
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: ((p351 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))
lola: processed formula length: 173
lola: 218 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 2 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p1016))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p1016))))
lola: processed formula length: 22
lola: 216 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((X ((((p129 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) R ((p152 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))) OR ((p16 <= 0)))) OR ((1 <= p285)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((X ((((p129 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)) R ((p152 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))) OR ((p16 <= 0)))) OR ((1 <= p285)... (shortened)
lola: processed formula length: 564
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3574 markings, 42941 edges
lola: ========================================
lola: subprocess 2 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p794 <= 0))) OR X (X (((1 <= p794))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p794 <= 0))) OR X (X (((1 <= p794))))))
lola: processed formula length: 48
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1321 markings, 10824 edges
lola: ========================================
lola: subprocess 3 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((X (((1 <= p450) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR ((G (((1 <= p136) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND X (F (((1 <= p450) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((X (((1 <= p450) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) OR ((G (((1 <= p136) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND X (F (((1 <= p450) AND (... (shortened)
lola: processed formula length: 958
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 28 edges
lola: ========================================
lola: subprocess 4 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p562))) OR ((1 <= p421) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) AND (X (F (((1 <= p669)))) OR F (((1 <= p562)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p562)))
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: ((p562 <= 0))
lola: processed formula length: 13
lola: 218 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p421) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p421) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))
lola: processed formula length: 173
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 11 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 6 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p669))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p669))))
lola: processed formula length: 21
lola: 216 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: 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: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p258) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (((1 <= p464) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U ((p464 <= 0) OR (p501 <= 0) OR (p502 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p464 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0)))
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: ((1 <= p464) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))
lola: processed formula length: 173
lola: 218 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 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p930 <= 0)) AND ((p268 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p930 <= 0)) AND ((p268 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))
lola: processed formula length: 197
lola: 216 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p258) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (((1 <= p464) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U ((p464 <= 0) OR (p501 <= 0) OR (p502 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p258) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))) U (((1 <= p464) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511)) U ((p464 <= 0) OR (p501 <= 0) OR (p502 <= ... (shortened)
lola: processed formula length: 533
lola: 216 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1021 markings, 1020 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p534)))) OR (((1 <= p528)) OR (X (((1 <= p528))) AND (((1 <= p79)) AND (((1 <= p501)) AND (((1 <= p502)) AND (((1 <= p503)) AND (((1 <= p504)) AND (((1 <= p505)) AND (((1 <= p506)) AND (((1 <= p507)) AND (((1 <= p508)) AND (((1 <= p510)) AND ((1 <= p511)))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p528))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p528))
lola: processed formula length: 13
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p79)) AND (((1 <= p501)) AND (((1 <= p502)) AND (((1 <= p503)) AND (((1 <= p504)) AND (((1 <= p505)) AND (((1 <= p506)) AND (((1 <= p507)) AND (((1 <= p508)) AND (((1 <= p510)) AND ((1 <= p511))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((1 <= p79)) AND ((1 <= p501)) AND ((1 <= p502)) AND ((1 <= p503)) AND ((1 <= p504)) AND ((1 <= p505)) AND ((1 <= p506)) AND ((1 <= p507)) AND ((1 <= p508)) AND ((1 <= p510)) AND ((1 <= p511)))
lola: processed formula length: 194
lola: 235 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 11 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 8 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p528)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p528)))
lola: processed formula length: 17
lola: 216 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 1720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p534))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p534))))
lola: processed formula length: 21
lola: 216 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p1007))) OR X ((G (((1 <= p930))) OR ((1 <= p480) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p1007))) OR X ((G (((1 <= p930))) OR ((1 <= p480) AND (1 <= p501) AND (1 <= p502) AND (1 <= p503) AND (1 <= p504) AND (1 <= p505) AND (1 <= p506) AND (1 <= p507) AND (1 <= p508) AND (1 <= p510) AND (1 <= p511))))))
lola: processed formula length: 228
lola: 216 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: 8 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 1147 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F (((1 <= p629))) OR (G (((p629 <= 0))) AND F (((1 <= p629))))) AND ((1 <= p881)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F (((1 <= p629))) OR (G (((p629 <= 0))) AND F (((1 <= p629))))) AND ((1 <= p881)))))
lola: processed formula length: 92
lola: 216 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 1720 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p477 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 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 (((p477 <= 0) OR (p501 <= 0) OR (p502 <= 0) OR (p503 <= 0) OR (p504 <= 0) OR (p505 <= 0) OR (p506 <= 0) OR (p507 <= 0) OR (p508 <= 0) OR (p510 <= 0) OR (p511 <= 0))))
lola: processed formula length: 181
lola: 216 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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 3441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p865 <= 0))) AND ((F (((p8 <= 0))) OR G (((p865 <= 0)))) AND F (((p760 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p865 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p865 <= 0)))
lola: processed formula length: 17
lola: 216 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: 230 markings, 456 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((p8 <= 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 <= p8))
lola: processed formula length: 11
lola: 218 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 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p865 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p865 <= 0)))
lola: processed formula length: 17
lola: 216 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: 230 markings, 456 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no yes no no no
lola:
preliminary result: no yes no no no no no yes no no no
lola: memory consumption: 308228 KB
lola: time consumption: 129 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="RwMutex-PT-r0010w0500"
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 RwMutex-PT-r0010w0500, 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 r208-smll-162089471000074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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