Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.7K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 12:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 12:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 16:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 16:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 9 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 23:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 172K Mar 24 05:38 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-r0010w0100-00
FORMULA_NAME RwMutex-PT-r0010w0100-01
FORMULA_NAME RwMutex-PT-r0010w0100-02
FORMULA_NAME RwMutex-PT-r0010w0100-03
FORMULA_NAME RwMutex-PT-r0010w0100-04
FORMULA_NAME RwMutex-PT-r0010w0100-05
FORMULA_NAME RwMutex-PT-r0010w0100-06
FORMULA_NAME RwMutex-PT-r0010w0100-07
FORMULA_NAME RwMutex-PT-r0010w0100-08
FORMULA_NAME RwMutex-PT-r0010w0100-09
FORMULA_NAME RwMutex-PT-r0010w0100-10
FORMULA_NAME RwMutex-PT-r0010w0100-11
FORMULA_NAME RwMutex-PT-r0010w0100-12
FORMULA_NAME RwMutex-PT-r0010w0100-13
FORMULA_NAME RwMutex-PT-r0010w0100-14
FORMULA_NAME RwMutex-PT-r0010w0100-15

=== Now, execution of the tool begins

BK_START 1591232805215

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:06:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 01:06:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:06:46] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2020-06-04 01:06:46] [INFO ] Transformed 230 places.
[2020-06-04 01:06:46] [INFO ] Transformed 220 transitions.
[2020-06-04 01:06:46] [INFO ] Parsed PT model containing 230 places and 220 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 62270 steps, including 0 resets, run visited all 55 properties in 343 ms. (steps per millisecond=181 )
[2020-06-04 01:06:47] [INFO ] Flatten gal took : 68 ms
[2020-06-04 01:06:47] [INFO ] Flatten gal took : 32 ms
[2020-06-04 01:06:47] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 01:06:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r0010w0100 @ 3570 seconds

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

