About the Execution of 2020-gold for DiscoveryGPU-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16252.224 | 3600000.00 | 1797026.00 | 21905.90 | FFFFFFF?FTFFFFFF | normal |
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.r094-tall-162048902400158.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DiscoveryGPU-PT-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902400158
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 39K 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 DiscoveryGPU-PT-11a-00
FORMULA_NAME DiscoveryGPU-PT-11a-01
FORMULA_NAME DiscoveryGPU-PT-11a-02
FORMULA_NAME DiscoveryGPU-PT-11a-03
FORMULA_NAME DiscoveryGPU-PT-11a-04
FORMULA_NAME DiscoveryGPU-PT-11a-05
FORMULA_NAME DiscoveryGPU-PT-11a-06
FORMULA_NAME DiscoveryGPU-PT-11a-07
FORMULA_NAME DiscoveryGPU-PT-11a-08
FORMULA_NAME DiscoveryGPU-PT-11a-09
FORMULA_NAME DiscoveryGPU-PT-11a-10
FORMULA_NAME DiscoveryGPU-PT-11a-11
FORMULA_NAME DiscoveryGPU-PT-11a-12
FORMULA_NAME DiscoveryGPU-PT-11a-13
FORMULA_NAME DiscoveryGPU-PT-11a-14
FORMULA_NAME DiscoveryGPU-PT-11a-15
=== Now, execution of the tool begins
BK_START 1620738244489
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 13:04:06] [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-11 13:04:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 13:04:06] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-11 13:04:06] [INFO ] Transformed 113 places.
[2021-05-11 13:04:06] [INFO ] Transformed 155 transitions.
[2021-05-11 13:04:06] [INFO ] Found NUPN structural information;
[2021-05-11 13:04:06] [INFO ] Parsed PT model containing 113 places and 155 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 7973 steps, including 69 resets, run visited all 42 properties in 43 ms. (steps per millisecond=185 )
[2021-05-11 13:04:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-11 13:04:06] [INFO ] Flatten gal took : 39 ms
FORMULA DiscoveryGPU-PT-11a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 13:04:06] [INFO ] Applying decomposition
[2021-05-11 13:04:06] [INFO ] Flatten gal took : 13 ms
[2021-05-11 13:04:06] [INFO ] Decomposing Gal with order
[2021-05-11 13:04:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 13:04:06] [INFO ] Removed a total of 97 redundant transitions.
[2021-05-11 13:04:06] [INFO ] Flatten gal took : 39 ms
[2021-05-11 13:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 8 ms.
[2021-05-11 13:04:06] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-11 13:04:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DiscoveryGPU-PT-11a @ 3570 seconds
FORMULA DiscoveryGPU-PT-11a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-11a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1780
rslt: Output for LTLFireability @ DiscoveryGPU-PT-11a
{
"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": "Tue May 11 13:04:07 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((1 <= p46) AND (1 <= p111) AND (1 <= p89)) AND (G (((p100 <= 0) OR (p111 <= 0) OR (p46 <= 0) OR (p111 <= 0))) OR F (((p36 <= 0))))))",
"processed_size": 140,
"rewrites": 62
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (((p81 <= 0))) AND F (((p67 <= 0) OR (p111 <= 0)))))",
"processed_size": 59,
"rewrites": 62
},
"result":
{
"edges": 77,
"markings": 72,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X (G (((1 <= p21) AND ((p70 <= 0) OR (p111 <= 0))))) U (((1 <= p21)) OR ((1 <= p54) AND (1 <= p112))))",
"processed_size": 105,
"rewrites": 62
},
"result":
{
"edges": 57,
"markings": 57,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 <= p18))))",
"processed_size": 20,
"rewrites": 62
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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": "X (X (F (((p46 <= 0)))))",
"processed_size": 24,
"rewrites": 62
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((F (((((1 <= p73)) U ((1 <= p22) AND (1 <= p111))) AND G (((1 <= p84) AND (1 <= p112))))) AND G (((1 <= p22) AND (1 <= p111))))))",
"processed_size": 135,
"rewrites": 62
},
"result":
{
"edges": 58,
"markings": 58,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((((1 <= p76) AND (1 <= p111)) U (G (((1 <= p90) AND (1 <= p111))) AND ((p90 <= 0) OR (p111 <= 0)))) OR X (((p105 <= 0) OR (p111 <= 0)))))",
"processed_size": 143,
"rewrites": 62
},
"result":
{
"edges": 290,
"markings": 285,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((G (((p46 <= 0) OR (p111 <= 0))) OR (G (((1 <= p33))) AND F (G (((p46 <= 0) OR (p111 <= 0)))))) U G (((p104 <= 0) OR (p112 <= 0)))))",
"processed_size": 139,
"rewrites": 62
},
"result":
{
"edges": 64,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 713
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((1 <= p88) AND (1 <= p112)))) AND F (((1 <= p48) AND (1 <= p112))))))",
"processed_size": 83,
"rewrites": 62
},
"result":
{
"edges": 59,
"markings": 58,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p49) AND (1 <= p111))))",
"processed_size": 36,
"rewrites": 62
},
"result":
{
"edges": 4,
"markings": 4,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"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": "((p91 <= 0))",
"processed_size": 12,
"rewrites": 64
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p80) AND (1 <= p111))",
"processed_size": 28,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p48) AND (1 <= p112)) OR ((1 <= p84)))",
"processed_size": 47,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p48 <= 0) OR (p112 <= 0)) AND ((p84 <= 0)))",
"processed_size": 47,
"rewrites": 64
},
"result":
{
"edges": 64,
"markings": 63,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 38
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p53)) OR ((1 <= p12) AND (1 <= p111)))))",
"processed_size": 55,
"rewrites": 62
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p80) AND (1 <= p111))",
"processed_size": 28,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p48) AND (1 <= p112)) OR ((1 <= p84)))",
"processed_size": 47,
"rewrites": 62
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p106) AND (1 <= p111)))",
"processed_size": 33,
"rewrites": 62
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p53)) OR ((1 <= p12) AND (1 <= p111)))))",
"processed_size": 55,
"rewrites": 62
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((F (((1 <= p20) AND (1 <= p111))) U ((1 <= p20) AND (1 <= p111))) OR (((1 <= p20) AND (1 <= p111)) OR ((1 <= p12) AND (1 <= p111)))))",
"processed_size": 137,
"rewrites": 62
},
"result":
{
"edges": 53,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3976,
"runtime": 1790.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((** AND (G(*) OR F(*)))) : (G(((F(**) U **) OR (** OR **))) OR F(G(**))) : X((G(**) AND F(*))) : G(F(**)) : (X(G(**)) U **) : X(G(**)) : (** OR ((G(**) AND F(**)) OR (F(G(*)) OR **))) : X(X(F(*))) : X(F((F(((** U **) AND G(**))) AND G(**)))) : (F(**) OR (G(**) AND F(**))) : G(((** U (G(**) AND **)) OR X(*))) : X(((G(*) OR (G(**) AND F(G(*)))) U G(*))) : (F(G((X(F(**)) AND F(**)))) AND G((F(**) OR G((X(F(**)) AND F(**))))))"
},
"net":
{
"arcs": 498,
"conflict_clusters": 14,
"places": 113,
"places_significant": 111,
"singleton_clusters": 0,
"transitions": 155
},
"result":
{
"preliminary_value": "no no no no no no unknown yes no no no no no ",
"value": "no no no no no no unknown 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: 268/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 113
lola: finding significant places
lola: 113 places, 155 transitions, 111 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: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: X ((((1 <= p46) AND (1 <= p111) AND (1 <= p89)) AND (NOT(F (((1 <= p100) AND (1 <= p111) AND (1 <= p46) AND (1 <= p111)))) OR NOT(G (((1 <= p36))))))) : (G ((((F (((1 <= p20) AND (1 <= p111))) U ((1 <= p20) AND (1 <= p111))) OR ((1 <= p20) AND (1 <= p111))) OR ((1 <= p12) AND (1 <= p111)))) OR F (G ((((1 <= p53)) OR ((1 <= p12) AND (1 <= p111)))))) : X ((G (((p81 <= 0))) AND NOT(G (((1 <= p67) AND (1 <= p111)))))) : X (X (G (F (((1 <= p49) AND (1 <= p111)))))) : (G (X (((1 <= p21) AND ((p70 <= 0) OR (p111 <= 0))))) U (((1 <= p21)) OR ((1 <= p54) AND (1 <= p112)))) : G (X (G (((1 <= p18))))) : (((G (((1 <= p106) AND (1 <= p111))) U (((1 <= p48) AND (1 <= p112)) OR ((1 <= p84)))) OR F (NOT(F (((1 <= p100) AND (1 <= p111)))))) OR ((1 <= p80) AND (1 <= p111))) : F (X (NOT(X (((1 <= p46)))))) : NOT(G (NOT(X ((F (((((1 <= p73)) U ((1 <= p22) AND (1 <= p111))) AND G (((1 <= p84) AND (1 <= p112))))) AND G (((1 <= p22) AND (1 <= p111)))))))) : (G (((p41 <= 0))) U F (((1 <= p91)))) : G (((((1 <= p76) AND (1 <= p111)) U (G (((1 <= p90) AND (1 <= p111))) AND ((p90 <= 0) OR (p111 <= 0)))) OR NOT(X (((1 <= p105) AND (1 <= p111)))))) : X (((G (((1 <= p33))) U G (NOT(F (((1 <= p46) AND (1 <= p111)))))) U G (NOT(F (((1 <= p104) AND (1 <= p112))))))) : G ((F ((((1 <= p88) AND (1 <= p112)) U ((1 <= p13) AND (1 <= p112)))) U G ((F (X (F (((1 <= p88) AND (1 <= p112))))) AND F (((1 <= p48) AND (1 <= p112)))))))
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p46) AND (1 <= p111) AND (1 <= p89)) AND (G (((p100 <= 0) OR (p111 <= 0) OR (p46 <= 0) OR (p111 <= 0))) OR F (((p36 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p46) AND (1 <= p111) AND (1 <= p89)) AND (G (((p100 <= 0) OR (p111 <= 0) OR (p46 <= 0) OR (p111 <= 0))) OR F (((p36 <= 0))))))
lola: processed formula length: 140
lola: 62 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: 57 markings, 57 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p81 <= 0))) AND F (((p67 <= 0) OR (p111 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p81 <= 0))) AND F (((p67 <= 0) OR (p111 <= 0)))))
lola: processed formula length: 59
lola: 62 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 72 markings, 77 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p21) AND ((p70 <= 0) OR (p111 <= 0))))) U (((1 <= p21)) OR ((1 <= p54) AND (1 <= p112))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p21) AND ((p70 <= 0) OR (p111 <= 0))))) U (((1 <= p21)) OR ((1 <= p54) AND (1 <= p112))))
lola: processed formula length: 105
lola: 62 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: 57 markings, 57 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p18))))
lola: processed formula length: 20
lola: 62 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: 57 markings, 57 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((p46 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((p46 <= 0)))))
lola: processed formula length: 24
lola: 62 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: 13 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((((1 <= p73)) U ((1 <= p22) AND (1 <= p111))) AND G (((1 <= p84) AND (1 <= p112))))) AND G (((1 <= p22) AND (1 <= p111))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((((1 <= p73)) U ((1 <= p22) AND (1 <= p111))) AND G (((1 <= p84) AND (1 <= p112))))) AND G (((1 <= p22) AND (1 <= p111))))))
lola: processed formula length: 135
lola: 62 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 58 markings, 58 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((((1 <= p76) AND (1 <= p111)) U (G (((1 <= p90) AND (1 <= p111))) AND ((p90 <= 0) OR (p111 <= 0)))) OR X (((p105 <= 0) OR (p111 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((((1 <= p76) AND (1 <= p111)) U (G (((1 <= p90) AND (1 <= p111))) AND ((p90 <= 0) OR (p111 <= 0)))) OR X (((p105 <= 0) OR (p111 <= 0)))))
lola: processed formula length: 143
lola: 62 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 285 markings, 290 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G (((p46 <= 0) OR (p111 <= 0))) OR (G (((1 <= p33))) AND F (G (((p46 <= 0) OR (p111 <= 0)))))) U G (((p104 <= 0) OR (p112 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G (((p46 <= 0) OR (p111 <= 0))) OR (G (((1 <= p33))) AND F (G (((p46 <= 0) OR (p111 <= 0)))))) U G (((p104 <= 0) OR (p112 <= 0)))))
lola: processed formula length: 139
lola: 62 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 63 markings, 64 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((X (F (((1 <= p88) AND (1 <= p112)))) AND F (((1 <= p48) AND (1 <= p112)))))) AND G ((F (((1 <= p13) AND (1 <= p112))) OR G ((X (F (((1 <= p88) AND (1 <= p112)))) AND F (((1 <= p48) AND (1 <= p112))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((1 <= p88) AND (1 <= p112)))) AND F (((1 <= p48) AND (1 <= p112))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((1 <= p88) AND (1 <= p112)))) AND F (((1 <= p48) AND (1 <= p112))))))
lola: processed formula length: 83
lola: 62 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: 58 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p49) AND (1 <= p111))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p49) AND (1 <= p111))))
lola: processed formula length: 36
lola: 62 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 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p91))) OR (G (((p41 <= 0))) AND F (((1 <= p91)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p91)))
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: ((p91 <= 0))
lola: processed formula length: 12
lola: 64 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: 14 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p48) AND (1 <= p112)) OR ((1 <= p84))) OR ((G (((1 <= p106) AND (1 <= p111))) AND F ((((1 <= p48) AND (1 <= p112)) OR ((1 <= p84))))) OR (F (G (((p100 <= 0) OR (p111 <= 0)))) OR ((1 <= p80) AND (1 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p80) AND (1 <= p111))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p80) AND (1 <= p111))
lola: processed formula length: 28
lola: 62 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: subprocess 12 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p48) AND (1 <= p112)) OR ((1 <= p84)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p48) AND (1 <= p112)) OR ((1 <= p84)))
lola: processed formula length: 47
lola: 62 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p48) AND (1 <= p112)) OR ((1 <= p84))))
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: (((p48 <= 0) OR (p112 <= 0)) AND ((p84 <= 0)))
lola: processed formula length: 47
lola: 64 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: 63 markings, 64 edges
lola: ========================================
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p100 <= 0) OR (p111 <= 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 (((p100 <= 0) OR (p111 <= 0))))
lola: processed formula length: 37
lola: 62 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: local time limit reached - aborting
lola:
preliminary result: no unknown no no no no unknown yes no no no no no
lola: memory consumption: 58548 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((F (((1 <= p20) AND (1 <= p111))) U ((1 <= p20) AND (1 <= p111))) OR (((1 <= p20) AND (1 <= p111)) OR ((1 <= p12) AND (1 <= p111))))) OR F (G ((((1 <= p53)) OR ((1 <= p12) AND (1 <= p111))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p53)) OR ((1 <= p12) AND (1 <= p111)))))
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 <= p53)) OR ((1 <= p12) AND (1 <= p111)))))
lola: processed formula length: 55
lola: 62 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 6
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, 6 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((1 <= p48) AND (1 <= p112)) OR ((1 <= p84))) OR ((G (((1 <= p106) AND (1 <= p111))) AND F ((((1 <= p48) AND (1 <= p112)) OR ((1 <= p84))))) OR (F (G (((p100 <= 0) OR (p111 <= 0)))) OR ((1 <= p80) AND (1 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p80) AND (1 <= p111))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p80) AND (1 <= p111))
lola: processed formula length: 28
lola: 62 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: (((1 <= p48) AND (1 <= p112)) OR ((1 <= p84)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p48) AND (1 <= p112)) OR ((1 <= p84)))
lola: processed formula length: 47
lola: 62 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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: G (((1 <= p106) AND (1 <= p111)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p106) AND (1 <= p111)))
lola: processed formula length: 33
lola: 62 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: 14 markings, 14 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p100 <= 0) OR (p111 <= 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 (((p100 <= 0) OR (p111 <= 0))))
lola: processed formula length: 37
lola: 62 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: 576185 markings, 4061382 edges, 115237 markings/sec, 0 secs
lola: 1166063 markings, 8117339 edges, 117976 markings/sec, 5 secs
lola: 1751214 markings, 12159202 edges, 117030 markings/sec, 10 secs
lola: 2177427 markings, 16280068 edges, 85243 markings/sec, 15 secs
lola: 2587529 markings, 20271427 edges, 82020 markings/sec, 20 secs
lola: 2964807 markings, 23753965 edges, 75456 markings/sec, 25 secs
lola: 3363690 markings, 27396043 edges, 79777 markings/sec, 30 secs
lola: 3829012 markings, 31228451 edges, 93064 markings/sec, 35 secs
lola: 4332648 markings, 35193246 edges, 100727 markings/sec, 40 secs
lola: 4854492 markings, 39115660 edges, 104369 markings/sec, 45 secs
lola: 5364527 markings, 43095318 edges, 102007 markings/sec, 50 secs
lola: 5781942 markings, 47105378 edges, 83483 markings/sec, 55 secs
lola: 6213983 markings, 50991808 edges, 86408 markings/sec, 60 secs
lola: 6662306 markings, 54884025 edges, 89665 markings/sec, 65 secs
lola: 7169014 markings, 58826717 edges, 101342 markings/sec, 70 secs
lola: 7619287 markings, 62620486 edges, 90055 markings/sec, 75 secs
lola: 8105122 markings, 66582915 edges, 97167 markings/sec, 80 secs
lola: 8598633 markings, 70482178 edges, 98702 markings/sec, 85 secs
lola: 9105154 markings, 74368760 edges, 101304 markings/sec, 90 secs
lola: 9596216 markings, 78268824 edges, 98212 markings/sec, 95 secs
lola: 10094365 markings, 82144175 edges, 99630 markings/sec, 100 secs
lola: 10542663 markings, 85973063 edges, 89660 markings/sec, 105 secs
lola: 10994659 markings, 89867917 edges, 90399 markings/sec, 110 secs
lola: 11466712 markings, 93736774 edges, 94411 markings/sec, 115 secs
lola: 11961689 markings, 97580431 edges, 98995 markings/sec, 120 secs
lola: 12458546 markings, 101503713 edges, 99371 markings/sec, 125 secs
lola: 12976471 markings, 105388114 edges, 103585 markings/sec, 130 secs
lola: 13526270 markings, 109282907 edges, 109960 markings/sec, 135 secs
lola: 13960112 markings, 113120547 edges, 86768 markings/sec, 140 secs
lola: 14457124 markings, 117090784 edges, 99402 markings/sec, 145 secs
lola: 14949691 markings, 121025834 edges, 98513 markings/sec, 150 secs
lola: 15438291 markings, 124871850 edges, 97720 markings/sec, 155 secs
lola: 15941711 markings, 128798569 edges, 100684 markings/sec, 160 secs
lola: 16452062 markings, 132642823 edges, 102070 markings/sec, 165 secs
lola: 16959084 markings, 136529762 edges, 101404 markings/sec, 170 secs
lola: 17457453 markings, 140450212 edges, 99674 markings/sec, 175 secs
lola: 17981029 markings, 144310140 edges, 104715 markings/sec, 180 secs
lola: 18461441 markings, 147888293 edges, 96082 markings/sec, 185 secs
lola: 18868180 markings, 151952400 edges, 81348 markings/sec, 190 secs
lola: 19271222 markings, 155984716 edges, 80608 markings/sec, 195 secs
lola: 19660833 markings, 160059277 edges, 77922 markings/sec, 200 secs
lola: 20027045 markings, 164111494 edges, 73242 markings/sec, 205 secs
lola: 20410268 markings, 168131182 edges, 76645 markings/sec, 210 secs
lola: 20780429 markings, 172166790 edges, 74032 markings/sec, 215 secs
lola: 21143000 markings, 176141132 edges, 72514 markings/sec, 220 secs
lola: 21504223 markings, 180143955 edges, 72245 markings/sec, 225 secs
lola: 21838838 markings, 184181559 edges, 66923 markings/sec, 230 secs
lola: 22172840 markings, 188177862 edges, 66800 markings/sec, 235 secs
lola: 22548262 markings, 192159877 edges, 75084 markings/sec, 240 secs
lola: 22899309 markings, 196120183 edges, 70209 markings/sec, 245 secs
lola: 23259016 markings, 200030724 edges, 71941 markings/sec, 250 secs
lola: 23614371 markings, 203901599 edges, 71071 markings/sec, 255 secs
lola: 23965809 markings, 207762023 edges, 70288 markings/sec, 260 secs
lola: 24324738 markings, 211635823 edges, 71786 markings/sec, 265 secs
lola: 24682905 markings, 215513724 edges, 71633 markings/sec, 270 secs
lola: 25008367 markings, 219343908 edges, 65092 markings/sec, 275 secs
lola: 25332550 markings, 223101323 edges, 64837 markings/sec, 280 secs
lola: 25682445 markings, 226887676 edges, 69979 markings/sec, 285 secs
lola: 26036979 markings, 230695652 edges, 70907 markings/sec, 290 secs
lola: 26385692 markings, 234403124 edges, 69743 markings/sec, 295 secs
lola: 26750822 markings, 238168667 edges, 73026 markings/sec, 300 secs
lola: 27100576 markings, 241980366 edges, 69951 markings/sec, 305 secs
lola: 27435910 markings, 245714057 edges, 67067 markings/sec, 310 secs
lola: 27780825 markings, 249457768 edges, 68983 markings/sec, 315 secs
lola: 28114020 markings, 253152816 edges, 66639 markings/sec, 320 secs
lola: 28466904 markings, 256911375 edges, 70577 markings/sec, 325 secs
lola: 28812957 markings, 260569312 edges, 69211 markings/sec, 330 secs
lola: 29191128 markings, 264529216 edges, 75634 markings/sec, 335 secs
lola: 29548054 markings, 268379469 edges, 71385 markings/sec, 340 secs
lola: 29882168 markings, 271756121 edges, 66823 markings/sec, 345 secs
lola: 30141637 markings, 274451934 edges, 51894 markings/sec, 350 secs
lola: 30387161 markings, 277071883 edges, 49105 markings/sec, 355 secs
lola: 30601234 markings, 279401386 edges, 42815 markings/sec, 360 secs
lola: 30822027 markings, 281699475 edges, 44159 markings/sec, 365 secs
lola: 31110824 markings, 284527988 edges, 57759 markings/sec, 370 secs
lola: 31456280 markings, 288202827 edges, 69091 markings/sec, 375 secs
lola: 31785702 markings, 291757952 edges, 65884 markings/sec, 380 secs
lola: 32126034 markings, 295286910 edges, 68066 markings/sec, 385 secs
lola: 32410077 markings, 298033252 edges, 56809 markings/sec, 390 secs
lola: 32765993 markings, 301822801 edges, 71183 markings/sec, 395 secs
lola: 33107870 markings, 305498770 edges, 68375 markings/sec, 400 secs
lola: 33458772 markings, 309137743 edges, 70180 markings/sec, 405 secs
lola: 33733610 markings, 311913680 edges, 54968 markings/sec, 410 secs
lola: 34116773 markings, 315785864 edges, 76633 markings/sec, 415 secs
lola: 34470730 markings, 319624229 edges, 70791 markings/sec, 420 secs
lola: 34829517 markings, 323342504 edges, 71757 markings/sec, 425 secs
lola: 35140749 markings, 326511514 edges, 62246 markings/sec, 430 secs
lola: 35511449 markings, 330078494 edges, 74140 markings/sec, 435 secs
lola: 35872676 markings, 333977861 edges, 72245 markings/sec, 440 secs
lola: 36224487 markings, 337732145 edges, 70362 markings/sec, 445 secs
lola: 36562822 markings, 341230447 edges, 67667 markings/sec, 450 secs
lola: 36882464 markings, 344455726 edges, 63928 markings/sec, 455 secs
lola: 37268565 markings, 348183968 edges, 77220 markings/sec, 460 secs
lola: 37633342 markings, 352127915 edges, 72955 markings/sec, 465 secs
lola: 37988394 markings, 355911879 edges, 71010 markings/sec, 470 secs
lola: 38321302 markings, 359344584 edges, 66582 markings/sec, 475 secs
lola: 38652432 markings, 362656365 edges, 66226 markings/sec, 480 secs
lola: 39036585 markings, 366312544 edges, 76831 markings/sec, 485 secs
lola: 39521965 markings, 370166292 edges, 97076 markings/sec, 490 secs
lola: 40015541 markings, 373984186 edges, 98715 markings/sec, 495 secs
lola: 40532731 markings, 377789189 edges, 103438 markings/sec, 500 secs
lola: 40948055 markings, 381731019 edges, 83065 markings/sec, 505 secs
lola: 41311499 markings, 385662277 edges, 72689 markings/sec, 510 secs
lola: 41674760 markings, 389470485 edges, 72652 markings/sec, 515 secs
lola: 42003924 markings, 392803993 edges, 65833 markings/sec, 520 secs
lola: 42361144 markings, 396368554 edges, 71444 markings/sec, 525 secs
lola: 42780705 markings, 400172843 edges, 83912 markings/sec, 530 secs
lola: 43220307 markings, 404019170 edges, 87920 markings/sec, 535 secs
lola: 43688735 markings, 407870119 edges, 93686 markings/sec, 540 secs
lola: 44164305 markings, 411701256 edges, 95114 markings/sec, 545 secs
lola: 44543668 markings, 415596865 edges, 75873 markings/sec, 550 secs
lola: 44939818 markings, 419481875 edges, 79230 markings/sec, 555 secs
lola: 45326409 markings, 423261748 edges, 77318 markings/sec, 560 secs
lola: 45728178 markings, 427036133 edges, 80354 markings/sec, 565 secs
lola: 46177692 markings, 430904775 edges, 89903 markings/sec, 570 secs
lola: 46583227 markings, 434604849 edges, 81107 markings/sec, 575 secs
lola: 47013883 markings, 438453188 edges, 86131 markings/sec, 580 secs
lola: 47457498 markings, 442248737 edges, 88723 markings/sec, 585 secs
lola: 47892414 markings, 446025308 edges, 86983 markings/sec, 590 secs
lola: 48342093 markings, 449833604 edges, 89936 markings/sec, 595 secs
lola: 48782551 markings, 453616908 edges, 88092 markings/sec, 600 secs
lola: 49233327 markings, 457416898 edges, 90155 markings/sec, 605 secs
lola: 49614321 markings, 461170801 edges, 76199 markings/sec, 610 secs
lola: 50030299 markings, 464956893 edges, 83196 markings/sec, 615 secs
lola: 50456093 markings, 468716473 edges, 85159 markings/sec, 620 secs
lola: 50906664 markings, 472514907 edges, 90114 markings/sec, 625 secs
lola: 51335666 markings, 476292114 edges, 85800 markings/sec, 630 secs
lola: 51795101 markings, 480092143 edges, 91887 markings/sec, 635 secs
lola: 52266985 markings, 483878124 edges, 94377 markings/sec, 640 secs
lola: 52723835 markings, 487742361 edges, 91370 markings/sec, 645 secs
lola: 53119088 markings, 491411557 edges, 79051 markings/sec, 650 secs
lola: 53555219 markings, 495239461 edges, 87226 markings/sec, 655 secs
lola: 53989468 markings, 499001867 edges, 86850 markings/sec, 660 secs
lola: 54419378 markings, 502708535 edges, 85982 markings/sec, 665 secs
lola: 54863502 markings, 506497092 edges, 88825 markings/sec, 670 secs
lola: 55311959 markings, 510218633 edges, 89691 markings/sec, 675 secs
lola: 55754278 markings, 513948628 edges, 88464 markings/sec, 680 secs
lola: 56199515 markings, 517769402 edges, 89047 markings/sec, 685 secs
lola: 56664791 markings, 521523801 edges, 93055 markings/sec, 690 secs
lola: 57118722 markings, 525246813 edges, 90786 markings/sec, 695 secs
lola: 57483170 markings, 529159303 edges, 72890 markings/sec, 700 secs
lola: 57876355 markings, 533016287 edges, 78637 markings/sec, 705 secs
lola: 58262674 markings, 536766961 edges, 77264 markings/sec, 710 secs
lola: 58610795 markings, 540518624 edges, 69624 markings/sec, 715 secs
lola: 58948601 markings, 544571709 edges, 67561 markings/sec, 720 secs
lola: 59283613 markings, 548566221 edges, 67002 markings/sec, 725 secs
lola: 59597559 markings, 552263549 edges, 62789 markings/sec, 730 secs
lola: 59925794 markings, 555972453 edges, 65647 markings/sec, 735 secs
lola: 60252356 markings, 559899209 edges, 65312 markings/sec, 740 secs
lola: 60603288 markings, 563603561 edges, 70186 markings/sec, 745 secs
lola: 60967123 markings, 567261869 edges, 72767 markings/sec, 750 secs
lola: 61276935 markings, 571043557 edges, 61962 markings/sec, 755 secs
lola: 61577387 markings, 574961330 edges, 60090 markings/sec, 760 secs
lola: 61910454 markings, 578724508 edges, 66613 markings/sec, 765 secs
lola: 62243379 markings, 582427336 edges, 66585 markings/sec, 770 secs
lola: 62639925 markings, 586178127 edges, 79309 markings/sec, 775 secs
lola: 63012337 markings, 589935828 edges, 74482 markings/sec, 780 secs
lola: 63329168 markings, 593867420 edges, 63366 markings/sec, 785 secs
lola: 63736301 markings, 597403332 edges, 81427 markings/sec, 790 secs
lola: 64108898 markings, 600912800 edges, 74519 markings/sec, 795 secs
lola: 64507677 markings, 604460457 edges, 79756 markings/sec, 800 secs
lola: 64859619 markings, 607955400 edges, 70388 markings/sec, 805 secs
lola: 65195726 markings, 611329894 edges, 67221 markings/sec, 810 secs
lola: 65484837 markings, 615066442 edges, 57822 markings/sec, 815 secs
lola: 65820436 markings, 618608298 edges, 67120 markings/sec, 820 secs
lola: 66083408 markings, 622012064 edges, 52594 markings/sec, 825 secs
lola: 66416610 markings, 625446301 edges, 66640 markings/sec, 830 secs
lola: 66724259 markings, 628962174 edges, 61530 markings/sec, 835 secs
lola: 67050617 markings, 632701752 edges, 65272 markings/sec, 840 secs
lola: 67367638 markings, 636056583 edges, 63404 markings/sec, 845 secs
lola: 67720221 markings, 639482389 edges, 70517 markings/sec, 850 secs
lola: 68086474 markings, 642974729 edges, 73251 markings/sec, 855 secs
lola: 68417898 markings, 646683998 edges, 66285 markings/sec, 860 secs
lola: 68751992 markings, 650415878 edges, 66819 markings/sec, 865 secs
lola: 69140467 markings, 654158188 edges, 77695 markings/sec, 870 secs
lola: 69506275 markings, 657561910 edges, 73162 markings/sec, 875 secs
lola: 69878621 markings, 660910166 edges, 74469 markings/sec, 880 secs
lola: 70276882 markings, 664317188 edges, 79652 markings/sec, 885 secs
lola: 70637703 markings, 667756932 edges, 72164 markings/sec, 890 secs
lola: 70941481 markings, 671361268 edges, 60756 markings/sec, 895 secs
lola: 71295234 markings, 674872546 edges, 70751 markings/sec, 900 secs
lola: 71587527 markings, 678270232 edges, 58459 markings/sec, 905 secs
lola: 71924175 markings, 681575089 edges, 67330 markings/sec, 910 secs
lola: 72271584 markings, 685281061 edges, 69482 markings/sec, 915 secs
lola: 72625552 markings, 688904809 edges, 70794 markings/sec, 920 secs
lola: 72956581 markings, 692351780 edges, 66206 markings/sec, 925 secs
lola: 73321277 markings, 695785885 edges, 72939 markings/sec, 930 secs
lola: 73668622 markings, 699400480 edges, 69469 markings/sec, 935 secs
lola: 74014453 markings, 703122030 edges, 69166 markings/sec, 940 secs
lola: 74368174 markings, 706637978 edges, 70744 markings/sec, 945 secs
lola: 74740533 markings, 710156938 edges, 74472 markings/sec, 950 secs
lola: 75127524 markings, 713744456 edges, 77398 markings/sec, 955 secs
lola: 75588899 markings, 717550348 edges, 92275 markings/sec, 960 secs
lola: 76064111 markings, 721350464 edges, 95042 markings/sec, 965 secs
lola: 76541107 markings, 725170113 edges, 95399 markings/sec, 970 secs
lola: 77015483 markings, 728902282 edges, 94875 markings/sec, 975 secs
lola: 77511861 markings, 732654529 edges, 99276 markings/sec, 980 secs
lola: 78000925 markings, 736407981 edges, 97813 markings/sec, 985 secs
lola: 78453960 markings, 740174948 edges, 90607 markings/sec, 990 secs
lola: 78817393 markings, 744173582 edges, 72687 markings/sec, 995 secs
lola: 79165375 markings, 748153101 edges, 69596 markings/sec, 1000 secs
lola: 79520432 markings, 752003194 edges, 71011 markings/sec, 1005 secs
lola: 79858147 markings, 755796469 edges, 67543 markings/sec, 1010 secs
lola: 80210141 markings, 759571983 edges, 70399 markings/sec, 1015 secs
lola: 80566557 markings, 763358022 edges, 71283 markings/sec, 1020 secs
lola: 80847208 markings, 766276039 edges, 56130 markings/sec, 1025 secs
lola: 81185927 markings, 769754013 edges, 67744 markings/sec, 1030 secs
lola: 81528429 markings, 773285195 edges, 68500 markings/sec, 1035 secs
lola: 81880791 markings, 776906856 edges, 70472 markings/sec, 1040 secs
lola: 82276229 markings, 780536993 edges, 79088 markings/sec, 1045 secs
lola: 82678853 markings, 784292706 edges, 80525 markings/sec, 1050 secs
lola: 83113719 markings, 788083923 edges, 86973 markings/sec, 1055 secs
lola: 83550808 markings, 791937000 edges, 87418 markings/sec, 1060 secs
lola: 83993652 markings, 795688901 edges, 88569 markings/sec, 1065 secs
lola: 84456888 markings, 799481402 edges, 92647 markings/sec, 1070 secs
lola: 84896799 markings, 803262623 edges, 87982 markings/sec, 1075 secs
lola: 85354267 markings, 807039870 edges, 91494 markings/sec, 1080 secs
lola: 85733711 markings, 810916673 edges, 75889 markings/sec, 1085 secs
lola: 86113459 markings, 814676676 edges, 75950 markings/sec, 1090 secs
lola: 86502265 markings, 818564623 edges, 77761 markings/sec, 1095 secs
lola: 86904009 markings, 822316439 edges, 80349 markings/sec, 1100 secs
lola: 87283564 markings, 826065794 edges, 75911 markings/sec, 1105 secs
lola: 87680454 markings, 829836214 edges, 79378 markings/sec, 1110 secs
lola: 88081262 markings, 833520196 edges, 80162 markings/sec, 1115 secs
lola: 88529677 markings, 837271541 edges, 89683 markings/sec, 1120 secs
lola: 88976563 markings, 841088578 edges, 89377 markings/sec, 1125 secs
lola: 89322981 markings, 844833338 edges, 69284 markings/sec, 1130 secs
lola: 89682094 markings, 848339326 edges, 71823 markings/sec, 1135 secs
lola: 90139694 markings, 852141018 edges, 91520 markings/sec, 1140 secs
lola: 90533457 markings, 855968980 edges, 78753 markings/sec, 1145 secs
lola: 90944589 markings, 859695888 edges, 82226 markings/sec, 1150 secs
lola: 91361875 markings, 863416490 edges, 83457 markings/sec, 1155 secs
lola: 91785772 markings, 867081559 edges, 84779 markings/sec, 1160 secs
lola: 92181417 markings, 870759687 edges, 79129 markings/sec, 1165 secs
lola: 92615880 markings, 874485244 edges, 86893 markings/sec, 1170 secs
lola: 93038679 markings, 878192293 edges, 84560 markings/sec, 1175 secs
lola: 93461336 markings, 881955345 edges, 84531 markings/sec, 1180 secs
lola: 93887965 markings, 885622615 edges, 85326 markings/sec, 1185 secs
lola: 94306738 markings, 889389451 edges, 83755 markings/sec, 1190 secs
lola: 94750332 markings, 893081175 edges, 88719 markings/sec, 1195 secs
lola: 95149303 markings, 896871383 edges, 79794 markings/sec, 1200 secs
lola: 95508049 markings, 900442480 edges, 71749 markings/sec, 1205 secs
lola: 95911801 markings, 904206518 edges, 80750 markings/sec, 1210 secs
lola: 96307106 markings, 907913578 edges, 79061 markings/sec, 1215 secs
lola: 96703775 markings, 911584092 edges, 79334 markings/sec, 1220 secs
lola: 97115679 markings, 915286967 edges, 82381 markings/sec, 1225 secs
lola: 97525465 markings, 918981026 edges, 81957 markings/sec, 1230 secs
lola: 97973847 markings, 922696852 edges, 89676 markings/sec, 1235 secs
lola: 98374197 markings, 926453154 edges, 80070 markings/sec, 1240 secs
lola: 98807443 markings, 930217812 edges, 86649 markings/sec, 1245 secs
lola: 99238338 markings, 934018031 edges, 86179 markings/sec, 1250 secs
lola: 99681677 markings, 937771926 edges, 88668 markings/sec, 1255 secs
lola: 100140094 markings, 941531753 edges, 91683 markings/sec, 1260 secs
lola: 100581452 markings, 945318573 edges, 88272 markings/sec, 1265 secs
lola: 101047320 markings, 949058529 edges, 93174 markings/sec, 1270 secs
lola: 101538698 markings, 952860329 edges, 98276 markings/sec, 1275 secs
lola: 101886717 markings, 956714549 edges, 69604 markings/sec, 1280 secs
lola: 102223759 markings, 960193465 edges, 67408 markings/sec, 1285 secs
lola: 102666136 markings, 963984664 edges, 88475 markings/sec, 1290 secs
lola: 103076952 markings, 967791298 edges, 82163 markings/sec, 1295 secs
lola: 103482883 markings, 971537499 edges, 81186 markings/sec, 1300 secs
lola: 103903090 markings, 975262291 edges, 84041 markings/sec, 1305 secs
lola: 104318286 markings, 978906401 edges, 83039 markings/sec, 1310 secs
lola: 104715593 markings, 982548979 edges, 79461 markings/sec, 1315 secs
lola: 105132583 markings, 986202667 edges, 83398 markings/sec, 1320 secs
lola: 105583350 markings, 989903720 edges, 90153 markings/sec, 1325 secs
lola: 105979315 markings, 993628336 edges, 79193 markings/sec, 1330 secs
lola: 106397822 markings, 997260112 edges, 83701 markings/sec, 1335 secs
lola: 106823000 markings, 1000903129 edges, 85036 markings/sec, 1340 secs
lola: 107233638 markings, 1004575307 edges, 82128 markings/sec, 1345 secs
lola: 107567184 markings, 1008336591 edges, 66709 markings/sec, 1350 secs
lola: 107939177 markings, 1011923895 edges, 74399 markings/sec, 1355 secs
lola: 108281187 markings, 1015425720 edges, 68402 markings/sec, 1360 secs
lola: 108638431 markings, 1018848494 edges, 71449 markings/sec, 1365 secs
lola: 109091603 markings, 1022631106 edges, 90634 markings/sec, 1370 secs
lola: 109463844 markings, 1026215110 edges, 74448 markings/sec, 1375 secs
lola: 109895808 markings, 1029931722 edges, 86393 markings/sec, 1380 secs
lola: 110322891 markings, 1033604001 edges, 85417 markings/sec, 1385 secs
lola: 110699549 markings, 1036828708 edges, 75332 markings/sec, 1390 secs
lola: 111076037 markings, 1039868807 edges, 75298 markings/sec, 1395 secs
lola: 111488600 markings, 1043409887 edges, 82513 markings/sec, 1400 secs
lola: 111902929 markings, 1046996104 edges, 82866 markings/sec, 1405 secs
lola: 112285516 markings, 1050257345 edges, 76517 markings/sec, 1410 secs
lola: 112652483 markings, 1053439250 edges, 73393 markings/sec, 1415 secs
lola: 113003415 markings, 1056360704 edges, 70186 markings/sec, 1420 secs
lola: 113386617 markings, 1059475704 edges, 76640 markings/sec, 1425 secs
lola: 113695559 markings, 1062030025 edges, 61788 markings/sec, 1430 secs
lola: 113967208 markings, 1065138154 edges, 54330 markings/sec, 1435 secs
lola: 114251779 markings, 1068469347 edges, 56914 markings/sec, 1440 secs
lola: 114520517 markings, 1071578730 edges, 53748 markings/sec, 1445 secs
lola: 114813322 markings, 1074878473 edges, 58561 markings/sec, 1450 secs
lola: 115051585 markings, 1077513561 edges, 47653 markings/sec, 1455 secs
lola: 115320756 markings, 1080490198 edges, 53834 markings/sec, 1460 secs
lola: 115605792 markings, 1083381849 edges, 57007 markings/sec, 1465 secs
lola: 115887394 markings, 1086160677 edges, 56320 markings/sec, 1470 secs
lola: 116247659 markings, 1089543943 edges, 72053 markings/sec, 1475 secs
lola: 116574741 markings, 1092472283 edges, 65416 markings/sec, 1480 secs
lola: 116889458 markings, 1095263666 edges, 62943 markings/sec, 1485 secs
lola: 117198532 markings, 1097988574 edges, 61815 markings/sec, 1490 secs
lola: 117454287 markings, 1100868381 edges, 51151 markings/sec, 1495 secs
lola: 117732465 markings, 1103927606 edges, 55636 markings/sec, 1500 secs
lola: 118048732 markings, 1107170529 edges, 63253 markings/sec, 1505 secs
lola: 118304100 markings, 1109920973 edges, 51074 markings/sec, 1510 secs
lola: 118559148 markings, 1112459671 edges, 51010 markings/sec, 1515 secs
lola: 118882351 markings, 1115521597 edges, 64641 markings/sec, 1520 secs
lola: 119166988 markings, 1118279021 edges, 56927 markings/sec, 1525 secs
lola: 119426808 markings, 1121059522 edges, 51964 markings/sec, 1530 secs
lola: 119753532 markings, 1124093466 edges, 65345 markings/sec, 1535 secs
lola: 120050855 markings, 1126977434 edges, 59465 markings/sec, 1540 secs
lola: 120341557 markings, 1129651763 edges, 58140 markings/sec, 1545 secs
lola: 120627115 markings, 1132356177 edges, 57112 markings/sec, 1550 secs
lola: 120942236 markings, 1135225355 edges, 63024 markings/sec, 1555 secs
lola: 121244162 markings, 1138001898 edges, 60385 markings/sec, 1560 secs
lola: 121513515 markings, 1140478748 edges, 53871 markings/sec, 1565 secs
lola: 121814300 markings, 1143321483 edges, 60157 markings/sec, 1570 secs
lola: 122134396 markings, 1146142914 edges, 64019 markings/sec, 1575 secs
lola: 122399760 markings, 1149023900 edges, 53073 markings/sec, 1580 secs
lola: 122716657 markings, 1152232021 edges, 63379 markings/sec, 1585 secs
lola: 122992050 markings, 1154883870 edges, 55079 markings/sec, 1590 secs
lola: 123283433 markings, 1157667737 edges, 58277 markings/sec, 1595 secs
lola: 123563503 markings, 1160339689 edges, 56014 markings/sec, 1600 secs
lola: 123874740 markings, 1163112488 edges, 62247 markings/sec, 1605 secs
lola: 124139389 markings, 1165658177 edges, 52930 markings/sec, 1610 secs
lola: 124460146 markings, 1168729117 edges, 64151 markings/sec, 1615 secs
lola: 124783224 markings, 1171636143 edges, 64616 markings/sec, 1620 secs
lola: 125102571 markings, 1174450076 edges, 63869 markings/sec, 1625 secs
lola: 125480160 markings, 1177630391 edges, 75518 markings/sec, 1630 secs
lola: 125749251 markings, 1180330495 edges, 53818 markings/sec, 1635 secs
lola: 126004535 markings, 1183033516 edges, 51057 markings/sec, 1640 secs
lola: 126330653 markings, 1186079382 edges, 65224 markings/sec, 1645 secs
lola: 126622200 markings, 1188887037 edges, 58309 markings/sec, 1650 secs
lola: 126911047 markings, 1191544579 edges, 57769 markings/sec, 1655 secs
lola: 127226286 markings, 1194517754 edges, 63048 markings/sec, 1660 secs
lola: 127521790 markings, 1197209929 edges, 59101 markings/sec, 1665 secs
lola: 127805995 markings, 1199821245 edges, 56841 markings/sec, 1670 secs
lola: 128103200 markings, 1202532805 edges, 59441 markings/sec, 1675 secs
lola: 128411437 markings, 1205273658 edges, 61647 markings/sec, 1680 secs
lola: 128725546 markings, 1208159298 edges, 62822 markings/sec, 1685 secs
lola: 129014193 markings, 1210908410 edges, 57729 markings/sec, 1690 secs
lola: 129349672 markings, 1213938892 edges, 67096 markings/sec, 1695 secs
lola: 129650895 markings, 1216621363 edges, 60245 markings/sec, 1700 secs
lola: 129963213 markings, 1219401554 edges, 62464 markings/sec, 1705 secs
lola: 130391100 markings, 1222823127 edges, 85577 markings/sec, 1710 secs
lola: 130860557 markings, 1226495503 edges, 93891 markings/sec, 1715 secs
lola: 131342396 markings, 1230097586 edges, 96368 markings/sec, 1720 secs
lola: 131813491 markings, 1233700093 edges, 94219 markings/sec, 1725 secs
lola: 132173529 markings, 1237540537 edges, 72008 markings/sec, 1730 secs
lola: 132517062 markings, 1241222454 edges, 68707 markings/sec, 1735 secs
lola: 132866845 markings, 1244849051 edges, 69957 markings/sec, 1740 secs
lola: 133149031 markings, 1247682596 edges, 56437 markings/sec, 1745 secs
lola: 133487459 markings, 1251087996 edges, 67686 markings/sec, 1750 secs
lola: 133886444 markings, 1254671684 edges, 79797 markings/sec, 1755 secs
lola: 134300697 markings, 1258295097 edges, 82851 markings/sec, 1760 secs
lola: 134733074 markings, 1261887182 edges, 86475 markings/sec, 1765 secs
lola: 135177448 markings, 1265458753 edges, 88875 markings/sec, 1770 secs
lola: 135551653 markings, 1269105179 edges, 74841 markings/sec, 1775 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (((F (((1 <= p20) AND (1 <= p111))) U ((1 <= p20) AND (1 <= p111))) OR (((1 <= p20) AND (1 <= p111)) OR ((1 <= p12) AND (1 <= p111))))) OR F (G ((((1 <= p53)) OR ((1 <= p12) AND (1 <= p111))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p53)) OR ((1 <= p12) AND (1 <= p111)))))
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 <= p53)) OR ((1 <= p12) AND (1 <= p111)))))
lola: processed formula length: 55
lola: 62 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 6
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, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((F (((1 <= p20) AND (1 <= p111))) U ((1 <= p20) AND (1 <= p111))) OR (((1 <= p20) AND (1 <= p111)) OR ((1 <= p12) AND (1 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((F (((1 <= p20) AND (1 <= p111))) U ((1 <= p20) AND (1 <= p111))) OR (((1 <= p20) AND (1 <= p111)) OR ((1 <= p12) AND (1 <= p111)))))
lola: processed formula length: 137
lola: 62 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: 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: 51 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no unknown yes no no no no no
lola:
preliminary result: no no no no no no unknown yes no no no no no
lola: memory consumption: 3976 KB
lola: time consumption: 1790 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="DiscoveryGPU-PT-11a"
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 DiscoveryGPU-PT-11a, 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 r094-tall-162048902400158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-11a.tgz
mv DiscoveryGPU-PT-11a 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 '
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 ;