FORMULA RwMutex-PT-r0010w0100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA RwMutex-PT-r0010w0100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0100-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA RwMutex-PT-r0010w0100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RwMutex-PT-r0010w0100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RwMutex-PT-r0010w0100-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ RwMutex-PT-r0010w0100

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p89 <= 0))",
"processed_size": 162,
"rewrites": 181
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 220
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(((p8 <= 0) OR (p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p78 <= 0)))",
"processed_size": 330,
"rewrites": 181
},
"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": 220
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((p141 <= 0)))",
"processed_size": 19,
"rewrites": 179
},
"result":
{
"edges": 10433,
"markings": 1123,
"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": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p202))) AND ((1 <= p65) OR ((G ((1 <= p53)) AND F ((1 <= p65))) OR X (X (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p202))))))))))",
"processed_size": 414,
"rewrites": 179
},
"result":
{
"edges": 123,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 12,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "G ((F (G ((F ((1 <= p21)) AND (1 <= p0)))) OR (X ((1 <= p82)) AND ((1 <= p26) AND ((1 <= p27) AND ((1 <= p28) AND ((1 <= p29) AND ((1 <= p30) AND ((1 <= p31) AND ((1 <= p32) AND ((1 <= p33) AND ((1 <= p35) AND ((1 <= p36) AND (1 <= p182))))))))))))))",
"processed_size": 250,
"rewrites": 179
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G ((X (((p2 <= 0) OR (p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0))) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p200))))",
"processed_size": 338,
"rewrites": 179
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((G ((G ((X (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR X ((p70 <= 0)))) OR X ((1 <= p70))))",
"processed_size": 392,
"rewrites": 179
},
"result":
{
"edges": 31007,
"markings": 3200,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F (((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p229 <= 0)))))",
"processed_size": 175,
"rewrites": 179
},
"result":
{
"edges": 420,
"markings": 267,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p24) U ((1 <= p24) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p192))))) AND ((1 <= p58) U X ((1 <= p58)))))",
"processed_size": 239,
"rewrites": 179
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "X ((F ((1 <= p44)) U G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p185)))))",
"processed_size": 190,
"rewrites": 179
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 23,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 23,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (X (G (((F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p151))) OR (p77 <= 0)) AND ((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p200 <= 0)))))))",
"processed_size": 369,
"rewrites": 179
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X ((G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p156))) AND ((1 <= p83) U (1 <= p85)))))",
"processed_size": 207,
"rewrites": 179
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p97)))",
"processed_size": 18,
"rewrites": 179
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 4,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 57,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 57,
"taut": 0,
"tconj": 11,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(((((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p170)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p199))) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p170))) U ((((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p199) AND (1 <= p170)) U (1 <= p63)) AND ((1 <= p26) AND ((1 <= p27) AND ((1 <= p28) AND ((1 <= p29) AND ((1 <= p30) AND ((1 <= p31) AND ((1 <= p32) AND ((1 <= p33) AND ((1 <= p35) AND ((1 <= p36) AND (1 <= p199)))))))))))))",
"processed_size": 886,
"rewrites": 179
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 12,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "F (((1 <= p60) AND (G (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p214)))) OR (((1 <= p144) U G ((1 <= p144))) AND (1 <= p74)))))",
"processed_size": 246,
"rewrites": 179
},
"result":
{
"edges": 224,
"markings": 50,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "F (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p157))))",
"processed_size": 171,
"rewrites": 179
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p106) OR (1 <= p107))",
"processed_size": 28,
"rewrites": 180
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p69 <= 0)",
"processed_size": 10,
"rewrites": 181
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 92852,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND X(G(**))) : (F(**) AND X(G(*))) : F((** AND (G(F(**)) OR ((** U G(**)) AND **)))) : F(G((F(**) AND (** OR ((G(**) AND F(**)) OR X(X(F(**)))))))) : G((F(G((F(**) AND **))) OR (X(**) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))))) : F(G(**)) : (F(G(**)) AND (** AND **)) : G((X(*) OR *)) : X((G((G((X(G(**)) OR **)) OR X(*))) OR X(**))) : (((** U **) U **) U ((** U **) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))) : X(X(F(*))) : G((X((** U **)) AND (** U X(**)))) : X((F(**) U G(**))) : X(X(X(G(((F(**) OR *) AND *))))) : X(X((G(**) AND (** U **)))) : (F(**) OR ((G(**) AND F(**)) OR (** OR **)))"
},
"net":
{
"arcs": 2460,
"conflict_clusters": 111,
"places": 230,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 220
},
"result":
{
"preliminary_value": "no no no no no no no no no no yes no no no no no ",
"value": "no no no no no no no no no no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 450/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 230
lola: finding significant places
lola: 230 places, 220 transitions, 110 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: (F (((p137 <= 0) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p89)))) AND X (G ((1 <= p143)))) : ((NOT(X (X ((1 <= p141)))) U F ((((1 <= p8) AND (1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p78))))) AND G (NOT(X ((1 <= p141))))) : F (((1 <= p60) AND (((1 <= p60) U G (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p214))))) OR (((1 <= p144) U G ((1 <= p144))) AND (1 <= p74))))) : F (G (((G ((1 <= p53)) U (1 <= p65)) U F (((1 <= p65) U X (X (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p202))))))))) : G ((G (X (X (F (G ((F ((1 <= p21)) AND (1 <= p0))))))) OR (((((((((((X ((1 <= p82)) AND (1 <= p26)) AND (1 <= p27)) AND (1 <= p28)) AND (1 <= p29)) AND (1 <= p30)) AND (1 <= p31)) AND (1 <= p32)) AND (1 <= p33)) AND (1 <= p35)) AND (1 <= p36)) AND (1 <= p182)))) : F (G ((1 <= p97))) : (((X ((G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p157))) OR ((1 <= p31) AND (1 <= p197)))) U F (G (X (F (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p157)))))))) AND (1 <= p31)) AND (1 <= p197)) : NOT(F ((X (((1 <= p2) AND (1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36))) AND ((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p200 <= 0))))) : X ((G ((G ((G (X (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR NOT(X ((1 <= p70))))) OR X ((1 <= p70)))) : (((((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p170)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p199))) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p170))) U ((((((((((((((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p199) AND (1 <= p170)) U (1 <= p63)) AND (1 <= p26)) AND (1 <= p27)) AND (1 <= p28)) AND (1 <= p29)) AND (1 <= p30)) AND (1 <= p31)) AND (1 <= p32)) AND (1 <= p33)) AND (1 <= p35)) AND (1 <= p36)) AND (1 <= p199))) : NOT(X (NOT(F (NOT(X (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p229)))))))) : G ((X (((1 <= p24) U ((1 <= p24) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p192))))) AND ((1 <= p58) U X ((1 <= p58))))) : X ((F (((1 <= p15) U (1 <= p44))) U G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p185))))) : X (NOT(X (X ((F ((NOT(F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p151)))) AND (1 <= p77))) OR F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p200)))))))) : (X (X (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p156))))) AND X (X (((1 <= p83) U (1 <= p85))))) : (((G ((1 <= p69)) U F ((1 <= p69))) OR (1 <= p106)) OR (1 <= p107))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:519
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p89))) AND X (G ((1 <= p143))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p89)))
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: ((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p89 <= 0))
lola: processed formula length: 162
lola: 181 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p143)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p143)))
lola: processed formula length: 19
lola: 179 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 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p8) AND (1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p78)))) AND X (G ((p141 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p8) AND (1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36)) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p78))))
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: (((p8 <= 0) OR (p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0)) AND ((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p78 <= 0)))
lola: processed formula length: 330
lola: 181 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p141 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p141 <= 0)))
lola: processed formula length: 19
lola: 179 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: 1123 markings, 10433 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p202))) AND ((1 <= p65) OR ((G ((1 <= p53)) AND F ((1 <= p65))) OR X (X (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p202))) AND ((1 <= p65) OR ((G ((1 <= p53)) AND F ((1 <= p65))) OR X (X (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= ... (shortened)
lola: processed formula length: 414
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 18 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: 38 markings, 123 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((F ((1 <= p21)) AND (1 <= p0)))) OR (X ((1 <= p82)) AND ((1 <= p26) AND ((1 <= p27) AND ((1 <= p28) AND ((1 <= p29) AND ((1 <= p30) AND ((1 <= p31) AND ((1 <= p32) AND ((1 <= p33) AND ((1 <= p35) AND ((1 <= p36) AND (1 <= p182))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((F ((1 <= p21)) AND (1 <= p0)))) OR (X ((1 <= p82)) AND ((1 <= p26) AND ((1 <= p27) AND ((1 <= p28) AND ((1 <= p29) AND ((1 <= p30) AND ((1 <= p31) AND ((1 <= p32) AND ((1 <= p33) AND ((1 <= p35) AND ((1 <= p36) AND (1 <= p182))))))))))))))
lola: processed formula length: 250
lola: 179 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p2 <= 0) OR (p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0))) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p200))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p2 <= 0) OR (p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0))) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p200))))
lola: processed formula length: 338
lola: 179 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((X (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR X ((p70 <= 0)))) OR X ((1 <= p70))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((X (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p162)))) OR X ((p70 <= 0)))) OR X ((1 <= p70))))
lola: processed formula length: 392
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 3200 markings, 31007 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p229 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p229 <= 0)))))
lola: processed formula length: 175
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 267 markings, 420 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p24) U ((1 <= p24) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p192))))) AND ((1 <= p58) U X ((1 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p24) U ((1 <= p24) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p192))))) AND ((1 <= p58) U X ((1 <= p58)))))
lola: processed formula length: 239
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p44)) U G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p185)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p44)) U G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p185)))))
lola: processed formula length: 190
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G (((F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p151))) OR (p77 <= 0)) AND ((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p200 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G (((F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p151))) OR (p77 <= 0)) AND ((p26 <= 0) OR (p27 <= 0) OR (p28 <= 0) OR (p29 <= 0) OR (p30 <= 0) OR (p31 <= 0) OR (p32 <= 0) OR (p33 <= 0) OR (p35 <= 0) OR (p36 <= 0) OR (p200 <= 0)))))))
lola: processed formula length: 369
lola: 179 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p156))) AND ((1 <= p83) U (1 <= p85)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p156))) AND ((1 <= p83) U (1 <= p85)))))
lola: processed formula length: 207
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p97)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p97)))
lola: processed formula length: 18
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 122
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 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p170)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p199))) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p170)) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p199))) U ((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 ... (shortened)
lola: processed formula length: 886
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p60) AND (G (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p214)))) OR (((1 <= p144) U G ((1 <= p144))) AND (1 <= p74)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((1 <= p60) AND (G (F (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p214)))) OR (((1 <= p144) U G ((1 <= p144))) AND (1 <= p74)))))
lola: processed formula length: 246
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 50 markings, 224 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p157)))) AND ((1 <= p31) AND (1 <= p197)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p31) AND (1 <= p197))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p31) AND (1 <= p197))
lola: processed formula length: 28
lola: 180 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p157))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p26) AND (1 <= p27) AND (1 <= p28) AND (1 <= p29) AND (1 <= p30) AND (1 <= p31) AND (1 <= p32) AND (1 <= p33) AND (1 <= p35) AND (1 <= p36) AND (1 <= p157))))
lola: processed formula length: 171
lola: 179 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 122
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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p69)) OR ((G ((1 <= p69)) AND F ((1 <= p69))) OR ((1 <= p106) OR (1 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p106) OR (1 <= p107))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p106) OR (1 <= p107))
lola: processed formula length: 28
lola: 180 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p69))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p69))
lola: processed formula length: 14
lola: 179 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p69)) OR ((G ((1 <= p69)) AND F ((1 <= p69))) OR ((1 <= p106) OR (1 <= p107))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p106) OR (1 <= p107))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p106) OR (1 <= p107))
lola: processed formula length: 28
lola: 180 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((1 <= p69))
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: (p69 <= 0)
lola: processed formula length: 10
lola: 181 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no yes no no no no no
lola:
preliminary result: no no no no no no no no no no yes no no no no no
lola: memory consumption: 92852 KB
lola: time consumption: 6 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-r0010w0100"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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